The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
IronFleet: proving practical distributed systems correct
Abstract
Distributed systems are notorious for harboring subtle bugs. Verification can, in principle, eliminate these bugs a priori, but verification has historically been difficult to apply at full-program scale, much less distributed-system scale.
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
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
de Moura, L., & Bjørner, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_24 · Cited by 6,595
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
In search of an understandable consensus algorithm
Ongaro, D., & Ousterhout, J. K. (2014) · USENIX Annual Technical Conference · Cited by 3,398
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
ZooKeeper: wait-free coordination for internet-scale systems
Hunt, P. G., Konar, M., Junqueira, F., & Reed, B. C. (2010) · USENIX Annual Technical Conference · Cited by 1,968
Lamport, L. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/177492.177726 · Cited by 1,843
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
Assigning Meanings to Programs
Floyd, R. W. (1993) · Studies in Cognitive Systems · doi:10.1007/978-94-011-1793-7_4 · Cited by 1,079
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Lamport, L. (2002) · CERN Document Server (European Organization for Nuclear Research) · Cited by 941
Dafny: An Automatic Program Verifier for Functional Correctness
Leino, K. R. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17511-4_20 · Cited by 940
The Chubby lock service for loosely-coupled distributed systems
Burrows, M. (2006) · Operating Systems Design and Implementation · doi:10.5555/1298455.1298487 · Cited by 877
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
The existence of refinement mappings
Abadi, M., & Lamport, L. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(91)90224-p · Cited by 737
Finding and Reproducing Heisenbugs in Concurrent Programs
Musuvathi, M., Qadeer, S., Nainar, P. A., Ball, T., Basler, G., & Neamtiu, I. (2008) · Cited by 541
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications
Stoica, I., Morris, R., Liben‐Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2001) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 516
There is more consensus in Egalitarian parliaments
Moraru, I., Andersen, D. G., & Kaminsky, M. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2517350 · Cited by 362
CMC: a pragmatic approach to model checking real code
Musuvathi, M., Park, D. Y. W., Chou, A., Engler, D. R., & Dill, D. L. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844136 · Cited by 361
How Amazon web services uses formal methods
Newcombe, C., Rath, T., Zhang, F., Munteanu, B., Brooker, M., & Deardeuff, M. (2015) · Communications of the ACM · doi:10.1145/2699417 · Cited by 351
Comprehensive formal verification of an OS microkernel
Klein, G., Andronick, J., Elphinstone, K., Murray, T., Sewell, T., Kolanski, R., & Heiser, G. (2014) · ACM Transactions on Computer Systems · doi:10.1145/2560537 · Cited by 348
Zab: High-performance broadcast for primary-backup systems
Junqueira, F. P., Reed, B. C., & Serafini, M. (2011) · 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN) · doi:10.1109/dsn.2011.5958223 · Cited by 323
Proceedings of Symposia in Applied Mathematics.
Tompkins, C. B., Bellman, R., & Hall, M. (1961) · Mathematics of Computation · doi:10.2307/2002914 · Cited by 296
Verdi: a framework for implementing and formally verifying distributed systems
Wilcox, J. R., Woos, D., Panchekha, P., Tatlock, Z., Wang, X., Ernst, M. D., & Anderson, T. (2015) · Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2737924.2737958 · Cited by 270
Prior, A. N. (1968) · Cited by 254
Mace: language support for building distributed systems
Killian, C. E., Anderson, J. W., Braud, R., Jhala, R., & Vahdat, A. M. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250755 · Cited by 199
Deep Specifications and Certified Abstraction Layers
Gu, R., Koenig, J., Ramananandro, T., Shao, Z., Wu, X., Weng, S.-C., Zhang, H., & Guo, Y. (2014) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2676726.2676975 · Cited by 172
Ironclad apps: end-to-end security via automated full-system verification
Hawblitzel, C., Howell, J., Lorch, J. R., Narayan, A., Parno, B. J., Zhang, D., & Zill, B. (2014) · Operating Systems Design and Implementation · doi:10.5555/2685048.2685062 · Cited by 161
Self-citationYuan, D., Luo, Y., Zhuang, X., Rodrigues, G. R., Rodrigues, X., Zhang, Y., Jain, P. U., Stumm, M., & Stumm (2014) · Operating Systems Design and Implementation · doi:10.5555/2685048.2685068 · Cited by 151
Memoir: Practical State Continuity for Protected Modules
Parno, B. J., Lorch, J. R., Douceur, J. R., Mickens, J. W., & McCune, J. M. (2011) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2011.38 · Cited by 133
Self-citationElmas, T., Qadeer, S., & Taşiran, S. (2009) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1480881.1480885 · Cited by 120
Using lightweight modeling to understand chord
Zave, P. (2012) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2185376.2185383 · Cited by 112
Byzantizing Paxos by Refinement
Lamport, L. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24100-0_22 · Cited by 101
Timing Analysis of a Protected Operating System Kernel
Blackham, B., Shi, Y., Chattopadhyay, S., Roychoudhury, A., & Heiser, G. A. (2011) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/rtss.2011.38 · Cited by 90
Practical software model checking via dynamic interface reduction
Guo, H., Wu, M., Zhou, L., et al. (2011) · doi:10.1145/2043556.2043582 · Cited by 87
A Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication Algorithm
Castro, M., & Liskov, B. H. (1999) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 77
Checking Cache-Coherence Protocols with TLA+
Joshi, R., Lamport, L., Matthews, J., et al. (2003) · Formal Methods in System Design · doi:10.1023/a:1022969405325 · Cited by 58
Verifying security invariants in ExpressOS
Mai, H., Pek, E., Xue, H., King, S. T., & Madhusudan, P. (2013) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/2451116.2451148 · Cited by 44
Bolosky, W. J., Douceur, J. R., & Howell, J. (2007) · ACM SIGOPS Operating Systems Review · doi:10.1145/1243418.1243422 · Cited by 41
Self-citationFirst-order verification of cryptographic protocols
Cohen, E. (2003) · Journal of Computer Security · doi:10.3233/jcs-2003-11203 · Cited by 33
Developing Correctly Replicated Databases Using Formal Tools
Schiper, N., Rahli, V., van Renesse, R., et al. (2014) · IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) · doi:10.1109/dsn.2014.45 · Cited by 31
Yu, Y. (2002) · Microprocessor Test and Verification · Cited by 8
Cited by
Using Crash Hoare logic for certifying the FSCQ file system
Chen, H., Ziegler, D., Chajed, T., Chlipala, A., Kaashoek, M. F., & Zeldovich, N. (2015) · Proceedings of the 25th Symposium on Operating Systems Principles · doi:10.1145/2815400.2815402 · Cited by 211
SoK: Computer-Aided Cryptography
Barbosa, M., Barthe, G., Bhargavan, K., Blanchet, B., Cremers, C., Liao, K., & Parno, B. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00008 · Cited by 143
Self-citationTowards AI-Assisted Synthesis of Verified Dafny Methods
Misu, M. R. H., Lopes, C. V., Ma, I., & Noble, J. (2024) · Proceedings of the ACM on Software Engineering · doi:10.1145/3643763 · Cited by 38
A survey on verification strategies for intelligent transportation systems
Schmidtke, H. R. (2018) · Journal of Reliable Intelligent Environments · doi:10.1007/s40860-018-0070-5 · Cited by 19
Metadata
- Authors
- Hawblitzel, C., Howell, J., Kapritsos, M., Lorch, J. R., Parno, B., Roberts, M. L., Setty, S., & Zill, B.
- Venue
- Proceedings of the 25th Symposium on Operating Systems Principles
- Publisher
- ACM
- Published
- 2015-10-04
- Pages
- 1-17
- OpenAlex
- W2091776255
- Cited by
- 320
- References
- 43
- FWCI
- 32.79
- 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.