TLA + proofs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7436 LNCS, Issue , 2012, Pages 147-154

  Cousineau, Denis ^a   Doligez, Damien ^a   Lamport, Leslie ^b   Merz, Stephan ^c   Ricketts, Daniel ^d   Vanzetto, Hernán ^c  

^a INRIA   (France)

^b MICROSOFT RESEARCH   (United States)

^c LORIA   (France)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PETERSON'S MUTUAL EXCLUSION ALGORITHM; PROOF SYSTEM;

ARTIFICIAL INTELLIGENCE;

SPECIFICATION LANGUAGES;

EID: 84865982164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32759-9_14     Document Type: Conference Paper

References (15)

1. Balser, M., Reif, W., Schellhorn, G., Stenzel, K., Thums, A.: Formal System Development with KIV. In: Maibaum, T. (ed.) FASE 2000. LNCS, vol. 1783, pp. 363-366. Springer, Heidelberg (2000)
2. Bonichon, R., Delahaye, D., Doligez, D.: Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 151-165. Springer, Heidelberg (2007)
3. + Proof System. In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 142-148. Springer, Heidelberg (2010)
4. Lamport, L.: What good is temporal logic? In: Mason, R.E.A. (ed.) Information Processing 1983. IFIP, pp. 657-668, North-Holland, Paris (September 1983)
5. Lamport, L.: Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley (2003)
6. Lamport, L.: The PlusCal Algorithm Language. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 36-60. Springer, Heidelberg (2009)
7. Lamport, L.: Byzantizing Paxos by refinement (2011), http://research. microsoft.com/en-us/um/people/lamport/pubs/web-byzpaxos.pdf
8. Lamport, L.: How to write a 21st century proof. Journal of Fixed Point Theory and Applications (March 2012), doi:10.1007/s11784-012-0071-6
9. Lu, T., Merz, S., Weidenbach, C.: Towards Verification of the Pastry Protocol Using TLA+. In: Bruni, R., Dingel, J. (eds.) FORTE 2011 and FMOODS 2011. LNCS, vol. 6722, pp. 244-258. Springer, Heidelberg (2011)
10. + Proof Obligations with SMT Solvers. In: Bjørner, N., Voronkov, A. (eds.) LPAR-18 2012. LNCS, vol. 7180, pp. 289-303. Springer, Heidelberg (2012)
11. Parno, B., Lorch, J.R., Douceur, J.R., Mickens, J., McCune, J.M.: Memoir: Practical state continuity for protected modules. In: Security and Privacy, pp. 379-394. IEEE (2011)
12. Peterson, G.L.: Myths about the mutual exclusion problem. Inf. Process. Lett. 12(3), 115-116 (1981)
13. The TLAPS Project. Web page, http://msr-inria.inria.fr/-doligez/tlaps/
14. Wenzel, M., Paulson, L.C., Nipkow, T.: The Isabelle Framework. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 33-38. Springer, Heidelberg (2008)
15. Wiedijk, F. (ed.): The Seventeen Provers of the World. LNCS (LNAI), vol. 3600. Springer, Heidelberg (2006)