Efficient local correctness checking
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- Linear and branching structures in the semantics and logics of reactive systemsPublished by Springer Nature ,2005
- Introduction to the ISO specification language LOTOSPublished by Elsevier ,2003
- Submodule construction as equation solving in CCSTheoretical Computer Science, 1989
- A note on model checking the modal v-calculusPublished by Springer Nature ,1989
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- The temporal logic of branching timeActa Informatica, 1983
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- Results on the propositional μ-calculusPublished by Springer Nature ,1982
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955