53 search results - page 4 / 11 » Minimization of Counterexamples in SPIN |
ICFEM
2009
Springer
14 years 4 months ago
2009
Springer
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...
CAV
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
JSYML
2006
13 years 9 months ago
2006
We prove conjugacy and generic disjointness of generous Carter subgroups in groups of finite Morley rank. We elaborate on groups with a generous Carter subgroup and on a minimal c...
FORTE
2003
13 years 11 months ago
2003
We present a new, on-the-fly algorithm that given a push-down model representing a sequential program with (recursive) procedure calls and an extended finite-state automaton repr...