38 search results - page 4 / 8 » Refining the SAT decision ordering for bounded model checkin... |
HVC
2005
Springer
14 years 1 months ago
2005
Springer
We present several algorithms for simultaneous SAT (propositional satisfiability) based model checking of safety properties. More precisely, we focus on Bounded Model Checking and ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
ound in BMC by Combining Constant Propagation and Abstraction Roy Armoni, Limor Fix1 , Ranan Fraer1 , Tamir Heyman1,3 , Moshe Vardi2 , Yakir Vizel1 , Yael Zbar1 1 Logic and Validat...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...