493 search results - page 57 / 99 » Bounded LTL Model Checking with Stable Models |
LICS
2006
IEEE
14 years 4 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
JAIR
2011
13 years 28 days ago
2011
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
DATE
2008
IEEE
14 years 4 months ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
ENTCS
2007
13 years 10 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
ACMSE
2010
ACM
13 years 8 months ago
2010
ACM
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...