ILF and DAWN for Verifying Distributed Algorithms - An Idea for a Tool

Authors:
Thomas Baar;Ekkart Kindler
Affiliations:
(Supported by the DFG: Project ‘Deduktion für Fremdnutzer' within the ‘Schwerpunktprogramm Deduktion') Institut für Informatik, Humboldt-Universität zu Berlin, D-10099 B ...;(Correspd.) (Supported by the DFG: Projects ‘Petri Net Technology' and ‘Datenkonsistenzkriterien') Institut für Informatik, Humboldt-Universität zu Berlin, D-10099 Berlin, Ge ...
Venue:
Fundamenta Informaticae
Year:
1999

Citing 11
Cited 0

Implementing systemic classification by unification

Computational Linguistics
Petri nets and algebraic specifications

Theoretical Computer Science
Elements of distributed algorithms: modeling and analysis with Petri nets

Elements of distributed algorithms: modeling and analysis with Petri nets
DISCOUNT - A Distributed and Learning Equational Prover

Journal of Automated Reasoning
Verification of Distributed Algorithms with Algebraic Petri Nets

Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Flexibility in Algebraic Nets

ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Verifying Intuition - ILF Checks DAWN Proofs

Proceedings of the 20th International Conference on Application and Theory of Petri Nets
SPASS & FLOTTER Version 0.42

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Integration of Automated and Interactive Theorem Proving in ILP

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
SETHEO V3.2: Recent Developments - System Abstract

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Proving Correctness of Distributed Algorithms Using High-Level Petri Nets - A Case Study

CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Distributed Algorithms Working Notation (DAWN) was designed for modelling and verifying algorithms in an intuitive way. Nevertheless, DAWN proofs are formal. In this paper, we show that it is possible to check correctness of a DAWN proof fully automatically: For each step in a DAWN proof, we can generate a set of proof obligations which can automatically be checked by help of automated theorem provers. The verification tool ILF provides a uniform interface to many theorem provers—which makes it an ideal partner for DAWN and a basis for building a DAWN-tool.