Specification and verification of concurrent programs by ∀-automata
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 124-164
- https://doi.org/10.1007/3-540-51803-7_24
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Countable nondeterminism and random assignmentJournal of the ACM, 1986
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairnessJournal of the ACM, 1986
- A proof rule for fair termination of guarded commandsInformation and Control, 1985
- Modalities for model checking (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- Adequate proof principles for invariance and liveness properties of concurrent programsScience of Computer Programming, 1984
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- Myths about the mutual exclusion problemInformation Processing Letters, 1981
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967