Sciweavers

2861 search results - page 315 / 573
» Constraint Programming
Sort
View
SIGSOFT
2003
ACM
16 years 7 months ago
Consistency techniques for interprocedural test data generation
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 ...
Nguyen Tran Sy, Yves Deville
ICALP
2009
Springer
16 years 1 months ago
A Better Algorithm for Random k-SAT
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...
Amin Coja-Oghlan
TACAS
2007
Springer
141views Algorithms» more  TACAS 2007»
16 years 19 days ago
JPF-SE: A Symbolic Execution Extension to Java PathFinder
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...
Saswat Anand, Corina S. Pasareanu, Willem Visser
CP
2003
Springer
15 years 11 months ago
Semi-independent Partitioning: A Method for Bounding the Solution to COP's
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
David Larkin
WSC
2001
15 years 8 months ago
Chessboard distributions
We review chessboard distributions for modeling partially specified finite-dimensional random vectors. Chessboard distributions can match a given set of marginals, a given covaria...
Soumyadip Ghosh, Shane G. Henderson