Transforming Programs into Recursive Functions

Authors:
Magnus O. Myreen;Michael J. C. Gordon
Affiliations:
Computer Laboratory, University of Cambridge, 15 JJ Thomson Avenue, Cambridge, UK;Computer Laboratory, University of Cambridge, 15 JJ Thomson Avenue, Cambridge, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 5
Cited 1

An axiomatic basis for computer programming

Communications of the ACM
Partial Functions in ACL2

Journal of Automated Reasoning
Verification of non-functional programs using interpretations in type theory

Journal of Functional Programming
Variables as Resource in Hoare Logics

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Verification condition generation via theorem proving

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

A simple, verified validator for software pipelining

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new proof-assistant based approach to program verification: programs are translated, via fully-automatic deduction, into tail-recursive function defined in the logic of a theorem prover. This approach improves on well-established methods based on Hoare logic and verification condition generation (VCG) by removing the need to annotate programs with assertions, making the proof natural to the theorem prover and being easier to implement than a trusted VCG. Our tool has been implemented in the HOL4 theorem prover.