A hierarchy of temporal properties (invited paper, 1989)
- 1 August 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 377-410
- https://doi.org/10.1145/93385.93442
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Verifying temporal properties without temporal logicACM Transactions on Programming Languages and Systems, 1989
- Recognizing safety and livenessDistributed Computing, 1987
- Specification and verification of concurrent programs by A ∀ automataPublished by Association for Computing Machinery (ACM) ,1987
- Adequate proof principles for invariance and liveness properties of concurrent programsScience of Computer Programming, 1984
- How to cook a temporal proof system for your pet languagePublished by Association for Computing Machinery (ACM) ,1983
- Temporal logic can be more expressiveInformation and Control, 1983
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- Propositional dynamic logic of looping and converse is elementarily decidableInformation and Control, 1982
- On ω-regular setsInformation and Control, 1979
- Decision problems forω-automataTheory of Computing Systems, 1969