Formalization of Properties of Functional Programs

Authors:
Zohar Manna;Amir Pnueli
Affiliations:
Stanford University, Computer Science Department, Stanford, California;Weizmann Institute of Science, Rehovoth, Israel and Stanford University, Computer Science Department, Stanford, California
Venue:
Journal of the ACM (JACM)
Year:
1970

Citing 2
Cited 27

Introduction to mathematical logic (3rd ed.)

Introduction to mathematical logic (3rd ed.)
Properties of Programs and the First-Order Predicate Calculus

Journal of the ACM (JACM)

Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems

Journal of the ACM (JACM)
Continuation-Based Program Transformation Strategies

Journal of the ACM (JACM)
An Assessment of Techniques for Proving Program Correctness

ACM Computing Surveys (CSUR)
A Comparative Analysis of Functional Correctness

ACM Computing Surveys (CSUR)
Subgoal induction

Communications of the ACM
Fixpoint approach to the theory of computation

Communications of the ACM
Computer programming as an art

Communications of the ACM
Inductive methods for proving properties of programs

Communications of the ACM
Toward automatic program synthesis

Communications of the ACM
Proving the correctness of coroutines without history variables

ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
A system for classifying program verification methods: Assigning meanings to program verification methods

ICSE '84 Proceedings of the 7th international conference on Software engineering
Computer architecture for correct programming

ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
An approach to program verification

DAC '76 Proceedings of the 13th Design Automation Conference
Second-order mathematical theory of computation

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
The current state of proving programs correct

ACM '72 Proceedings of the ACM annual conference - Volume 1
Inductive methods for proving properties of programs

Proceedings of ACM conference on Proving assertions about programs
Program correctness methods and language definition

Proceedings of ACM conference on Proving assertions about programs
Recursive definitions of partial functions and their computations

Proceedings of ACM conference on Proving assertions about programs
Computer programming as an art

ACM Turing award lectures
Bibliography

Record of the Project MAC conference on concurrent systems and parallel computation
Program analysis as constraint solving

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
A summary of progress toward proving program correctness

AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Automatic modular abstractions for linear constraints

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formalization of properties of nondeterministic recursive definitions

Information Sciences: an International Journal
On the completeness of the inductive assertion method

Journal of Computer and System Sciences
Mathematical theory of partial correctness

Journal of Computer and System Sciences
Proving assertions about parallel programs

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.08

Visualization

Abstract

The problems of convergence, correctness, and equivalence of computer programs can be formulated by means of the satisfiability or validity of certain first-order formulas. An algorithm is presented for constructing such formulas for functional programs, i.e. programs defined by LISP-like conditional recursive expressions.