Properties of Programs and the First-Order Predicate Calculus

Authors:
Zohar Manna
Affiliations:
Computer Science Department, Stanford University, Stanford, California and Carnegie-Mellon University, Computer Science Department, Pittsburgh, Pennsylvania
Venue:
Journal of the ACM (JACM)
Year:
1969

Citing 6
Cited 28

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Semi-Decision Procedure for the Functional Calculus

Journal of the ACM (JACM)
On Ianov's Program Schemata

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Formalization of properties of recursively defined functions

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Termination of algorithms

Termination of algorithms

Tentative steps toward a development method for interfering programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Beyond structured programming

Proceedings of the 18th international conference on Software engineering
Formalization of Properties of Functional Programs

Journal of the ACM (JACM)
Resolution Strategies as Decision Procedures

Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
The Vienna Definition Language

ACM Computing Surveys (CSUR)
An Assessment of Techniques for Proving Program Correctness

ACM Computing Surveys (CSUR)
A Sampler of Formal Definitions

ACM Computing Surveys (CSUR)
A language extension for graph processing and its formal semantics

Communications of the ACM
On the decision problems of program schemas with commutative and invertible functions

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Representing Object Code

CL '00 Proceedings of the First International Conference on Computational Logic
Subrecursive program schemata I & II(I. Undecidable equivalence problems, II. Decidable equivalence problems)

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Second-order mathematical theory of computation

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Translating recursion equations into flow charts

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Implementation and applications of Scott's logic for computable functions

Proceedings of ACM conference on Proving assertions about programs
New directions in teaching the fundamentals of computer science — discrete structures and computational analysis

SIGCSE '73 Proceedings of the third SIGCSE technical symposium on Computer science education
Data structure models for programming languages

ACM SIGPLAN Notices
A historical perspective on runtime assertion checking in software development

ACM SIGSOFT Software Engineering Notes
Bibliography

Record of the Project MAC conference on concurrent systems and parallel computation
Temporal reasoning and termination of programs

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
The application of formal logic to programs and programming

IBM Systems Journal
Program schemata as automata. I

Journal of Computer and System Sciences
Program schemata and the first-order decision problem

Journal of Computer and System Sciences
Pair grammars, graph languages and string-to-graph translations

Journal of Computer and System Sciences
Translating recursion equations into flow charts

Journal of Computer and System Sciences
Subrecursive program schemata I & II: I. Undecidable equivalence problems; II. Decidable equivalence problems

Journal of Computer and System Sciences
Out of order quantifier elimination for Standard Quantified Linear Programs

Journal of Symbolic Computation

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper is concerned with the relationship of the termination problem for programs and abstract programs to the validity of certain formulas in the first-order predicate calculus. By exploiting this relationship, subclasses of abstract programs for which the termination problem is decidable can be isolated. Moreover, known proof procedures for the first-order predicate calculus (e.g. resolution) can be applied to prove the termination of both programs and abstract programs. The correctness and equivalence problems of abstract programs are shown to be reducible to the termination problem.