A proof of burns N-process mutual exclusion algorithm using abstraction
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 409-423
- https://doi.org/10.1007/bfb0054186
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- UPPAAL — a tool suite for automatic verification of real-time systemsPublished by Springer Nature ,1996
- Combining model checking and deduction for I/O- automataPublished by Springer Nature ,1995
- Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem provingPublished by Springer Nature ,1995
- Property preserving abstractions for the verification of concurrent systemsFormal Methods in System Design, 1995
- Larch: Languages and Tools for Formal SpecificationPublished by Springer Nature ,1993
- Model checking and abstractionPublished by Association for Computing Machinery (ACM) ,1992
- Analysis of discrete event coordinationPublished by Springer Nature ,1990
- Verifying properties of large sets of processes with network invariantsLecture Notes in Computer Science, 1990
- A structural induction theorem for processesPublished by Association for Computing Machinery (ACM) ,1989
- Hierarchical correctness proofs for distributed algorithmsPublished by Association for Computing Machinery (ACM) ,1987