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-citation
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
The synchronous data flow programming language LUSTRE
Halbwachs, N., Caspi, P., Raymond, P., & Pilaud, D. (1991) · Proceedings of the IEEE · doi:10.1109/5.97300 · Cited by 1,590
On the synthesis of a reactive module
Pnueli, A., & Rosner, R. (1989) · Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89 · doi:10.1145/75277.75293 · Cited by 1,432
Self-citationAlternating-time temporal logic
Alur, R., Henzinger, T. A., & Kupferman, O. (2002) · Journal of the ACM · doi:10.1145/585265.585270 · Cited by 1,394
Specifying real-time properties with metric temporal logic
Koymans, R. (1990) · Real-Time Systems · doi:10.1007/bf01995674 · Cited by 1,180
The complexity of propositional linear temporal logics
Sistla, A. P., & Clarke, E. M. (1985) · Journal of the ACM · doi:10.1145/3828.3837 · Cited by 1,095
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Emerson, E. A., & Halpern, J. Y. (1986) · Journal of the ACM · doi:10.1145/4904.4999 · Cited by 1,009
Biere, A., Cimatti, A., Clarke, E. M., Strichman, O., & Zhu, Y. (2003) · Advances in Computers · doi:10.1016/s0065-2458(03)58003-2 · Cited by 952
Model-checking for real-time systems
Alur, R., Courcoubetis, C., & Dill, D. (2002) · [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.1990.113766 · Cited by 897
A brief account of runtime verification
Leucker, M., & Schallhart, C. (2009) · The Journal of Logic and Algebraic Programming · doi:10.1016/j.jlap.2008.08.004 · Cited by 863
Processing flows of information: From data stream to complex event processing
Cugola, G., & Margara, A. (2012) · ACM Computing Surveys · doi:10.1145/2187671.2187677 · Cited by 833
Discrete abstractions of hybrid systems
Alur, R., Henzinger, T. A., Lafferriere, G., & Pappas, G. J. (2000) · Proceedings of the IEEE · doi:10.1109/5.871304 · Cited by 801
Robust Satisfaction of Temporal Logic over Real-Valued Signals
Donzé, A., & Maler, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15297-9_9 · Cited by 717
Simple On-the-fly Automatic Verification of Linear Temporal Logic
Gerth, R., Peled, D., Vardi, M. Y., & Wolper, P. (1996) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-34892-6_1 · Cited by 705
The temporal semantics of concurrent programs
Pnueli, A. (1981) · Theoretical Computer Science · doi:10.1016/0304-3975(81)90110-9 · Cited by 699
Self-citationSafe Reinforcement Learning via Shielding
Alshiekh, M., Bloem, R., Ehlers, R., Könighofer, B., Niekum, S., & Topcu, U. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11797 · Cited by 37
An automata-theoretic approach to linear temporal logic
Vardi, M. Y. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60915-6_6 · Cited by 660
Modeling concurrency with partial orders
Pratt, V. (1986) · International Journal of Parallel Programming · doi:10.1007/bf01379149 · Cited by 643
Robustness of temporal logic specifications for continuous-time signals
Fainekos, G. E., & Pappas, G. J. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.06.021 · Cited by 598
Proving Liveness Properties of Concurrent Programs
Owicki, S., & Lamport, L. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357178 · Cited by 576
Logics and models of real time: A survey
Alur, R., & Henzinger, T. A. (1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0031988 · Cited by 548
Specifying Concurrent Program Modules
Lamport, L. (1983) · ACM Transactions on Programming Languages and Systems · doi:10.1145/69624.357207 · Cited by 524
Logical Dynamics of Information and Interaction
van Benthem, J. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511974533 · Cited by 505
Pnueli, A. (1986) · Lecture Notes in Computer Science · doi:10.1007/bfb0027047 · Cited by 450
Self-citationStatistical Model Checking: An Overview
Legay, A., Delahaye, B., & Bensalem, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-16612-9_11 · Cited by 421
Jhala, R., & Majumdar, R. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592438 · Cited by 418
Frama-C: A software analysis perspective
Kirchner, F., Kosmatov, N., Prevosto, V., Signoles, J., & Yakobowski, B. (2015) · Formal Aspects of Computing · doi:10.1007/s00165-014-0326-7 · Cited by 416
Perracotta: mining temporal API rules from imperfect traces
Yang, J., Evans, D., Bhardwaj, D., Bhat, T., & Das, M. (2006) · Proceedings of the 28th international conference on Software engineering · doi:10.1145/1134285.1134325 · Cited by 406
Differential Dynamic Logic for Hybrid Systems
Platzer, A. (2008) · Journal of Automated Reasoning · doi:10.1007/s10817-008-9103-8 · Cited by 390
MOCHA: Modularity in model checking
Alur, R., Henzinger, T. A., Mang, F. Y. C., Qadeer, S., Rajamani, S. K., & Tasiran, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0028774 · Cited by 382
Cuoq, P., Kirchner, F., Kosmatov, N., Prevosto, V., Signoles, J., & Yakobowski, B. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33826-7_16 · Cited by 376
Using formal specifications to support testing
Hierons, R. M., Bogdanov, K., Bowen, J. P., Cleaveland, R., Derrick, J., Dick, J., Gheorghe, M., Harman, M., Kapoor, K., Krause, P., et al. (2009) · ACM Computing Surveys · doi:10.1145/1459352.1459354 · Cited by 356
Outcome-Oriented Predictive Process Monitoring: Review and Benchmark
Teinemaa, I., Dumas, M., Rosa, M. L., & Maggi, F. M. (2019) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3301300 · Cited by 351
Harel, D. (1984) · Handbook of Philosophical Logic · doi:10.1007/978-94-009-6259-0_10 · Cited by 327
A brief history of process algebra
Baeten, J. C. M. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.07.036 · Cited by 323
On the Decision Problem for Two-Variable First-Order Logic
Grädel, E., Kolaitis, P. G., & Vardi, M. Y. (1997) · Bulletin of Symbolic Logic · doi:10.2307/421196 · Cited by 321
Automated Verification Techniques for Probabilistic Systems
Forejt, V., Kwiatkowska, M., Norman, G., & Parker, D. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-21455-4_3 · Cited by 319
Specification-Based Monitoring of Cyber-Physical Systems: A Survey on Theory, Tools and Applications
Bartocci, E., Deshmukh, J., Donzé, A., Fainekos, G., Maler, O., Ničković, D., & Sankaranarayanan, S. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-75632-5_5 · Cited by 316
Knowledge-Intensive Processes: Characteristics, Requirements and Analysis of Contemporary Approaches
Di Ciccio, C., Marrella, A., & Russo, A. (2015) · Journal on Data Semantics · doi:10.1007/s13740-014-0038-4 · Cited by 312
Gerevini, A. E., Haslum, P., Long, D., Saetti, A., & Dimopoulos, Y. (2009) · Artificial Intelligence · doi:10.1016/j.artint.2008.10.012 · Cited by 295
Formal verification in hardware design: a survey
Kern, C., & Greenstreet, M. R. (1999) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/307988.307989 · Cited by 284
Temporal Logics for Hyperproperties
Clarkson, M. R., Finkbeiner, B., Koleini, M., Micinski, K. K., Rabe, M. N., & Sánchez, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-54792-8_15 · Cited by 270
Introduction to Process Algebra
Fokkink, W. (2000) · Texts in Theoretical Computer Science. An EATCS Series · doi:10.1007/978-3-662-04293-9 · Cited by 254
Logic-based technologies for multi-agent systems: a systematic literature review
Calegari, R., Ciatto, G., Mascardi, V., & Omicini, A. (2021) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-020-09478-3 · Cited by 117
History of Interactive Theorem Proving
Harrison, J., Urban, J., & Wiedijk, F. (2014) · Handbook of the History of Logic · doi:10.1016/b978-0-444-51624-4.50004-6 · Cited by 107
Encoding formulas as deep networks: Reinforcement learning for zero-shot execution of LTL formulas
Kuo, Y.-L., Katz, B., & Barbu, A. (2020) · 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros45743.2020.9341325 · Cited by 21
LTL2Action: Generalizing LTL Instructions for Multi-Task RL
Vaezipoor, P., Li, A., Icarte, R. T., & McIlraith, S. (2021) · arXiv · doi:10.48550/arxiv.2102.06858 · Cited by 19
Formal Methods for Autonomous Systems
Wongpiromsarn, T., Ghasemi, M., Cubuktepe, M., Bakirtzis, G., Carr, S., Karabag, M. O., Neary, C., Gohari, P., & Topcu, U. (2023) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000029 · Cited by 17
General agents contain world models
Richens, J., Abel, D., Bellot, A., & Everitt, T. (2025) · arXiv · doi:10.48550/arxiv.2506.01622 · Cited by 30
Beyond Fixed Tasks: Unsupervised Environment Design for Task-Level Pairs
Furelos-Blanco, D., Pert, C., Kelbel, F., Spies, A. F., Russo, A., & Dennis, M. (2025) · arXiv
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.