Template-based construction of verified software

2005 ◽  
Vol 152 (1) ◽  
pp. 2 ◽  
Author(s):  
D. Hemer ◽  
P.A. Lindsay
Keyword(s):  
Verified Software

Verified software: theories, tools and experiments

2010 ◽  
Vol 12 (6) ◽  
pp. 405-408
Author(s):  
Daniel Kroening ◽  
Tiziana Margaria
Keyword(s):  
Verified Software

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

2019 ◽  
Author(s):  
Talia Ringer ◽  
Karl Palmskog ◽  
Ilya Sergey ◽  
Milos Gligoric ◽  
Zachary Tatlock
Keyword(s):  
Verified Software

scholarly journals Connecting Higher-Order Separation Logic to a First-Order Outside World

2020 ◽  
pp. 428-455 ◽  
Author(s):  
William Mansky ◽  
Wolf Honoré ◽  
Andrew W. Appel
Keyword(s):  
Program Verification ◽  
Higher Order ◽  
Separation Logic ◽  
C Programs ◽  
First Order ◽  
System Calls ◽  
Correctness Of Programs ◽  
Verified Software ◽  
Order State ◽  
Order Separation

AbstractSeparation logic is a useful tool for proving the correctness of programs that manipulate memory, especially when the model of memory includes higher-order state: Step-indexing, predicates in the heap, and higher-order ghost state have been used to reason about function pointers, data structure invariants, and complex concurrency patterns. On the other hand, the behavior of system features (e.g., operating systems) and the external world (e.g., communication between components) is usually specified using first-order formalisms. In principle, the soundness theorem of a separation logic is its interface with first-order theorems, but the soundness theorem may implicitly make assumptions about how other components are specified, limiting its use. In this paper, we show how to extend the higher-order separation logic of the Verified Software Toolchain to interface with a first-order verified operating system, in this case CertiKOS, that mediates its interaction with the outside world. The resulting system allows us to prove the correctness of C programs in separation logic based on the semantics of system calls implemented in CertiKOS. It also demonstrates that the combination of interaction trees + CompCert memories serves well as a lingua franca to interface and compose two quite different styles of program verification.

Sign in / Sign up

Export Citation Format

Share Document