364 search results - page 20 / 73 » Model checking with Boolean Satisfiability |
106
Voted
LICS
2006
IEEE
15 years 8 months ago
2006
IEEE
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
162
Voted
VLSID
2010
IEEE
15 years 12 days ago
2010
IEEE
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...
131
click to vote
FORMATS
2009
Springer
15 years 9 months ago
2009
Springer
Embedded real-time systems are typically programmed in low-level languages which provide support for event-driven task processing and real-time interrupts. We show that the model c...
120
Voted
COCO
2007
Springer
15 years 8 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
107
click to vote
ENTCS
2008
15 years 2 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...