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 …

Bounded-exhaustive testing (BET), which exercises a program under test for all inputs up to
some bounds, is an effective method for detecting software bugs. Systematic property-based …

Bounded-exhaustive testing is an automated testing methodology that checks the code
under test for all inputs within given bounds: first the user describes a set of test inputs and …

Embedded software is found everywhere from our highly visible mobile devices to the
confines of our car in the form of smart sensors. Embedded software companies are under …

Property-based random testing, exemplified by frameworks such as Haskell's QuickCheck,
works by testing an executable predicate (a property) on a stream of randomly generated …

Bounded exhaustive input generation (BEG) is an effective approach to reveal software
faults. However, existing BEG approaches require a precise specification of the valid inputs …

We present novel algorithms for parallel testing of code that takes structurally complex test
inputs. The algorithms build on the Korat algorithm for constraint-based generation of …

Bounded exhaustive testing (BET) is a verification technique in which software is
automatically tested for all valid inputs up to specified size bounds. A particularly interesting …

Testing is among the most effective tools available for finding bugs. Still, we know of no
automatic technique for generating test cases that expose bugs involving a combination of …

As product life-cycles become shorter and the scale and complexity of systems increase,
accelerating the execution of large test suites gains importance. Existing research has …