Sciweavers

76 search results - page 10 / 16
» Efficient reachability checking using sequential SAT
Sort
View
FORMATS
2006
Springer
14 years 1 months ago
Extended Directed Search for Probabilistic Timed Reachability
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
Husain Aljazzar, Stefan Leue
CAV
2007
Springer
114views Hardware» more  CAV 2007»
14 years 1 months ago
Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis
In automatic software verification, we have observed a theoretical convergence of model checking and program analysis. In practice, however, model checkers are still mostly concern...
Dirk Beyer, Thomas A. Henzinger, Grégory Th...
ITC
2003
IEEE
148views Hardware» more  ITC 2003»
14 years 3 months ago
HyAC: A Hybrid Structural SAT Based ATPG for Crosstalk
As technology evolves into the deep sub-micron era, signal integrity problems are growing into a major challenge. An important source of signal integrity problems is the crosstalk...
Xiaoliang Bai, Sujit Dey, Angela Krstic
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
14 years 6 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz
AAAI
2006
13 years 11 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez