A Comparison of the Declarative Modelling Languages B, Dash, and TLA+, 2018 IEEE 8th International Model-Driven Requirements Engineering Workshop (MoDRE), pp.11-20, 2018. ,
The B-book: assigning programs to meanings, 2005. ,
, 6th International ABZ Conference ASM, 2018.
, Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2004.
A machine-checked correctness proof for Pastry, Sci. Comput. Program, vol.158, pp.64-80, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01768758
Automatic Predicate Abstraction of C Programs, PLDI, pp.203-213, 2001. ,
Boogie: A modular reusable verifier for object-oriented programs, International Symposium on Formal Methods for Components and Objects, pp.364-387, 2005. ,
The Spec# programming system: An overview, International Workshop on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices, pp.49-69, 2004. ,
The SMT-LIB Standard: Version 2.6, 2017. ,
METEOR: A successful application of B in a large project, International Symposium on Formal Methods, pp.369-387, 1999. ,
Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics, pp.245-266, 2019. ,
Interactive theorem proving and program development: Coq'Art: the calculus of inductive constructions, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00344237
Extending Sledgehammer with SMT solvers, Journal of automated reasoning, vol.51, pp.109-128, 2013. ,
, SICStus Prolog user's manual, vol.3, 1988.
The nuXmv symbolic model checker, International Conference on Computer Aided Verification, pp.334-342, 2014. ,
The Kind 2 model checker, International Conference on Computer Aided Verification, pp.510-517, 2016. ,
The TLA + proof system: Building a heterogeneous verification platform, Theoretical aspects of computing, pp.44-44, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00521886
Nusmv 2: An opensource tool for symbolic model checking, International Conference on Computer Aided Verification, pp.359-364, 2002. ,
Counterexample-guided abstraction refinement for symbolic model checking, J. ACM, vol.50, pp.752-794, 2003. ,
VCC: A practical system for verifying concurrent C, International Conference on Theorem Proving in Higher Order Logics, pp.23-42, 2009. ,
Reduction in TLA, CONCUR (LNCS), pp.317-331, 1998. ,
A Decision Procedure for Sets, Binary Relations and Partial Functions, CAV, pp.179-198, 2016. ,
Communication-Closed Asynchronous Protocols, CAV, pp.344-363, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01991415
Z3: An efficient SMT solver, TACAS. LNCS, vol.1579, pp.337-340, 2008. ,
Model Checking Paxos in Spin, Proceedings Fifth International Symposium on Games, Automata, Logics and Formal Verification, pp.131-146, 2014. ,
A Logic-based Framework for Verifying Consensus Algorithms, VMCAI, vol.8318, pp.161-181, 2014. ,
PSync: a partially synchronous language for fault-tolerant distributed algorithms, pp.400-415, 2016. ,
SMTCoq: A plug-in for integrating SMT solvers into Coq, International Conference on Computer Aided Verification, pp.126-133, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01669345
Relational reasoning via SMT solving, International Symposium on Formal Methods, pp.133-148, 2011. ,
Proving Liveness of Parameterized Programs, LICS, pp.185-196, 2016. ,
, Disk Paxos. Distributed Computing, vol.16, pp.1-20, 2003.
The IOA language and toolset: Support for designing, analyzing, and building distributed systems, 1998. ,
Consensus on transaction commit, ACM Trans. Database Syst, vol.31, issue.1, pp.133-160, 2006. ,
The next 700 BFT protocols, Proceedings of the 5th European conference on Computer systems, pp.363-376, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00945717
Kafka Improvement Proposal 320, 2019. ,
Translating TLA + to B for Validation with ProB, IFM, pp.24-38, 2012. ,
IronFleet: Proving Safety and Liveness of Practical Distributed Systems, Commun. ACM, vol.60, issue.7, pp.83-92, 2017. ,
An axiomatic basis for computer programming, The SPIN Model Checker, vol.12, pp.576-580, 1969. ,
Flexible Paxos: Quorum Intersection Revisited, OPODIS, vol.25, p.14, 2016. ,
Software Abstractions: logic, language, and analysis, 2012. ,
Systematic software development using VDM, vol.2, 1990. ,
, APALACHE Model Checker, 2019.
Para 2 : Parameterized Path Reduction, Acceleration, and SMT for Reachability in Threshold-Guarded Distributed Algorithms, Formal Methods in System Design, vol.51, pp.270-307, 2017. ,
A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms, pp.719-734, 2017. ,
A Translation from Alloy to B, International Conference on Abstract State Machines, pp.71-86, 2018. ,
Extracting Symbolic Transitions from TLA+ Specifications, Abstract State Machines, pp.89-104, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01871131
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic, pp.260-277, 2005. ,
The Temporal Logic of Actions, ACM Trans. Program. Lang. Syst, vol.16, pp.872-923, 1994. ,
Specifying systems: The TLA+ language and tools for hardware and software engineers, 2002. ,
Byzantizing Paxos by Refinement, DISC, vol.6950, pp.211-224, 2011. ,
TLA +2 : A Preliminary Guide, ACM Sigact News, vol.32, pp.18-25, 2001. ,
Crash recovery in a distributed data storage system, 1979. ,
This is boogie 2, vol.178, p.9, 2008. ,
Dafny: An automatic program verifier for functional correctness, International Conference on Logic for Programming Artificial Intelligence and Reasoning, pp.348-370, 2010. ,
ProB: an automated analysis toolset for the B method, International Journal on Software Tools for Technology Transfer, vol.10, pp.185-203, 2008. ,
Reduction: A Method of Proving Properties of Parallel Programs, Commun. ACM, vol.18, pp.717-721, 1975. ,
Distributed algorithms, 1996. ,
A Proof of the Kahn Principle for Input/Output Automata, Inf. Comput, vol.82, pp.81-92, 1989. ,
Lightweight specification and analysis of dynamic systems with rich configurations, Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, pp.373-383, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01355062
Alloy meets TLA+: An exploratory study, 2016. ,
Cutoff Bounds for Consensus Algorithms, CAV, pp.217-237, 2017. ,
The SMV system, Symbolic Model Checking, pp.61-85, 1993. ,
Cas Cremers, and David Basin. 2013. The TAMARIN prover for the symbolic analysis of security protocols, International Conference on Computer Aided Verification, pp.696-701 ,
Relational constraint solving in SMT, International Conference on Automated Deduction, pp.148-165, 2017. ,
The Specification Language TLA +, Logics of Specification Languages, pp.401-451, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00338330
On the Logic of TLA +, Computing and Informatics, vol.22, pp.351-379, 2012. ,
URL : https://hal.archives-ouvertes.fr/inria-00099800
Automatic Verification of TLA + Proof Obligations with SMT Solvers, LPAR, vol.7180, pp.289-303, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00760570
Encoding TLA+ into unsorted and many-sorted first-order logic, Science of Computer Programming, vol.158, pp.3-20, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01768750
There is more consensus in egalitarian parliaments, SOSP. ACM, pp.358-372, 2013. ,
Why amazon chose TLA+, International Conference on Abstract State Machines, pp.25-39, 2014. ,
How Amazon web services uses formal methods, Comm. ACM, vol.58, pp.66-73, 2015. ,
Isabelle/HOL: a proof assistant for higher-order logic, vol.2283, 2002. ,
Consensus: Bridging theory and practice, 2014. ,
Paxos made EPR: decidable reasoning about distributed protocols, PACMPL, vol.1, p.31, 2017. ,
Source-level proof reconstruction for interactive theorem proving, International Conference on Theorem Proving in Higher Order Logics, pp.232-245, 2007. ,
Validating B, Z and TLA+ using ProB and Kodkod, International Symposium on Formal Methods, pp.372-386, 2012. ,
EventML: Specification, verification, and implementation of crash-tolerant state machine replication systems, Sci. Comput. Program, vol.148, pp.26-48, 2017. ,
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00543036
Programming and proving with distributed protocols, POPL, vol.2, p.30, 2018. ,
The Z notation, 1992. ,
Dependent types and multi-monadic effects in F, In ACM SIGPLAN Notices, vol.51, pp.256-270, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01265793
Reasoning with Finite Sets and Cardinality Constraints in SMT, Logical Methods in Computer Science, vol.14, 2018. ,
A collection of TLA+ specifications of varying complexities, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.632-647, 2007. ,
Cardinalities and universal quantifiers for verifying parameterized systems, PLDI, pp.599-613, 2016. ,
Pretend synchrony: synchronous verification of asynchronous distributed programs, PACMPL, vol.3, p.30, 2019. ,
, , 2018.
Verdi: a framework for implementing and formally verifying distributed systems, PLDI, pp.357-368, 2015. ,
Collections, Cardinalities, and Relations, VMCAI, pp.380-395, 2010. ,
Model checking TLA + specifications, Correct Hardware Design and Verification Methods, pp.54-66, 1999. ,
Using lightweight modeling to understand Chord, ACM SIGCOMM Computer Communication Review, vol.42, pp.49-57, 2012. ,
A practical comparison of Alloy and Spin, Formal Aspects of Computing, vol.27, pp.239-253, 2015. ,