References

1. Péter Bokor, Marco Serafini & Neeraj Suri (2010): On Efficient Models for Model Checking Message-Passing Distributed Protocols. Lecture Notes in Computer Science, pp. 216–223. Available at http://dx.doi.org/10.1007/978-3-642-13464-7_17.
2. Pepijn Crouzen, Jaco van de Pol & Arend Rensink (2008): Applying formal methods to gossiping networks with mCRL and groove. SIGMETRICS Perform. Eval. Rev. 36(3), pp. 7. Available at http://dx.doi.org/10.1145/1481506.1481510.
3. Giorgio Delzanno & Riccardo Traverso (2013): Specification and Validation of Link Reversal Routing via Graph Transformations. Lecture Notes in Computer Science, pp. 160–177. Available at http://dx.doi.org/10.1007/978-3-642-39176-7_11.
4. Ansgar Fehnker, Rob van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann & Wee Lum Tan (2012): Automated Analysis of AODV Using UPPAAL. Tools and Algorithms for the Construction and Analysis of Systems, pp. 173–187. Available at http://dx.doi.org/10.1007/978-3-642-28756-5_13.
5. Ansgar Fehnker, Lodewijk Hoesel & Angelika Mader (2007): Modelling and Verification of the LMAC Protocol for Wireless Sensor Networks. Lecture Notes in Computer Science, pp. 253–272. Available at http://dx.doi.org/10.1007/978-3-540-73210-5_14.
6. Michael J. Fischer, Nancy A. Lynch & Michael S. Paterson (1983): Impossibility of distributed consensus with one faulty process. Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS'83. Available at http://dx.doi.org/10.1145/588058.588060.
7. Amir Hossein Ghamarian, Maarten Mol, Arend Rensink, Eduardo Zambon & Maria Zimakova (2012): Modelling and analysis using GROOVE. Int J Softw Tools Technol Transfer 14(1), pp. 15–40. Available at http://dx.doi.org/10.1007/s10009-011-0186-x.
8. I. Konnov, H. Veith & J. Widder (2012): Who is afraid of Model Checking Distributed Algorithms?. Unpublished contribution to: CAV Workshop (EC)^2. Available at http://forsyte.at/wp-content/uploads/2012/07/ec2-konnov.pdf.
9. L. Lamport (2001): Paxos Made Simple. ACM SIGACT News (Distributed Computing Column) 32(4), pp. 51–58, doi:10.1145/568425.568433.
10. Leslie Lamport (1998): The part-time parliament. TOCS 16(2), pp. 133–169. Available at http://dx.doi.org/10.1145/279227.279229.
11. K. Marzullo, A. Mei & H. Meling (2013): A Simpler Proof for Paxos and Fast Paxos. Course notes.
12. A. Rensink (2007): Isomorphism Checking in groove. In: A. Zündorf & D. Varró: Graph-Based Tools (GraBaTs), Electronic Communications of the EASST 1. European Association of Software Science and Technology.
13. Mayank Saksena, Oskar Wibling & Bengt Jonsson (2008): Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. Tools and Algorithms for the Construction and Analysis of Systems, pp. 18–32. Available at http://dx.doi.org/10.1007/978-3-540-78800-3_3.
14. Anu Singh, C. R. Ramakrishnan & Scott A. Smolka (2009): Query-Based Model Checking of Ad Hoc Network Protocols. CONCUR 2009 - Concurrency Theory, pp. 603–619. Available at http://dx.doi.org/10.1007/978-3-642-04081-8_40.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org