1018 search results - page 116 / 204 » Abstraction and Refinement in Model Checking |
FMICS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
ENTCS
2006
13 years 7 months ago
2006
We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed au...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
IEEEVAST
2010
13 years 2 months ago
2010
The process of learning models from raw data typically requires a substantial amount of user input during the model initialization phase. We present an assistive visualization sys...
SAT
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make two contributions. First, we reformulate clause...