Proving Theorems about LISP Functions
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
An axiomatic basis for computer programming
Communications of the ACM
A simplifier based on efficient decision algorithms
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
A Discipline of Programming
Studies in Automatic Programming Logic
Studies in Automatic Programming Logic
Implementation and applications of Scott's logic for computable functions
Proceedings of ACM conference on Proving assertions about programs
An Algorithm for Checking PL/CV Arithmetic Inferences
An Algorithm for Checking PL/CV Arithmetic Inferences
The Assertion Table System for the PL/CV2 Program Verifier
The Assertion Table System for the PL/CV2 Program Verifier
A users manual for FOL.
Complexity of finitely presented algebras.
Complexity of finitely presented algebras.
Decidability of the purely existential fragment of the theory of term algebras
Journal of the ACM (JACM)
ACM SIGPLAN Notices
| Hi-index | 0.00 |
PL/CV is a new formal system which mixes commands and assertions. It includes axioms and rules for a theory of programming over integers and characters. Since arguments in the theory can be checked by the PL/CV Proof Checker, the system offers an approach to mechanical program verification. The Proof Checker is efficient enough for classroom use. Early experience with PL/CV indicates that it nicely supports formal verification of elementary arguments. Continued work should enable the formalization of non-elementary reasoning as well.