Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock
Abstract elided by the publisher.
Related papers
- On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem POPL 1981
- Manifest sharing with session types ICFP 2017
- Higher-Order Leak and Deadlock Free Locks POPL 2023
- The Drinking Philosopher's Problem TOPLAS 1984
- A Distributed Deadlock Detection Algorithm for CSP-Like Communication TOPLAS 1990
- Liveness of Randomised Parameterised Systems under Arbitrary Schedulers CAV 2016
- Compressing Transitions for Model Checking CAV 2002
- Improved Model Checking of Hierarchical Systems VMCAI 2010