30 search results - page 2 / 6 » Increasing the Robustness of Bounded Model Checking by Compu... |
CONCUR
1997
Springer
13 years 8 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
GLVLSI
2005
IEEE
13 years 10 months ago
2005
IEEE
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
STACS
1994
Springer
13 years 8 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
ICFEM
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...