The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
The temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
Self-citationA Calculus of Communicating Systems
(1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10235-3 · Cited by 4,633
Design and synthesis of synchronization skeletons using branching time temporal logic
Clarke, E. M., & Emerson, E. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0025774 · Cited by 2,219
守屋, 悦. (1980) · 情報処理 · Cited by 1,791
Proving the Correctness of Multiprocess Programs
Lamport, L. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.229904 · Cited by 1,138
On the temporal analysis of fairness
Gabbay, D. M., Pnueli, A., Shelah, S., & Stavi, J. (1980) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/567446.567462 · Cited by 732
Self-citationProving 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
Specifying Concurrent Program Modules
Lamport, L. (1983) · ACM Transactions on Programming Languages and Systems · doi:10.1145/69624.357207 · Cited by 524
Cited by
EMERSON, E. A. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50021-4 · Cited by 2,585
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-citationHarel, D. (1988) · Communications of the ACM · doi:10.1145/42411.42414 · Cited by 1,269
Automata for modeling real-time systems
Alur, R., & Dill, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0032042 · Cited by 904
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
The family of concurrent logic programming languages
Shapiro, E. (1989) · ACM Computing Surveys · doi:10.1145/72551.72555 · Cited by 440
Stephens, R. (1997) · Acta Informatica · doi:10.1007/s002360050095 · Cited by 322
Models for hybrid systems: Automata, topologies, controllability, observability
Nerode, A., & Kohn, W. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57318-6_35 · Cited by 301
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
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
Metadata
- Authors
- Pnueli, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1986
- Pages
- 510-584
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1569068921
- Cited by
- 450
- References
- 13
- FWCI
- 13.82
- 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.