Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data

Bouajjani, Ahmed; Drăgoi, Cezara; Enea, Constantin; Sighireanu, Mihaela

doi:10.1007/978-3-642-33386-6_14

Cited by 30 publications

(38 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Together with other tools such as SLAD [2] that are based on the graphbased approach to entailment checking from [3], this suggests that this approach not only yields new complexity results, but also delivers practically-usable and high-performance algorithms. We are confident that SeLoger can serve as a basis for future work on graph-based algorithms and decision procedures for even richer fragments of separation logic and will find its way into future program verifiers.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

SeLoger: A Tool for Graph-Based Reasoning in Separation Logic

Haase

Ishtiaq

Ouaknine

et al. 2013

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. This paper introduces the tool SeLoger, which is a reasoner for satisfiability and entailment in a fragment of separation logic with pointers and linked lists. SeLoger builds upon and extends graphbased algorithms that have recently been introduced in order to settle both decision problems in polynomial time. Running SeLoger on standard benchmarks shows that the tool outperforms current state-of-theart tools by orders of magnitude.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Recently, in [2] Bouajjani et al have introduced the tool SLAD which also builds upon some of the ideas presented in [3]. One difference to our tool is that it decides entailment under intuitionistic semantics, which is also the semantic model considered in [3].…”

Section: Introductionmentioning

confidence: 99%

SeLoger: A Tool for Graph-Based Reasoning in Separation Logic

Haase

Ishtiaq

Ouaknine

et al. 2013

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…The results in this paper show that reachability properties of programs manipulating linked lists can be verified using a simple decidable logic AE R . Many recent decidable logics for reasoning about linked lists have been proposed [17,22,15,3]. In comparison to these works we drastically restrict the way quantifiers are allowed but permit arbitrary use of relations.…”

Section: Related Workmentioning

confidence: 99%

Effectively-Propositional Reasoning about Reachability in Linked Data Structures

Itzhaky

Banerjee

Immerman

et al. 2013

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. This paper proposes a novel method of harnessing existing SAT solvers to verify reachability properties of programs that manipulate linked-list data structures. Such properties are essential for proving program termination, correctness of data structure invariants, and other safety properties. Our solution is complete, i.e., a SAT solver produces a counterexample whenever a program does not satisfy its specification. This result is surprising since even first-order theorem provers usually cannot deal with reachability in a complete way, because doing so requires reasoning about transitive closure. Our result is based on the following ideas: (1) Programmers must write assertions in a restricted logic without quantifier alternation or function symbols. (2) The correctness of many programs can be expressed in such restricted logics, although we explain the tradeoffs. (3) Recent results in descriptive complexity can be utilized to show that every program that manipulates potentially cyclic, singly-and doubly-linked lists and that is annotated with assertions written in this restricted logic, can be verified with a SAT solver. We implemented a tool atop Z3 and used it to show the correctness of several linked list programs.

show abstract

“…Many decision procedures for reasoning about linked lists have been proposed [4,15,17,28]. All these logics are based on monadic second-order logic on trees which has a non-elementary time (and space) asymptotic complexity.…”

Section: Decision Proceduresmentioning

confidence: 99%

Modular reasoning about heap paths via effectively propositional formulas

Itzhaky

Banerjee

Immerman

et al. 2014

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

First order logic with transitive closure, and separation logic enable elegant interactive verification of heap-manipulating programs. However, undecidabilty results and high asymptotic complexity of checking validity preclude complete automatic verification of such programs, even when loop invariants and procedure contracts are specified as formulas in these logics. This paper tackles the problem of procedure-modular verification of reachability properties of heap-manipulating programs using efficient decision procedures that are complete: that is, a SAT solver must generate a counterexample whenever a program does not satisfy its specification. By (a) requiring each procedure modifies a fixed set of heap partitions and creates a bounded amount of heap sharing, and (b) restricting program contracts and loop invariants to use only deterministic paths in the heap, we show that heap reachability updates can be described in a simple manner. The restrictions force program specifications and verification conditions to lie within a fragment of first-order logic with transitive closure that is reducible to effectively propositional logic, and hence facilitate sound, complete and efficient verification. We implemented a tool atop Z3 and report on preliminary experiments that establish the correctness of several programs that manipulate linked data structures.

show abstract

Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data

Cited by 30 publications

References 18 publications

SeLoger: A Tool for Graph-Based Reasoning in Separation Logic

SeLoger: A Tool for Graph-Based Reasoning in Separation Logic

Effectively-Propositional Reasoning about Reachability in Linked Data Structures

Modular reasoning about heap paths via effectively propositional formulas

Contact Info

Product

Resources

About