Incorrectness Separation Logic with Arrays and Pointer Arithmetic
By: Yeonseok Lee, Koji Nakazawa
Potential Business Impact:
Finds bugs in computer programs automatically.
Incorrectness Separation Logic (ISL) is a proof system designed to automate verification and detect bugs in programs manipulating heap memories. In this study, we extend ISL to support variable-length array predicates and pointer arithmetic. Additionally, we prove the relative completeness of this extended ISL by constructing the weakest postconditions. Relative completeness means that all valid ISL triples are provable, assuming an oracle capable of checking entailment between formulas; this property ensures the reliability of the proof system.
Similar Papers
Relative Completeness of Incorrectness Separation Logic
Logic in Computer Science
Finds bugs in computer programs better.
Separating the Wheat from the Chaff: Understanding (In-)Completeness of Proof Mechanisms for Separation Logic with Inductive Definitions
Logic in Computer Science
Finds bugs in computer programs automatically.
Separating the Wheat from the Chaff: Understanding (In-)Completeness of Proof Mechanisms for Separation Logic with Inductive Definitions
Logic in Computer Science
Finds bugs in computer programs automatically.