1. I. Balaban, A. Pnueli & L. D. Zuck (2006): Invisible Safety of Distributed Protocols. In: ICALP '06, pp. 528–539, doi:10.1007/11787006_45.
  2. P. Bokor, M. Serafini & N. Suri (2010): On efficient models for model checking message-passing distributed protocols. In: Formal Techniques for Distributed Systems. Springer, pp. 216–223, doi:10.1007/978-3-642-13464-7_17.
  3. M. Burrows (2006): The Chubby lock service for loosely-coupled distributed systems. In: OSDI '06, pp. 335–350.
  4. G. Delzanno, A. Rensink & R. Traverso (2014): Graph- versus Vector-Based Analysis of a Consensus Protocol.
  5. G. Delzanno, A. Sangnier & R. Traverso (2013): Parameterized Verification of Broadcast Networks of Register Automata. In: RP '13, pp. 109–121, doi:10.1007/978-3-642-41036-9_11.
  6. G. Delzanno, A. Sangnier, R. Traverso & G. Zavattaro (2012): On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. In: FSTTCS '12, pp. 289–300, doi:10.4230/LIPIcs.FSTTCS.2012.289.
  7. G. Delzanno, A. Sangnier & G. Zavattaro (2010): Parameterized Verification of Ad Hoc Networks. In: CONCUR '10, pp. 313–327, doi:10.1007/978-3-642-15375-4_22.
  8. G. Delzanno, A. Sangnier & G. Zavattaro (2011): On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks. In: FOSSACS '11, pp. 441–455, doi:10.1007/978-3-642-19805-2_30.
  9. G. Delzanno & R. Traverso (2013): Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks. In: LATA '13, pp. 238–249, doi:10.1007/978-3-642-37064-9_22.
  10. G. Delzanno & R. Traverso (2013): Specification and Validation of Link Reversal Routing via Graph Transformations. In: SPIN '13, pp. 238249, doi:10.1007/978-3-642-39176-7_11.
  11. E. A. Emerson & K. S. Namjoshi (2003): On Reasoning About Rings. IJFCS 14(4), pp. 527–550, doi:10.1142/S0129054103001881.
  12. A. Fehnker, R. J. van Glabbeek, P. Höfner, A. McIver, M. Portmann & W. L. Tan (2012): Automated Analysis of AODV Using UPPAAL. In: TACAS 12, pp. 173–187, doi:10.1007/978-3-642-28756-5_13.
  13. A. Fehnker, L. van Hoesel & A. Mader (2007): Modelling and Verification of the LMAC Protocol for Wireless Sensor Networks. In: IFM '07, pp. 253–272, doi:10.1007/978-3-540-73210-5_14.
  14. M. J. Fischer, N. A. Lynch & M. Paterson (1985): Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32(2), pp. 374–382, doi:10.1145/588058.588060.
  15. A. Gmeiner, I. Konnov, U. Schmid, H. Veith & J. Widder (2014): Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms. In: SFM '14, pp. 122–171, doi:10.1007/978-3-319-07317-0_4.
  16. A. John, I. Konnov, U. Schmid, H. Veith & J. Widder (2013): Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms. In: SPIN '13, pp. 209–226, doi:10.1007/978-3-642-39176-7_14.
  17. S. Joshi & B. König (2008): Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems. In: CAV '08, pp. 214–226, doi:10.1007/978-3-540-70545-1_21.
  18. I. Konnov, H. Veith & J. Widder (2012): Who is afraid of Model Checking Distributed Algorithms?. CAV Workshop (EC)^2.
  19. L. Lamport (1998): The Part-time Parliament. ACM Transactions on Computer Systems 16(3), pp. 133–169, doi:10.1145/279227.279229.
  20. L. Lamport (2001): Paxos Made Simple. ACM SIGACT News (Distributed Computing Column) 32, 4(121), pp. 51–58, doi:10.1145/568425.568433.
  21. L. Lamport (2011): Byzantizing Paxos by Refinement. In: DISC 2011, pp. 211–224, doi:10.1007/978-3-642-24100-0_22.
  22. K. Marzullo, A. Mei & H. Meling (2013): A Simpler Proof for Paxos and Fast Paxos. Course notes.
  23. K. S. Namjoshi & R. J. Trefler (2013): Uncovering Symmetries in Irregular Process Networks. In: VMCAI '13, pp. 496–514, doi:10.1007/978-3-642-35873-9_29.
  24. M. Saksena, O. Wibling & B. Jonsson (2008): Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. In: TACAS '08, pp. 18–32, doi:10.1007/978-3-540-78800-3_3.
  25. A. Singh, C. R. Ramakrishnan & S. A. Smolka (2009): Query-Based Model Checking of Ad Hoc Network Protocols. In: CONCUR '09, pp. 603–619, doi:10.1007/978-3-642-04081-8_40.
  26. T. Tsuchiya & A. Schiper (2008): Using bounded model checking to verify consensus algorithms. In: Distributed Computing. Springer, pp. 466–480, doi:10.1007/978-3-540-87779-0_32.

Comments and questions to:
For website issues: