Undecidable verification problems for programs with unreliable channels
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 316-327
- https://doi.org/10.1007/3-540-58201-0_78
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Deciding bisimulation equivalences for a class of non-finite-state programsPublished by Springer Nature ,2005
- Verifying programs with unreliable channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Model-checking for real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Decidability of bisimulation equivalences for parallel timer processesPublished by Springer Nature ,1993
- Reasoning about systems with many processesJournal of the ACM, 1992
- Data flow analysis of communicating finite state machinesACM Transactions on Programming Languages and Systems, 1991
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- Parallel program schemataJournal of Computer and System Sciences, 1969
- A note on reliable full-duplex transmission over half-duplex linksCommunications of the ACM, 1969