On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony
Authors:
Open Access
- 18 July 2018
- book chapter
- Published by Springer Nature
- p. 372-391
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Reachability Analysis of Communicating Pushdown SystemsLogical Methods in Computer Science, 2012
- One Stack to Run Them All2010
- Reducing Concurrent Analysis Under a Context Bound to Sequential AnalysisLecture Notes in Computer Science, 2008
- Context-Bounded Analysis of Concurrent Queue Systems2008
- Verification of programs with half-duplex communicationInformation and Computation, 2005
- Context-Bounded Model Checking of Concurrent Software2005
- Language primitives and type discipline for structured communication-based programming1998
- Verifying Programs with Unreliable ChannelsInformation and Computation, 1996
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- The serializability of concurrent database updatesJournal of the ACM, 1979