Whitebox fuzzing is a form of automatic dynamic test generation, based on symbolic
execution and constraint solving, designed for security testing of large applications …

The key design challenges in the construction of a SAT-based relational model finder are
described, and novel techniques are proposed to address them. An efficient model finder …

Refactorings are behavior-preserving program transformations that improve the design of a
program. Refactoring engines are tools that automate the application of refactorings: first the …

We present an approach for describing tests using non-deterministic test generation
programs. To write such programs, we introduce UDITA, a Java-based language with non …

A program can be viewed as a syntactic structure P (syntactic skeleton) parameterized by a
collection of identifiers V (variable names). This paper introduces the skeletal program …

Boolean satisfiability (SAT) solvers have been the subject of remarkable improvements
since the mid 90s. One of the main reasons for these improvements has been the wide …

We present the first verification of full functional correctness for a range of linked data
structure implementations, including mutable lists, trees, graphs, and hash tables …

We present CESE, a tool that combines exhaustive enumeration of test inputs from a
structured domain with symbolic execution driven test generation. We target programs …

Product line-based software engineering is a paradigm that models the commonalities and
variabilities of different applications of a given domain of interest within a unique framework …

Automatic Program Repair (APR) is a practical research topic that studies techniques to
automatically repair programs to fix bugs. Most existing APR techniques are designed for …