Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
VST-A analyzes control flow graphs, decomposes every C function into control flow paths between assertions, and reduces program verification problems into ...
Aug 31, 2019 · We present VST-A, an annotation verifier that uses the rich assertion language of VST, leverages the formal soundness proof of VST, but allows ...
In this paper, we demonstrate how to combine the benefits of interactive tools and annotation verifiers. We present VST-A, a foundationally sound verification ...
VST-A analyzes control flow graphs, decomposes every C function into control flow paths between assertions, and reduces program verification problems into ...
VST-A is presented, an annotation verifier that uses the rich assertion language of VST, leverages the formal soundness proof of VST, but allows users to ...
Annotation verifiers: by writing annotations in the source code. ✓ More automation. ✓ Compared with formal proof scripts, annotating.
The artifact is self-contained, incorporating a modified CompCert compiler capable of parsing annotated programs and a patched VST-2.5. The development of VST-A ...
We present VST-A, an annotation verifier that uses the rich assertion language of VST, leverages the formal soundness proof of VST, but allows users to describe ...
VST-A is demonstrated, a foundationally sound annotation verifier for sequential C programs that can write high order assertion in C programs' comments and ...
People also ask
VST-A analyzes control flow graphs and reduces the program verification problem to a set of straightline Hoare triples, which correspond to the con- trol flow ...