942 search results - page 115 / 189 » Cooperating Constraint Solvers |
119
click to vote
PTS
2010
14 years 7 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
149
click to vote
SAT
2011
Springer
14 years 20 days ago
2011
Springer
Failed literal detection (FL) in SAT is a powerful approach for preprocessing. The basic idea is to assign a variable as assumption. If boolean constraint propagation (BCP) yields ...
ISSTA
2009
ACM
15 years 4 months ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
KBSE
2007
IEEE
15 years 4 months ago
2007
IEEE
We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling (ORM) language. ORM is a popular conceptual modeling language, prim...
142
click to vote
POPL
2011
ACM
14 years 20 days ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...