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.
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
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
Levin, M. R., & Lakatos, I. (1980) · Noûs · doi:10.2307/2214971 · Cited by 1,266
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 985
Boyer, R. S., & Moore, J. S. (1979) · Cited by 883
Edinburgh LCF: A mechanised logic of computation
Gordon, M. J. C. (1979) · Medical Entomology and Zoology · Cited by 580
SIFT: Design and analysis of a fault-tolerant computer for aircraft control
Wensley, J. H., Lamport, L., Goldberg, J., Green, M. W., Levitt, K. N., Melliar-Smith, P. M., Shostak, R. E., & Weinstock, C. B. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.11114 · Cited by 568
Synchronizing clocks in the presence of faults
Lamport, L., & Melliar-Smith, P. M. (1985) · Journal of the ACM · doi:10.1145/2455.2457 · Cited by 543
Specifying Software Requirements for Complex Systems: New Techniques and Their Application
Heninger, K. L. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.230208 · Cited by 493
Deciding Combinations of Theories
Shostak, R. E. (1984) · Journal of the ACM · doi:10.1145/2422.322411 · Cited by 298
Analyzing software requirements errors in safety-critical, embedded systems
Lutz, R. R. (2002) · [1993] Proceedings of the IEEE International Symposium on Requirements Engineering · doi:10.1109/isre.1993.324825 · Cited by 285
A new fault-tolerant algorithm for clock synchronization
Welch, J. L., & Lynch, N. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90043-0 · Cited by 282
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
The MAFT architecture for distributed fault tolerance
Keichafer, R. M., Walter, C. J., Finn, A. M., & Thambidurai, P. M. (1988) · IEEE Transactions on Computers · doi:10.1109/12.2183 · Cited by 198
Interactive consistency with multiple failure modes
Thambidurai, P., & Park, Y.-K. (2003) · Proceedings [1988] Seventh Symposium on Reliable Distributed Systems · doi:10.1109/reldis.1988.25784 · Cited by 193
Deciding Linear Inequalities by Computing Loop Residues
Shostak, R. E. (1981) · Journal of the ACM · doi:10.1145/322276.322288 · Cited by 181
FM8501: A Verified Microprocessor
(1994) · Lecture notes in computer science · doi:10.1007/3-540-57960-5 · Cited by 180
Formal verification of algorithms for critical systems
Rushby, J., & von Henke, F. W. (1993) · IEEE Transactions on Software Engineering · doi:10.1109/32.210304 · Cited by 91
Self-citationA Formally Verified Algorithm for Interactive Consistency Under a Hybrid Fault Model
Lincoln, P. D., & Rushby, J. (2005) · IEEE International Symposium on Fault-Tolerant Computing · doi:10.1109/ftcsh.1995.532669 · Cited by 79
Self-citationRigor and Proof in Mathematics: A Historical Perspective
Kleiner, I. (1991) · Mathematics Magazine · doi:10.1080/0025570x.1991.11977625 · Cited by 71
Mechanical 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-citationThe formal verification of an algorithm for interactive consistency under a hybrid fault model
Lincoln, P. D., & Rushby, J. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56922-7_24 · Cited by 41
Self-citationMay, D., Barrett, G., & Shepherd, D. (1992) · Philosophical Transactions of the Royal Society of London Series A Physical and Engineering Sciences · doi:10.1098/rsta.1992.0022 · Cited by 19
The enhanced HDM system for specification and verification
Melliar-Smith, M., & Rushby, J. (1985) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1012497.1012511 · Cited by 13
Self-citation
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.