Sciweavers

11 search results - page 1 / 3
» Incremental CTL Model Checking Using BDD Subsetting
Sort
View
CAV
2012
Springer
231views Hardware» more  CAV 2012»
11 years 7 months ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
ICFEM
2009
Springer
13 years 2 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
ASPDAC
2007
ACM
158views Hardware» more  ASPDAC 2007»
13 years 9 months ago
Symbolic Model Checking of Analog/Mixed-Signal Circuits
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
David Walter, Scott Little, Nicholas Seegmiller, C...
DAC
2003
ACM
13 years 10 months ago
Dos and don'ts of CTL state coverage estimation
Coverage estimation for model checking quantifies the completeness of a set of properties. We present an improved version of the algorithm of Hoskote et al. [7] that applies to a...
Nikhil Jayakumar, Mitra Purandare, Fabio Somenzi