7092 search results - page 728 / 1419 » Parallelizing constraint programs |
207
click to vote
SIGSOFT
2003
ACM
16 years 7 months ago
2003
ACM
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...
199
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
182
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
239
click to vote
ADAEUROPE
2007
Springer
16 years 1 months ago
2007
Springer
The testing of programs in wireless sensor networks (WSN) is an important means to assure quality but is a challenging process. As pervasive computing has been identified as a not...
155
click to vote
TACAS
2007
Springer
16 years 1 months ago
2007
Springer
We present JPF–SE, an extension to the Java PathFinder Model Checking framework (JPF) that enables the symbolic execution of Java programs. JPF–SE uses JPF to generate and expl...