Verification of Distributed Erlang Programs using Testing, Model Checking and Theorem Proving
Doktorsavhandling, 2008
distributed algorithms
fault-tolerance
theorem proving
verification
distributed programming
Erlang
model checking
testing
Författare
Hans Svensson
Chalmers, Data- och informationsteknik, Datavetenskap
Finding Counter Examples in Induction Proofs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),;(2008)
Paper i proceeding
Semi-Formal Development of a Fault-Tolerant Leader Election Protocol in Erlang
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),;Vol. 3395(2005)p. 140-154
Artikel i vetenskaplig tidskrift
A More Accurate Semantics for Distributed Erlang
Proceedings of the ACM SIGPLAN 2007 Erlang Workshop,;(2007)p. 43-54
Paper i proceeding
A New Leader Election Implementation
Proceedings of the ACM SIGPLAN 2005 Erlang Workshop,;(2005)
Paper i proceeding
McErlang: A Model Checker for a Distributed Functional Programming Language
Proc. of International Conference on Functional Programming (ICFP),;(2007)p. 125-136
Paper i proceeding
Ämneskategorier
Programvaruteknik
ISBN
978-91-7385-096-4
Technical report D - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University: 38D
Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie: 2777
HC1, Hörsalsvägen 14
Opponent: Prof. Jaco van de Pol, Formal Methods and Tools, Universiteit Twente, The Netherlands