VST-Floyd: A Separation Logic Tool to Verify Correctness of C Programs

Cao, Qinxiang; Beringer, Lennart; Gruetter, Samuel; Dodds, Josiah; Appel, Andrew W.

doi:10.1007/s10817-018-9457-5

Cited by 78 publications

(52 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Embedding ITrees in VST VST is a framework for proving separation logic specifications of C programs, based on the C semantics of the CompCert compiler. Its separation logic comes with a proof automation system, Floyd, that supplies tactics for symbolically executing a program while maintaining its pre-and postcondition [Cao et al 2018]. To support reasoning about external behavior in general-and the swap server's invocations of OS/network primitives in particular-we extend VST's logic with two abstract predicates [Penninckx et al 2015]; these are separation logic predicates that behave like resources but do not have a footprint in concrete memory.…”

Section: Verificationmentioning

confidence: 99%

From C to interaction trees: specifying, verifying, and testing a networked server

Koh

et al. 2019

Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs

Self Cite

View full text Add to dashboard Cite

We present the first formal verification of a networked server implemented in C. Interaction trees, a general structure for representing reactive computations, are used to tie together disparate verification and testing tools (Coq, VST, and Quick-Chick) and to axiomatize the behavior of the operating system on which the server runs (CertiKOS). The main theorem connects a specification of acceptable server behaviors, written in a straightforward "one client at a time" style, with the CompCert semantics of the C program. The variability introduced by low-level buffering of messages and interleaving of multiple TCP connections is captured using network refinement, a variant of observational refinement.

show abstract

Section: Verificationmentioning

confidence: 99%

From C to interaction trees: specifying, verifying, and testing a networked server

Koh

et al. 2019

Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs

Self Cite

View full text Add to dashboard Cite

show abstract

“…Kästner et al (2017) described many extensions and enhancements to the basic compilation toolchain of CompCert, e.g., translation validation of the process of linking machine code to produce object files and executable files. Cao et al (2018) presented a CompCertbased C program verification environment called VST-Floyd in Coq based on separation logic, simplifying the process of specifying and verifying properties that hold down to machine code.…”

Section: Certified Compilersmentioning

confidence: 99%

“…Various successful deep embeddings of Floyd-Hoare style reasoning into Coq have been demonstrated viable for the sake of reasoning about low-level programs using different versions of Separation Logic (Chlipala et al, 2009;Chlipala, 2011;Chlipala, 2013b;Chen et al, 2015;Cao et al, 2018). All those efforts came supplied with tailored libraries of domain-specific tactics, with those tactics automatically applying Separation Logic's Frame rule and thus progressively reducing the size of the verification goal.…”

Section: Proof Organization and Scalabilitymentioning

confidence: 99%

QED at Large: A Survey of Engineering of Formally Verified Software

Ringer

Palmskog

Sergey

et al. 2019

FNT in Programming Languages

View full text Add to dashboard Cite

Development of formal proofs of correctness of programs can increase actual and perceived reliability and facilitate better understanding of program specifications and their underlying assumptions. Tools supporting such development have been available for over 40 years, but have only recently seen wide practical use. Projects based on construction of machine-checked formal proofs are now reaching an unprecedented scale, comparable to large software projects, which leads to new challenges in proof development and maintenance. Despite its increasing importance, the field of proof engineering is seldom considered in its own right; related theories, techniques, and tools span many fields and venues. This survey of the literature presents a holistic understanding of proof engineering for program correctness, covering impact in practice, foundations, proof automation, proof organization, and practical proof development.

show abstract

“…C Semantics. There has been a considerable body of work on formal semantics for the C language, including several large projects that aimed to formalize substantial subsets of C [17,20,30,37,41,44], and projects that focused on specific aspects like its memory model [10,13,27,28,31,38,40,41], weak memory concurrency [4,36,43], non-local control flow [35], verified compilation [37,48], etc.…”

Section: Related Workmentioning

confidence: 99%

Semi-automated Reasoning About Non-determinism in C Expressions

Frumin

Gondelman

Krebbers

2019

Programming Languages and Systems

View full text Add to dashboard Cite

Research into C verification often ignores that the C standard leaves the evaluation order of expressions unspecified, and assigns undefined behavior to write-write or read-write conflicts in subexpressionsso called "sequence point violations". These aspects should be accounted for in verification because C compilers exploit them.We present a verification condition generator (vcgen) that enables one to semi-automatically prove the absence of undefined behavior in a given C program for any evaluation order. The key novelty of our approach is a symbolic execution algorithm that computes a frame at the same time as a postcondition. The frame is used to automatically determine how resources should be distributed among subexpressions.We prove correctness of our vcgen with respect to a new monadic definitional semantics of a subset of C. This semantics is modular and gives a concise account of non-determinism in C.We have implemented our vcgen as a tactic in the Coq interactive theorem prover, and have proved correctness of it using a separation logic for the new monadic definitional semantics of a subset of C.

show abstract

VST-Floyd: A Separation Logic Tool to Verify Correctness of C Programs

Cited by 78 publications

References 28 publications

From C to interaction trees: specifying, verifying, and testing a networked server

From C to interaction trees: specifying, verifying, and testing a networked server

QED at Large: A Survey of Engineering of Formally Verified Software

Semi-automated Reasoning About Non-determinism in C Expressions

Contact Info

Product

Resources

About