Sciweavers

80 search results - page 1 / 16
» Tearing based automatic abstraction for CTL model checking
Sort
View
ICCAD
1996
IEEE
86views Hardware» more  ICCAD 1996»
13 years 8 months ago
Tearing based automatic abstraction for CTL model checking
Based Automatic Abstraction for CTL Model Checking Woohyuk Lee Abelardo Pardo Jae-Young Jang Gary Hachtel Fabio Somenzi University of Colorado ECEN Campus Box 425 Boulder, CO, 8030...
Woohyuk Lee, Abelardo Pardo, Jae-Young Jang, Gary ...
DATE
2000
IEEE
76views Hardware» more  DATE 2000»
13 years 9 months ago
Iterative Abstraction-Based CTL Model Checking
Jae-Young Jang, In-Ho Moon, Gary D. Hachtel
ATVA
2009
Springer
172views Hardware» more  ATVA 2009»
13 years 11 months ago
Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
Yang Zhao, Gianfranco Ciardo
DAC
1996
ACM
13 years 8 months ago
State Reduction Using Reversible Rules
We reduce the state explosion problem in automatic verification of finite-state systems by automatically collapsing subgraphs of the aph into abstract states. The key idea of the ...
C. Norris Ip, David L. Dill
CASCON
2001
115views Education» more  CASCON 2001»
13 years 6 months ago
Lightweight reasoning about program correctness
Automated verification tools vary widely in the types of properties they are able to analyze, the complexity of their algorithms, and the amount of necessary user involvement. In ...
Marsha Chechik, Wei Ding