101 search results - page 8 / 21 » sat 2009 |
138
Voted
ESSLLI
2009
Springer
14 years 11 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
91
Voted
GI
2009
Springer
14 years 11 months ago
2009
Springer
: In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We present three different approaches to this problem:...
107
click to vote
ISCIS
2009
Springer
15 years 8 months ago
2009
Springer
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
103
Voted
ISMVL
2009
IEEE
15 years 8 months ago
2009
IEEE
We define a number of original encodings, called regular encodings, that map Max-CSP instances into Partial MaxSAT instances. First, we obtain new direct and (minimal) support en...
102
click to vote
BIRTHDAY
2009
Springer
15 years 8 months ago
2009
Springer
We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SA...