The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Formal verification for fault-tolerant architectures: prolegomena to the design of PVS
Abstract
PVS is the most recent in a series of verification systems developed at SRI. Its design was strongly influenced, and later refined, by our experiences in developing formal specifications and mechanically checked verifications for the fault-tolerant architecture, algorithms, and implementations of a model "reliable computing platform" (RCP) for life-critical digital flight-control applications, and by a collaborative project to formally verify the design of a commercial avionics processor called AAMP5. Several of the formal specifications and verifications performed in support of RCP and AAMP5 are individually of considerable complexity and difficulty. But in order to contribute to the overall goal, it has often been necessary to modify completed verifications to accommodate changed assumptions or requirements, and people other than the original developer have often needed to understand, review, build on, modify, or extract part of an intricate verification. We outline the verifications performed, present the lessons learned, and describe some of the design decisions taken in PVS to better support these large, difficult, iterative, and collaborative verifications.>
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
Clarke, E., McMillan, K., Campos, S., & Hartonas-Garmhausen, V. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61474-5_93 · Cited by 2,839
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
Shoenfield, J. R. (1967) · Cited by 2,108
Ousterhout, J. K. (1994) · Cited by 1,627
PVS: A prototype verification system
Owre, S., Rushby, J. M., & Shankar, N. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55602-8_217 · Cited by 1,415
Self-citationIntroduction to HOL: a theorem proving environment for higher order logic
Gordon, M., & Melham, T. (1993) · Cambridge University Press eBooks · Cited by 1,299
Implementing Mathematics with The Nuprl Proof Development System
Constable, R. L., Allen, S. F., Bromley, H. M., Cleaveland, W. R., Cremer, J. F., Harper, R. W., Howe, D. J., Knoblock, T. B., Mendler, N. P., Panangaden, P., et al. (1986) · Cited by 1,279
Levin, M. R., & Lakatos, I. (1980) · Noûs · doi:10.2307/2214971 · Cited by 1,266
Boyer, R. S., & Moore, J. S. (1979) · Cited by 883
Cited by
Preliminary design of JML: a behavioral interface specification language for java
Leavens, G. T., Baker, A. L., & Ruby, C. (2006) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1127878.1127884 · Cited by 790
Handling obstacles in goal-oriented requirements engineering
van Lamsweerde, A., & Letier, E. (2000) · IEEE Transactions on Software Engineering · doi:10.1109/32.879820 · Cited by 648
Dutertre, B. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-08867-9_49 · Cited by 398
Metadata
- Authors
- Owre, S., Rushby, J., Shankar, N., & von Henke, F.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 1995
- Volume
- 21
- Issue
- 2
- Pages
- 107-125
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2113486906
- Cited by
- 493
- References
- 29
- FWCI
- 53.62
- Type
- journal article
- 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.