The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
The temporal logic of programs
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Axiomatic Basis for Computer Programming
Hoare, T. (1968) · Cited by 4,335
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
Assigning meanings to programs
Floyd, R. W. (1967) · Proceedings of Symposia in Applied Mathematics · doi:10.1090/psapm/019/0235771 · Cited by 1,408
Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
Kripke, S. A. (1963) · Mathematical Logic Quarterly · doi:10.1002/malq.19630090502 · Cited by 1,287
Formal verification of parallel programs
Keller, R. M. (1976) · Communications of the ACM · doi:10.1145/360248.360251 · Cited by 797
Mathematical Theory of Computation
McCarthy, J. (1991) · doi:10.21236/ada239419 · Cited by 635
Rescher, N., & Urquhart, A. (1971) · LEP Library of Exact Philosophy · doi:10.1007/978-3-7091-7664-1 · Cited by 394
HABER, R. N. (1974) · Historical and Philosophical Roots of Perception · doi:10.1016/b978-0-12-161901-5.50023-6 · Cited by 269
Axiomatic approach to total correctness of programs
Manna, Z., & Pnueli, A. (1974) · Acta Informatica · doi:10.1007/bf00288637 · Cited by 99
Self-citationA proof method for cyclic programs
Francez, N., & Pnueli, A. (1978) · Acta Informatica · doi:10.1007/bf00289074 · Cited by 64
Self-citationAn Introduction to Modal Logic
Bastable, P. K. (1972) · Philosophical Studies · doi:10.5840/philstudies19722119 · Cited by 37
Proving that computer programs terminate cleanly.
Sites, R. L. (1974) · Cited by 31
Cited by
Statecharts: a visual formalism for complex systems
Harel, D. (1987) · Science of Computer Programming · doi:10.1016/0167-6423(87)90035-9 · Cited by 6,751
On observing nondeterminism and concurrency
Hennessy, M., & Milner, R. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_79 · Cited by 4,492
Holzmann, G. J. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.588521 · Cited by 3,803
EMERSON, E. A. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50021-4 · Cited by 2,585
Lamport, L. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/177492.177726 · Cited by 1,843
Metadata
- Authors
- Pnueli, A.
- Venue
- 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
- Publisher
- IEEE
- Published
- 1977-09
- Pages
- 46-57
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2023808162
- Cited by
- 5,689
- References
- 12
- FWCI
- 6.43
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.