844 search results - page 14 / 169 » Safraless Decision Procedures |
CADE
2004
Springer
15 years 9 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
VMCAI
2010
Springer
15 years 4 months ago
2010
Springer
90
Voted
TIME
2007
IEEE
15 years 3 months ago
2007
IEEE
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...