, , 2004.
Boogie: A modular reusable verifier for object-oriented programs, Formal Methods for Components and Objects, pp.364-387, 2005. ,
, Consensus in one communication step. In: PaCT. LNCS, vol.2127, pp.42-50, 2001.
Z3: An efficient SMT solver, Tools and Algorithms for the Construction and Analysis of Systems, vol.1579, pp.337-340, 2008. ,
One-step consensus with zero-degradation, DSN. pp, pp.137-146, 2006. ,
Non-blocking atomic commit in asynchronous distributed systems with failure detectors, Distributed Computing, vol.15, issue.1, pp.17-25, 2002. ,
The SPIN Model Checker, 2003. ,
DOI : 10.1109/32.588521
Parameterized model checking of fault-tolerant distributed algorithms by abstraction, FMCAD. pp, pp.201-209, 2013. ,
DOI : 10.1109/fmcad.2013.6679411
Towards modeling and model checking fault-tolerant distributed algorithms, SPIN. LNCS, vol.7976, pp.209-226, 2013. ,
DOI : 10.1007/978-3-642-39176-7_14
URL : http://spinroot.com/spin/Workshops/ws13/spin2013_submission_28.pdf
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms, POPL. pp, pp.719-734, 2017. ,
On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability, CONCUR. LNCS, vol.8704, pp.125-140, 2014. ,
SMT and POR beat counter abstraction: Parameterized model checking of threshold-based distributed algorithms, CAV (Part I), vol.9206, pp.85-102, 2015. ,
DOI : 10.1007/978-3-319-21690-4_6
What you always wanted to know about model checking of fault-tolerant distributed algorithms, PSI 2015, in Memory of Helmut Veith, Revised Selected Papers, vol.9609, pp.6-21, 2016. ,
Accuracy of message counting abstraction in fault-tolerant distributed algorithms, VMCAI. pp, pp.347-366, 2017. ,
Synthesis of distributed algorithms with parameterized threshold guards, OPODIS. LIPIcs, vol.95, p.20, 2017. ,
Distributed Algorithms, 1996. ,
Cutoff Bounds for Consensus Algorithms, CAV. pp, pp.217-237, 2017. ,
Evaluating the conditionbased approach to solve consensus, pp.541-550, 2003. ,
Reaching agreement in the presence of faults, J.ACM, vol.27, issue.2, pp.228-234, 1980. ,
A case study of agreement problems in distributed systems: Nonblocking atomic commitment, pp.209-214, 1997. ,
Bosco: One-step Byzantine asynchronous consensus, DISC. LNCS, vol.5218, pp.438-450, 2008. ,
DOI : 10.1007/978-3-540-87779-0_30
URL : http://www.cs.cornell.edu/projects/quicksilver/public_pdfs/52180438.pdf
Simulating authenticated broadcasts to derive simple faulttolerant algorithms, Dist. Comp, vol.2, pp.80-94, 1987. ,
Gnu parallel-the command-line power tool. The USENIX Magazine, vol.36, pp.42-47, 2011. ,
Voting in the presence of byzantine faults, Dependable Computing (PRDC), pp.1-10, 2017. ,