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 …

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 …

Property-based random testing à la QuickCheck requires building efficient generators for
well-distributed random data satisfying complex logical predicates, but writing these …

Property-based random testing (PBRT) is widely used in the functional programming and
verification communities. For testing simple properties, PBRT tools such as QuickCheck can …

We present two novel approaches for automated testing of models written in Alloy–a well-
known declarative, first-order language that is supported by a fully automatic SAT-based …

We introduce targeted property-based testing, an enhanced form of property-based testing
that aims to make the input generation component of a property-based testing tool guided by …

Refactoring engines may have overly strong preconditions preventing developers from
applying useful transformations. We find that 32 percent of the Eclipse and JRRT test suites …

Refactoring is commonly performed manually, supported by regression testing, which serves
as a safety net to provide confidence on the edits performed. However, inadequate test …

Bounded exhaustive testing is an effective methodology for detecting bugs in a wide range
of applications. A well-known approach for bounded exhaustive testing is Korat. It generates …

A large amount of research has been carried out to automate white-box testing. While a wide
range of different and sometimes heterogeneous code-coverage criteria have been …