Completing the temporal picture
Open Access
- 1 June 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 83 (1) , 97-130
- https://doi.org/10.1016/0304-3975(91)90041-y
Abstract
No abstract availableKeywords
This publication has 7 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
- 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
- Ten Years of Hoare's Logic: A Survey—Part IACM Transactions on Programming Languages and Systems, 1981
- A combinatorial approach to the theory of ω-automataInformation and Control, 1981
- Soundness and Completeness of an Axiom System for Program VerificationSIAM Journal on Computing, 1978