Formal verification of concurrent programs in Lp and in Coq: A comparative analysis

Author(s):  
Boutheina Chetali ◽  
Barbara Heyd
2010 ◽  
Vol 4 (1) ◽  
pp. 65-77
Author(s):  
Ming Fu ◽  
Yu Zhang ◽  
Yong Li

2020 ◽  
Vol 27 (3) ◽  
pp. 84-101
Author(s):  
Alfio Ricardo Martini

Hoare Logic has a long tradition in formal verification and has been continuously developed and used to verify a broad class of programs, including sequential, object-oriented and concurrent programs. The purpose of this work is to provide a detailed and accessible exposition of the several ways the user can conduct, explore and write proofs of correctness of sequential imperative programs with Hoare logic and the ISABELLE proof assistant. With the proof language Isar, it is possible to write structured, readable proofs that are suitable for human understanding and communication.


2007 ◽  
Vol 177 (4S) ◽  
pp. 398-398
Author(s):  
Luis H. Braga ◽  
Joao L. Pippi Salle ◽  
Sumit Dave ◽  
Sean Skeldon ◽  
Armando J. Lorenzo ◽  
...  
Keyword(s):  

2005 ◽  
Vol 173 (4S) ◽  
pp. 178-178
Author(s):  
Stephen O. Ikuerowo ◽  
Stefan A. Machtens ◽  
Markus A. Kuczyk ◽  
Udo Jonas ◽  
Juergen Serth

Sign in / Sign up

Export Citation Format

Share Document