
Cameleer: a Deductive Verification Tool for OCaml
OCaml is particularly wellfitted for formal verification. On one hand, ...
read it

Debugging Program Verification Proof Scripts (Tool Paper)
Interactive program verification is characterized by iterations of unfin...
read it

Reductions for Safety Proofs (Extended Version)
Program reductions are used widely to simplify reasoning about the corre...
read it

A Versatile, Sound Tool for Simplifying Definitions
We present a tool, simplifydefun, that transforms the definition of a g...
read it

Concise Outlines for a Complex Logic: A Proof Outline Checker for TaDA (Full Paper)
Modern separation logics allow one to prove rich properties of intricate...
read it

QED at Large: A Survey of Engineering of Formally Verified Software
Development of formal proofs of correctness of programs can increase act...
read it

Audio Captcha Recognition Using RastaPLP Features by SVM
Nowadays, CAPTCHAs are computer generated tests that human can pass but ...
read it
VSTA: A Foundationally Sound Annotation Verifier
An interactive program verification tool usually requires users to write formal proofs in a theorem prover like Coq and Isabelle, which is an obstacle for most software engineers. In comparison, annotation verifiers can use assertions in source files as hints for program verification but they themselves do not have a formal soundness proof. In this paper, we demonstrate VSTA, a foundationally sound annotation verifier for sequential C programs. On one hand, users can write high order assertion in C programs' comments. On the other hand, separation logic proofs will be generated in the backend whose proof rules are formally proved sound w.r.t. CompCert's Clight semantics. Residue proof goals in Coq may be generated if some assertion entailments cannot be verified automatically.
READ FULL TEXT
Comments
There are no comments yet.