Invariants for the construction of a handshake register
Information Processing Letters
On a method of multiprogramming
On a method of multiprogramming
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
FASE '99 Proceedings of the Second Internationsl Conference on Fundamental Approaches to Software Engineering
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
A Comparison of PVS and Isabelle/HOL
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Lock-free dynamic hash tables with open addressing
Distributed Computing - Special issue: PODC 02
Constructing and Reasoning About Security Protocols Using Invariants
Electronic Notes in Theoretical Computer Science (ENTCS)
Calculating and composing progress properties in terms of the leads-to relation
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Assertion-based proof checking of chang-roberts leader election in PVS
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Compositional verification of a communication protocol for a remotely operated aircraft
Science of Computer Programming
| Hi-index | 0.00 |
Verifications of parallel programs are frequently based on automated state-space exploration techniques known as model checking. To avoid state-space explosion problems, theorem proving techniques can be used, for example by manually annotating programs with suitable assertions and using these assertions to prove their correctness (e.g. using the Owicki/Gries theory). We propose a method to support assertion-based methods with theorem provers like PVS. Emphasis is on the typical incremental character of assertion-based methods, and on automated strategies for proving correctness of the proof outlines.