Abstract

A unified approach to program verification is suggested, which applies to both sequential and parallel programs. The main proof method suggested is that of temporal reasoning in which the time dependence of events is the basic concept. Two formal systems are presented for providing a basis for temporal reasoning. One forms a formalization of the method of intermittent assertions, while the other is an adaptation of the tense logic system Kb, and is particularly suitable for reasoning about concurrent programs.

Keywords

Temporal logic of actionsTemporal logicComputer scienceLinear temporal logicInterval temporal logicComputation tree logicProgramming languageAdaptation (eye)Basis (linear algebra)Theoretical computer scienceArtificial intelligenceMathematics

Affiliated Institutions

Related Publications

A really temporal logic

A real-time temporal logic for the specification of reactive systems is introduced. The novel feature of the logic, TPTL, is the adoption of temporal operators as quantifiers ov...

1989 30th Annual Symposium on Foundations ... 162 citations

Publication Info

Year
1977
Type
article
Pages
46-57
Citations
5576
Access
Closed

External Links

Social Impact

Altmetric

Social media, news, blog, policy document mentions

Citation Metrics

5576
OpenAlex

Cite This

Amir Pnueli (1977). The temporal logic of programs. , 46-57. https://doi.org/10.1109/sfcs.1977.32

Identifiers

DOI
10.1109/sfcs.1977.32