Code-carrying theories

Authors:
Bart Jacobs;Sjaak Smetsers;Ronny Wichers Schreur
Affiliations:
Radboud University Nijmegen, Institute for Computing and Information Sciences, P.O. Box 9010, 6500 GL, Nijmegen, The Netherlands;Radboud University Nijmegen, Institute for Computing and Information Sciences, P.O. Box 9010, 6500 GL, Nijmegen, The Netherlands;Radboud University Nijmegen, Institute for Computing and Information Sciences, P.O. Box 9010, 6500 GL, Nijmegen, The Netherlands
Venue:
Formal Aspects of Computing
Year:
2007

Citing 0
Cited 4

Machine checked formal proof of a scheduling protocol for smartcard personalization

FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Verification of the completeness of unification algorithms à la Robinson

WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Deadlock and starvation free reentrant readers-writers: A case study combining model checking with theorem proving

Science of Computer Programming
Generating verifiable java code from verified PVS specifications

NFM'12 Proceedings of the 4th international conference on NASA Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is both a position paper on a particular approach in program correctness, and also a contribution to this area. The approach entails the generation of programs (code) from the executable content of logical theories. This capability already exists within the main theorem provers like Coq, Isabelle and ACL2 and PVS. Here we will focus on issues portraying the use of this methodology, rather than the underlying theory. We illustrate the power of the approach within PVS via two case studies (on unification and compression) that lead to actual running code. We also demonstrate its flexibility by extending the program generation capabilities. This paper fits in a line of ongoing integration of programming and proving.