Sciweavers

819 search results - page 2 / 164
» Using Assumptions to Distribute CTL Model Checking
Sort
View
KBSE
2005
IEEE
14 years 3 months ago
Learning to verify branching time properties
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
Abhay Vardhan, Mahesh Viswanathan
CAV
2010
Springer
282views Hardware» more  CAV 2010»
14 years 1 months ago
A NuSMV Extension for Graded-CTL Model Checking
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
Alessandro Ferrante, Maurizio Memoli, Margherita N...
FM
2001
Springer
142views Formal Methods» more  FM 2001»
14 years 2 months ago
Model-Checking over Multi-valued Logics
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
Marsha Chechik, Steve M. Easterbrook, Victor Petro...
IPPS
2002
IEEE
14 years 2 months ago
An Approach to Compositional Model Checking
A natural trend in most of the engineering disciplines is the construction of systems from components. This has the potential to reduce costs and increase reliability, provided th...
Hector A. Andrade, Beverly Sanders
ATVA
2009
Springer
172views Hardware» more  ATVA 2009»
14 years 4 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