Separation Logic Adapted for Proofs by Rewriting

Myreen, Magnus O.

doi:10.1007/978-3-642-14052-5_34

Cited by 6 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…ACL2 [17] is an interactive theorem prover for first-order logic. Prior work on program verification with ACL2 has highlighted its library support for code proofs based on executable models [9] and its support for rewriting-based proofs of separation properties in the context of program verification [22] through the use of proof tactics (i.e. rewrite rules) which act upon a quantifier-free representation of separation predicates.…”

Section: Acl2mentioning

confidence: 99%

“…In ACL2, this is naturally the task of the rewriter, which efficiently completes proofs even when they involve large terms of the kind that show up in code proofs. Accordingly, we look for a method to phrase the separation properties in a way that is palatable to the rewriter, after the fashion of Myreen and Kaufmann's work on code proofs [22] demonstrating a logical workaround for the difficulties of separation logic proofs in the presence of existential quantifiers. The recursive predicate separate served to take the place of the conventional Fig.…”

Section: Rewritingmentioning

confidence: 99%

See 1 more Smart Citation

Separation Logic-Based Verification Atop a Binary-Compatible Filesystem Model

Mehta

Cook

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Filesystems have held the interest of the formal verification community for a while, with several high-performance filesystems constructed with accompanying proofs of correctness. However, the question of verifying an existing filesystem and incorporating filesystem-specific guarantees remains unexplored, leaving those application developers underserved who need to work with a specific filesystem known to be fit for their purpose. In this work, we present an implementation of a verified filesystem which matches the specification of an existing filesystem, and with our new model AbsFAT tie it to the reasoning framework of separation logic in order to verify properties of programs which use the filesystem. This work is intended to match the target filesystem, FAT32, at a binary level and return the same data and error codes returned by mature FAT32 implementations, considered canonical. We provide a logical framework for reasoning about program behavior when filesystem calls are involved in terms of separation logic, and adapt it to simplify and automate the proof process in ACL2. By providing this framework, we encourage and facilitate greater adoption of software verification by application developers.

show abstract

Section: Acl2mentioning

confidence: 99%

Section: Rewritingmentioning

confidence: 99%

Separation Logic-Based Verification Atop a Binary-Compatible Filesystem Model

Mehta

Cook

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…There have been numerous mechanisations of separation logic frameworks, but most of them focus on the reasoning of programs (e.g., [36]), whereas this paper focuses on the reasoning of assertions, so they are not directly comparable to this work. Moreover, most mechanisations of separation logic framework, e.g., Smallfoot [4], Holfoot [37], Myreen's rewriting tactics for SL [31], Ynot [15], Bedrock [14], and Charge! [3], only use a small subset of the assertion language, typically variants of symbolic heaps.…”

Section: Related Workmentioning

confidence: 99%

Proof Tactics for Assertions in Separation Logic

Hóu

Sanán

Tiu

et al. 2017

Interactive Theorem Proving

View full text Add to dashboard Cite

This paper presents tactics for reasoning about the assertions of separation logic. We formalise our proof methods in Isabelle/HOL based on Klein et al.'s separation algebra library. Our methods can also be used in other separation logic frameworks that are instances of the separation algebra of Calcagno et al. The first method, separata, is based on an embedding of a labelled sequent calculus for abstract separation logic (ASL) by Hóu et al. The second method, starforce, is a refinement of separata with specialised proof search strategies to deal with separating conjunction and magic wand. We also extend our tactics to handle pointers in the heap model, giving a third method sepointer. Our tactics can automatically prove many complex formulae. Finally, we give two case studies on the application of our tactics.

show abstract

“…In [26], a formalisation of Separation Logic is presented which removes the use of explicit existential quantification and thus is applicable to many theorem provers which use rewriting engines. This is achieved by combing function and shape into a list formalisation, and introducing predicates to assert the distinctness of the elements.…”

Section: Quantifier Free Separation Logicmentioning

confidence: 99%

Proof automation for functional correctness in separation logic

Maclean

Ireland

Grov

2014

J Logic Computation

View full text Add to dashboard Cite

We describe an approach to automatically prove the functional correctness of pointer programs that involve iteration and recursion. Building upon separation logic, our approach has been implemented as a tightly integrated tool chain incorporating a novel combination of proof planning and invariant generation. Starting from shape analysis, performed by the Smallfoot static analyser, we have developed a proof strategy that combines shape and functional aspects of the verification task. By focusing on both iterative and recursive code, we have had to address two related invariant generation tasks, i.e. loop and frame invariants. We deal with both tasks uniformly using an automatic technique called term synthesis, in combination with the IsaPlanner/Isabelle theorem prover. In addition, where verification fails, we attempt to overcome failure by automatically generating missing preconditions. We present in detail our experimental results. Our approach has been evaluated on a range of examples, drawn in part from a functional extension to the Smallfoot corpus.

show abstract

Separation Logic Adapted for Proofs by Rewriting

Cited by 6 publications

References 10 publications

Separation Logic-Based Verification Atop a Binary-Compatible Filesystem Model

Separation Logic-Based Verification Atop a Binary-Compatible Filesystem Model

Proof Tactics for Assertions in Separation Logic

Proof automation for functional correctness in separation logic

Contact Info

Product

Resources

About