The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Construction of abstract state graphs with PVS
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
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
Model checking and abstraction
Clarke, E. M., Grumberg, O., & Long, D. E. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/186025.186051 · Cited by 1,211
Computer-aided verification of coordinating processes: The automata-theoretic approach
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90267-8 · Cited by 786
Computer-Aided Verification of Coordinating Processes
Kurshan, R. P. (1995) · Princeton University Press eBooks · doi:10.1515/9781400864041 · Cited by 440
Experiments in theorem proving and model checking for protocol verification
Havelund, K., & Shankar, N. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60973-3_113 · Cited by 152
Cited by
Visser, W., Havelund, K., Brat, G., & Park, S. (2000) · Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering · doi:10.1109/ase.2000.873645 · Cited by 341
A static analyzer for large safety-critical software
Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2003) · Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation · doi:10.1145/781131.781153 · Cited by 330
Henzinger, T. A., Jhala, R., & Majumdar, R. (2005) · Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/1081706.1081713 · Cited by 111
Model Checking Multithreaded Programs with Asynchronous Atomic Methods
Sen, K., & Viswanathan, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11817963_29 · Cited by 95
Ranking LLM-Generated Loop Invariants for Program Verification
Chakraborty, S., Lahiri, S., Fakhoury, S., Lal, A., Musuvathi, M., Rastogi, A., Senthilnathan, A., Sharma, R., & Swamy, N. (2023) · Findings of the Association for Computational Linguistics: EMNLP 2023 · doi:10.18653/v1/2023.findings-emnlp.614 · Cited by 37
Metadata
- Authors
- Graf, S., & Saidi, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1997
- Pages
- 72-83
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1497571013
- Cited by
- 1,454
- References
- 5
- FWCI
- 22.26
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Construction of abstract state graphs with PVS. https://app.cochat.ai/papers/10.1007/3-540-63166-6_10
- The paper
- Graf, S., & Saidi, H. (1997). Construction of abstract state graphs with PVS. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-63166-6_10
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.
