On verifying that a concurrent program satisfies a nondeterministic specification
- 3 July 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 32 (1) , 17-23
- https://doi.org/10.1016/0020-0190(89)90063-x
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Hierarchical correctness proofs for distributed algorithmsPublished by Association for Computing Machinery (ACM) ,1987
- Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairnessJournal of the ACM, 1986
- Specifying Concurrent Program ModulesACM Transactions on Programming Languages and Systems, 1983