Properties of Programs and the First-Order Predicate Calculus-Reference-Cited by-同舟云学术

Properties of Programs and the First-Order Predicate Calculus

Published:1969-04 Issue:2 Volume:16 Page:244-255
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Manna Zohar¹

Affiliation:

1. Computer Science Department, Stanford University, Stanford, California and Carnegie-Mellon University, Computer Science Department, Pittsburgh, Pennsylvania

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/321510.321516

Reference17 articles.

1. Turing-machines and the Entscheidungsproblem

2. CHURCH A. Introduclion 1o Malhcmalical Logic Vol. 1. Princeton U. Press Princeton N.J. 1956. CHURCH A. Introduclion 1o Malhcmalical Logic Vol. 1. Princeton U. Press Princeton N.J. 1956.

3. A Computing Procedure for Quantification Theory

Cited by 59 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Three Early Formal Approaches to the Verification of Concurrent Programs;Minds and Machines;2023-01-23

2. Zohar Manna (1939–2018);Formal Aspects of Computing;2019-12

3. Proving semantic properties as first-order satisfiability;Artificial Intelligence;2019-12

4. Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories;Journal of Automated Reasoning;2017-07-12

5. A historical perspective on runtime assertion checking in software development;ACM SIGSOFT Software Engineering Notes;2006-05