238 search results - page 10 / 48 » Constraint Solving and Symbolic Execution |
ISSTA
2010
ACM
15 years 2 months ago
2010
ACM
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
TACAS
2009
Springer
15 years 5 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
105
Voted
DATESO
2007
15 years 8 days ago
2007
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
119
click to vote
ISSTA
1998
ACM
15 years 3 months ago
1998
ACM
Automatic test data generation leads to identify input values on which a selected point in a procedure is executed. This paper introduces a new method for this problem based on co...
77
Voted
ATAL
2010
Springer
14 years 12 months ago
2010
Springer
In this paper, we extend the traditional formalization of a Distributed Constraint Satisfaction Problems (DisCSP) to a Quantified DisCSP. A Quantified DisCSP includes several unive...