Second-order mathematical theory of computation

Authors:
Zohar Manna
Affiliations:
Computer Science Department, Stanford University
Venue:
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Year:
1970

Citing 2
Cited 6

Properties of Programs and the First-Order Predicate Calculus

Journal of the ACM (JACM)
Formalization of Properties of Functional Programs

Journal of the ACM (JACM)

An Assessment of Techniques for Proving Program Correctness

ACM Computing Surveys (CSUR)
Nondeterminism in logics of programs

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The competence/performance dichotomy in programming preliminary report

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The temporal logic of branching time

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An approach to compiler correctness

Proceedings of the international conference on Reliable software
The concept of nondeterminism: its development and implications for teaching

ACM SIGCSE Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we show that it is possible to formalize all properties regularly observed in (deterministic and non-deterministic) algorithms in second-order predicate calculus. Moreover, we show that for any given algorithm it suffices to know how to formalize its 'partial correctness' by a second-order formula in order to formalize all other properties by second-order formulas. This result is of special interest since 'partial correctness' has already been formalized in second-order predicate calculus for many classes of algorithms.