Program logic without binding is decidable

Authors:
V. R. Pratt
Affiliations:
M.I.T. sabbat. Stanford
Venue:
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1981

Citing 5
Cited 2

Off-line and on-line algorithms for deducing equalities

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On specifying verifiers

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Propositional modal logic of programs

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A program verifier

A program verifier
Computation: finite and infinite machines

Computation: finite and infinite machines

A temporal fixpoint calculus

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Five paradigm shifts in programming language design and their realization in Viron, a dataflow programming environment

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

When the "binding mechanisms" of assignment, quantification, and procedure definition are removed from a conventional first order total correctness logic of programs, the remaining logical system is decidable in time approximately one exponential in the length of the input. This system is maximal in the sense that the presence of any one of the three binding mechanisms would make it undecidable. Such a decision procedure can play a central role in the construction of program verifiers based on decision methods.