ILF and DAWN for verifying distributed algorithms - An idea for a tool

Fundamenta Informaticae

Volumn 37, Issue 3, 1999, Pages 201-211

  Baar, Thomas ^a   Kindler, Ekkart ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Automated theorem provers; Distributed algorithms; Verification; Z

Indexed keywords

EID: 0039180044     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1999-37301     Document Type: Article

References (16)

1. T. Baar. Formaler Beweis der Korrektheitseigenschaften einer Z-Spezifikation des Alternating-Bit-Protokolls unter Benutzung des Werkzeuges ILF. Masters thesis, Humboldt-Universität zu Berlin, 1997.
2. T. Baar, E. Kindler, and H. Völzer. Verifying Intuition: ILF checks DAWN proofs. Accepted for International Conference on Application and Theory of Petri Nets, Williamsburg, June 1999.
3. Jörg Desel and Ekkart Kindler. Proving correctness of distributed algorithms using high-level Petri nets - a case study. In 1998 International Conference on Application of Concurrency to System Design, pp. 177-186, Fukushima, Japan, March 1998. IEEE Computer Society Press.
4. B. I. Dahn, A. Wolf. Natural Language Presentation and Combination of Automatically Generated Proofs. In Proc. FroCoS'96, pp. 175-192, Kluwer, 1996.
5. B. I. Dahn, J. Gehne, Th. Honigmann, A. Wolf. Integration of Automated and Interactive Theorem Proving in ILF. In Proc. CADE-14, pp. 57-60, Springer, 1997.
6. J. Denzinger, M. Kronenburg, S. Schulz. DISCOUNT. A Distributed and Learning Equational Prover. In Journal of Automated Reasoning 18(2), pp. 189-198, 1997.
7. C. Goller, R. Letz, K. Mayr, J. Schumann. SETHEO V3.2: Recent Developments (System Abstract). In Proc. CADE-12, pp. 778-782, Springer, 1994.
8. Ekkart Kindler and Wolfgang Reisig. Algebraic system nets for modelling distributed algorithms. Petri Net Newsletter, 51:16-31, December 1996.
9. Ekkart Kindler and Wolfgang Reisig. Verification of distributed algorithms with algebraic Petri nets. In C. Freksa, M. Jantzen, and R. Valk, editors, Foundations of Computer Science: Potential - Theory - Cognition,LNCS 1337, pp. 261-270. Springer, 1997.
10. Ekkart Kindler, Wolfgang Reisig, Hagen Völzer, and Rolf Walter. Petri net based verification of distributed algorithms: An example. Formal Aspects of Computing, 9:409-424, 1997.
11. th International Conference, LNCS 1420, pp. 345-364, Springer, June 1998.
12. C. S. Mellish. Implementing Systemic Classification by Unification. Comp. Ling. 14, 1988, pp. 40-51
13. Wolfgang Reisig. Petri nets and algebraic specifications. Theoretical Computer Science, 80:1-34, May 1991.
14. Wolfgang Reisig. Elements of Distributed Algorithms - Modeling and Analysis with Petri Nets. Springer-Verlag, 1998.
15. M. Weber, R. Walter, H. Völzer, T. Vesper, W. Reisig, S. Peuker, E. Kindler, J. Freiheit, and J. Desel. DAWN: Petrinetzmodelle zur Verifikation Verteilter Algorithmen. Informatik-Bericht 88, Humboldt-Universität zu Berlin, December 1997.
16. C. Weidenbach, B. Gaede, G. Rock. SPASS & FLOTTER, Version 0.42. In Proc. CADE-13, pp. 141-145, Springer, 1996.