1018 search results - page 28 / 204 » Abstraction and Refinement in Model Checking |
CAV
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
ATVA
2009
Springer
14 years 2 months ago
2009
Springer
This paper studies abstraction and refinement techniques in the setting of multi-valued model checking for the μ-calculus. Two dimensions of abstrace identified and studied: Abs...
CBSE
2008
Springer
13 years 9 months ago
2008
Springer
Current software component models insufficiently reflect the different stages of component life-cycle, which involves design, implementation, deployment, and runtime. Therefore, re...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract A new unfolding approach to LTL model checking is presented, in which the model checking problem can be solved by direct inspection of a certain finite prefix. The techniq...