Formalization of properties of recursively defined functions

Authors:
Zohar Manna;Amir Pnueli
Affiliations:
Computer Science Department, Stanford University, Stanford, California;Computer Science Department, Stanford University, Stanford, California
Venue:
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Year:
1969

Citing 2
Cited 4

Introduction to mathematical logic (3rd ed.)

Introduction to mathematical logic (3rd ed.)
Termination of algorithms

Termination of algorithms

Properties of Programs and the First-Order Predicate Calculus

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

ACM Computing Surveys (CSUR)
Another recursion induction principle

Communications of the ACM
The application of formal logic to programs and programming

IBM Systems Journal

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper is concerned with the relationship between the convergence, correctness and equivalence of recursively defined functions and the satisfiability (or unsatisfiability) of certain first-order formulas.