BDD-Based debugging of designs using language containment and fair CTL
Authors:
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 41-58
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Efficient ω-regular language containment1993
- A verification strategy for timing constrained systems1993
- Timing verification by successive approximation1993
- A unified approach to language containment and fair CTL model checking1993
- Analysis of discrete event coordinationLecture Notes in Computer Science, 1990
- Modalities for model checking: branching time logic strikes backScience of Computer Programming, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986