The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
An automata-theoretic approach to linear temporal logic
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
(1979) · Cited by 43,841
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
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
Introduction to automata theory, languages, and computation
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824
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
The Temporal Logic of Reactive and Concurrent Systems
Manna, Z., & Pnueli, A. (1992) · Springer eBooks · doi:10.1007/978-1-4612-0931-7 · Cited by 2,958
Finite Automata and Their Decision Problems
Rabin, M. O., & Scott, D. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.32.0114 · Cited by 1,879
Decidability of Second-Order Theories and Automata on Infinite Trees
Rabin, M. O. (1969) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1969-0246760-1 · Cited by 1,512
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
Relationships between nondeterministic and deterministic tape complexities
Savitch, W. J. (1970) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(70)80006-x · Cited by 1,366
The Temporal Logic of Reactive and Concurrent Systems: Specification
Pnueli, A., & Manna, Z. (1991) · Cited by 1,352
On a Decision Method in Restricted Second Order Arithmetic
Büchi, J. R. (1990) · The Collected Works of J. Richard Büchi · doi:10.1007/978-1-4613-8928-6_23 · Cited by 1,271
An Automata-Theoretic Approach to Automatic Program Verification
Vardi, M. Y., & Wolper, P. (1986) · ORBi (University of Liège) · Cited by 1,261
Self-citationChandra, A. K., Kozen, D. C., & Stockmeyer, L. J. (1981) · Journal of the ACM · doi:10.1145/322234.322243 · Cited by 1,221
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
On the Development of Reactive Systems
Harel, D., & Pnueli, A. (1985) · Logics and Models of Concurrent Systems · doi:10.1007/978-3-642-82453-1_17 · Cited by 859
Reasoning about Infinite Computations
Vardi, M. Y., & Wolper, P. (1994) · Information and Computation · doi:10.1006/inco.1994.1092 · Cited by 795
Self-citationOn 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
Using branching time temporal logic to synthesize synchronization skeletons
Emerson, E. A., & Clarke, E. M. (1982) · Science of Computer Programming · doi:10.1016/0167-6423(83)90017-5 · Cited by 660
Checking that finite state concurrent programs satisfy their linear specification
Lichtenstein, O., & Pnueli, A. (1985) · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · doi:10.1145/318593.318622 · Cited by 621
The equivalence problem for regular expressions with squaring requires exponential space
Meyer, A. R., & Stockmeyer, L. J. (1972) · 13th Annual Symposium on Switching and Automata Theory (swat 1972) · doi:10.1109/swat.1972.29 · Cited by 596
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
Synthesis of Communicating Processes from Temporal Logic Specifications
Manna, Z., & Wolper, P. (1984) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357233.357237 · Cited by 526
On the complexity of omega -automata
Safra, M. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21948 · Cited by 521
Memory-efficient algorithms for the verification of temporal properties
Courcoubetis, C., Vardi, M., Wolper, P., & Yannakakis, M. (1992) · Formal Methods in System Design · doi:10.1007/bf00121128 · Cited by 501
Self-citationSpace-bounded reducibility among combinatorial problems
Jones, N. D. (1975) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(75)80050-x · Cited by 375
"Sometime" is sometimes "not never"
Lamport, L. (1980) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/567446.567463 · Cited by 360
Economy of description by automata, grammars, and formal systems
Meyer, A. R., & Fischer, M. J. (1971) · Annual Symposium on Switching & Automata Theory · doi:10.1109/swat.1971.11 · Cited by 317
Realizable and unrealizable specifications of reactive systems
Abadi, M., Lamport, L., & Wolper, P. (1989) · Lecture Notes in Computer Science · doi:10.1007/bfb0035748 · Cited by 244
Alternating finite automata on ω-words
Miyano, S., & Hayashi, T. (1984) · Theoretical Computer Science · doi:10.1016/0304-3975(84)90049-5 · Cited by 231
Improved upper and lower bounds for modal logics of programs
Vardi, M. Y., & Stockmeyer, L. (1985) · doi:10.1145/22145.22173 · Cited by 139
Self-citationSynthesis of communicating processes from Temporal Logic specifications
Manna, Z., & Wolper, P. (2005) · Springer eBooks · doi:10.1007/bfb0025786 · Cited by 85
(1990)
Cited by
Holzmann, G. J. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.588521 · Cited by 3,803
Model Checking of Safety Properties
Kupferman, O., & Vardi, M. Y. (2001) · Formal Methods in System Design · doi:10.1023/a:1011254632723 · Cited by 566
Self-citationJhala, R., & Majumdar, R. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592438 · Cited by 418
Formal Specification and Verification of Autonomous Robotic Systems: A Survey
Luckcuck, M., Farrell, M., Dennis, L. A., Dixon, C., & Fisher, M. (2020) · ACM Computing Surveys · doi:10.1145/3342355 · Cited by 281
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
Metadata
- Authors
- Vardi, M. Y.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1996
- Pages
- 238-266
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1512310098
- Cited by
- 660
- References
- 34
- FWCI
- 9.88
- 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.