Verification of concurrent programs: the automata-theoretic framework*
- 22 March 1991
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 51 (1-2) , 79-98
- https://doi.org/10.1016/0168-0072(91)90066-u
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Verifying temporal properties without temporal logicACM Transactions on Programming Languages and Systems, 1989
- 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
- A proof rule for fair termination of guarded commandsInformation and Control, 1985
- Fair termination revisited—with delayTheoretical Computer Science, 1984
- Proof rules and transformations dealing with fairnessScience of Computer Programming, 1983
- Ten years of Hoare's logic: A survey— part II: NondeterminismTheoretical Computer Science, 1983
- A Weaker Precondition for LoopsACM Transactions on Programming Languages and Systems, 1982
- Ten Years of Hoare's Logic: A Survey—Part IACM Transactions on Programming Languages and Systems, 1981
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974