The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
PVS: A prototype verification system
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
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023 · cited 1×
“Only a few modest-sized example verifications have so far been carried out using PVS; these include the correctness of the Boyer-Moore majority algorithm [2], the proof that insertion into an ordered binary tree preserves order, the Oral Messages Algorithm for Byzantine Agreement [ 4 ], Cantor's theorem, the Schr6der-…”
MethodBoyer, R. S., & Moore, J. S. (1979) · Cited by 883
Gordon, M. J., Milner, A. J., & Wadsworth, C. P. (1979) · Lecture Notes in Computer Science · doi:10.1007/3-540-09724-4 · Cited by 628
Deciding Combinations of Theories
Shostak, R. E. (1984) · Journal of the ACM · doi:10.1145/2422.322411 · Cited by 341
MJRTY—A Fast Majority Vote Algorithm
Boyer, R. S., & Moore, J. S. (1991) · Automated Reasoning Series · doi:10.1007/978-94-011-3488-0_5 · Cited by 240
Formal verification of algorithms for critical systems
Rushby, J., & von Henke, F. W. (1991) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/123041.123044 · Cited by 56
Self-citationMechanical verification of a generalized protocol for Byzantine fault tolerant clock synchronization
Shankar, N. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55092-5_12 · Cited by 49
Self-citation
Cited by
Formal Methods: State of the Art and Future Directions
Clarke, E., Wing, J. M., & Jones, C. B. (1996) · doi:10.25405/ncl.34123050 · Cited by 1,122
Bandera: extracting finite-state models from Java source code
Corbett, J. C., Dwyer, M. B., Hatcliff, J., Laubach, S., Păsăreanu, C. S., Robby, & Zheng, H. (2000) · Proceedings of the 22nd international conference on Software engineering - ICSE '00 · doi:10.1145/337180.337234 · Cited by 1,059
Simplify: a theorem prover for program checking
Detlefs, D., Nelson, G., & Saxe, J. B. (2005) · Journal of the ACM · doi:10.1145/1066100.1066102 · Cited by 786
Formal methods: Practice and experience
Woodcock, J., Larsen, P. G., Bicarregui, J., & Fitzgerald, J. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592436 · Cited by 686
Satisfiability modulo theories: introduction and applications
De Moura, L., & Bjørner, N. (2011) · Communications of the ACM · doi:10.1145/1995376.1995394 · Cited by 645
Metadata
- Authors
- Owre, S., Rushby, J. M., & Shankar, N.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1992
- Pages
- 748-752
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1534850143
- Cited by
- 1,415
- References
- 7
- FWCI
- 13.80
- 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.