The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Memory-efficient algorithms for the verification of temporal properties
Open accessOverview
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Automatic verification of finite-state concurrent systems using temporal logic specifications
Clarke, E. M., Emerson, E. A., & Sistla, A. P. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5397.5399 · Cited by 3,605
Data Structures and Algorithms
(2003) · Series on software engineering and knowledge engineering · doi:10.1142/9789812791245 · Cited by 2,117
Design and validation of computer protocols
Holzmann, G. J. (1991) · Cited by 1,926
Specification and verification of concurrent systems in CESAR
Queille, J. P., & Sifakis, J. (1982) · Lecture Notes in Computer Science · doi:10.1007/3-540-11494-7_22 · Cited by 1,321
An Automata-Theoretic Approach to Automatic Program Verification
Vardi, M. Y., & Wolper, P. (1986) · ORBi (University of Liège) · Cited by 1,261
Self-citationChecking 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
Cited by
Holzmann, G. J. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.588521 · Cited by 3,803
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
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
Self-citationAn 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
Self-citationModel Checking of Safety Properties
Kupferman, O., & Vardi, M. Y. (2001) · Formal Methods in System Design · doi:10.1023/a:1011254632723 · Cited by 566
Self-citation
Metadata
- Authors
- Courcoubetis, C., Vardi, M., Wolper, P., & Yannakakis, M.
- Venue
- Formal Methods in System Design
- Published
- 1992-10
- Volume
- 1
- Issue
- 2-3
- Pages
- 275-288
- ISSN
- 0925-9856 (ISSN-L)
- 1572-8102
- OpenAlex
- W2012935476
- Cited by
- 501
- References
- 8
- FWCI
- 12.56
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Memory-efficient algorithms for the verification of temporal properties. https://app.cochat.ai/papers/10.1007/bf00121128
- The paper
- Courcoubetis, C., Vardi, M., Wolper, P., & Yannakakis, M. (1992). Memory-efficient algorithms for the verification of temporal properties. Formal Methods in System Design. https://doi.org/10.1007/bf00121128
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.