Research on software testing produces many innovative automated techniques, but
because software testing is by necessity incomplete and approximate, any new technique …

SAT and SMT solvers have automated a spectrum of programming tasks, including program
synthesis, code checking, bug localization, program repair, and programming with oracles …

The continued development of efficient automated decision procedures has spurred the
resurgence of research on symbolic execution over the past decade. Researchers have …

A fundamental question in software testing research is how to compare test suites, often as a
means for comparing test-generation techniques. Researchers frequently compare test …

Several promising techniques have been proposed to automate different tasks in software
testing, such as test data generation for object-oriented software. However, reported studies …

Expressing class specifications via executable constraints is important for various software
engineering tasks such as test generation, bug finding and automated debugging, but …

The last decade has seen a dramatic growth in the use of constraint solvers as a
computational mechanism, not only for analysis of software, but also at runtime. Solvers are …

The rising popularity of declarative languages and the hard to debug nature thereof have
motivated the need for applicable, automated repair techniques for such languages …

Despite the recent improvements in automatic test case generation, handling complex data
structures as test inputs is still an open problem. Search-based approaches can generate …

Many modern automated test generators are based on either meta-heuristic search
techniques or use constraint solvers. Both approaches have their advantages, but they also …