Parallel program design: a foundation
Parallel program design: a foundation
Nonsequential processes
Methods and logics for proving programs
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
How to cook a temporal proof system for your pet language
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Distributed Algorithms for Networks of Agents
Lectures on Petri Nets II: Applications, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Proceedings of the 10th International Conference on Automated Deduction
PROTEIN: A PROver with a Theory Extension INterface
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
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
Petri Nets, Situations, and Automata
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
ILF and DAWN for Verifying Distributed Algorithms - An Idea for a Tool
Fundamenta Informaticae
| Hi-index | 0.00 |
The DAWN approach allows to model and verify distributed algorithms in an intuitive way. At a first glance, a DAWN proof may appear to be informal. In this paper, we argue that DAWN proofs are formal and can be checked for correctness fully automatically by automated theorem provers. The basic technique are proof rules which generate proof obligations. For the definition of the proof rules we adopt assertions and we introduce conflict formulas for algebraic Petri nets. Experiments show that the generated proof obligations can be automatically checked by theorem provers.