Predator: A Tool for Verification of Low-Level List Manipulation

Dudka, Kamil; Müller, Petr; Peringer, Petr; Vojnar, Tomáš

doi:10.1007/978-3-642-36742-7_49

Cited by 8 publications

(8 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many tools exploit dynamic analysis either for the verification of C programs [15,4,16] with abstract interpretation in some cases and focused on memory-related errors [17,18] or in particular for the termination analysis [19,20]. This approach is also commonly used for Java [12] or object-based program analysis, with a garbage collection mechanism [21].…”

Section: Related Workmentioning

confidence: 99%

System-level state equality detection for the formal dynamic verification of legacy distributed applications

Guthmuller

Corona

Quinson

2018

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

The ever increasing complexity of distributed systems mandates to formally verify their design and implementation. Unfortunately, the common approaches and existing tools to formally establish the correctness of these systems remain hardly applicable to most legacy HPC applications, that are commonly written in Fortran or C/C++, using the MPI standard.This work addresses the problem of automatically detecting at system-level the equality of the application's state. This allows to automatically verify safety and liveness properties on legacy HPC applications. We present how this state equality detection can be achieved without any source code static analysis, but at runtime using memory introspection and classical debugging techniques.We demonstrate the effectiveness of our approach through the exhaustive verification of several programs from the MPICH3 test suite and through the partial termination analysis of some applications from the Competition on Software Verification (SV-COMP).

show abstract

Section: Related Workmentioning

confidence: 99%

System-level state equality detection for the formal dynamic verification of legacy distributed applications

Guthmuller

Corona

Quinson

2018

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

show abstract

“…So far, most of the applications of separation logic have exploited only separating conjunction. For example, all existing verification tools based on separation logic, such as Smallfoot [3], Space Invader [11], THOR [23], SLAyer [1], HIP [25], jStar [12], Xisa [10], VeriFast [19], Infer [7], and Predator [14], use a decidable fragment by Berdine et al [2] or its extension which provides only separating conjunction. By virtue of the principle of local reasoning, however, these tools are highly successful in their individual verification domains despite not using separating implication at all.…”

Section: Introductionmentioning

confidence: 99%

A proof system for separation logic with magic wand

Lee

Park

2014

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

View full text Add to dashboard Cite

Separation logic is an extension of Hoare logic which is acknowledged as an enabling technology for large-scale program verification. It features two new logical connectives, separating conjunction and separating implication, but most of the applications of separation logic have exploited only separating conjunction without considering separating implication. Nevertheless the power of separating implication has been well recognized and there is a growing interest in its use for program verification. This paper develops a proof system for full separation logic which supports not only separating conjunction but also separating implication. The proof system is developed in the style of sequent calculus and satisfies the admissibility of cut. The key challenge in the development is to devise a set of inference rules for manipulating heap structures that ensure the completeness of the proof system with respect to separation logic. We show that our proof of completeness directly translates to a proof search strategy.

show abstract

“…The use of separation logic in manual, semi-automated, and automated verification tools is a burgeoning field [3,12,24,13,17]. Most of these incorporate some form of automated reasoning for separation logic, but only limited fragments of separation logic are typically handled.…”

Section: Introductionmentioning

confidence: 99%

Satisfiability modulo abstraction for separation logic with linked lists

Thakur

Breck

Reps

2014

Proceedings of the 2014 International SPIN Symposium on Model Checking of Software

View full text Add to dashboard Cite

Abstract. Separation logic is an expressive logic for reasoning about heap structures in programs. This paper presents a semi-decision procedure for deciding unsatisfiability of formulas in a fragment of separation logic that includes predicates describing points-to assertions (x → y), acyclic-list-segment assertions(ls(x, y)), logical-and, logical-or, separating conjunction, and septraction (the DeMorgan-dual of separating implication). The fragment that we consider allows negation at leaves, and includes formulas that lie outside other separation-logic fragments considered in the literature.The semi-decision procedure is designed using concepts from abstract interpretation. The procedure uses an abstract domain of shape graphs to represent a set of heap structures, and computes an abstraction that over-approximates the set of satisfying models of a given formula. If the over-approximation is empty, then the formula is unsatisfiable. We have implemented the method, and evaluated it on a set of formulas taken from the literature. The implementation is able to establish the unsatisfiability of formulas that cannot be handled by other existing approaches.

show abstract

Predator: A Tool for Verification of Low-Level List Manipulation

Cited by 8 publications

References 3 publications

System-level state equality detection for the formal dynamic verification of legacy distributed applications

System-level state equality detection for the formal dynamic verification of legacy distributed applications

A proof system for separation logic with magic wand

Satisfiability modulo abstraction for separation logic with linked lists

Contact Info

Product

Resources

About