Programming and execution models for parallel bounded exhaustive testing

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

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 testing is a BET approach where developers write test generation programs that describe properties of test inputs. Hybrid test generation programs offer the most expressive way to write desired properties by freely combining declarative filters and imperative generators. However, exploring hybrid test generation programs, to obtain test inputs, is both computationally demanding and challenging to parallelize. We present the first programming and execution models, dubbed Tempo, for parallel exploration of hybrid test generation programs. We describe two different strategies for mapping the computation to parallel hardware and implement them both for GPUs and CPUs. We evaluated Tempo by generating instances of various data structures commonly used for benchmarking in the BET domain. Additionally, we generated CUDA programs to stress test CUDA compilers, finding four bugs confirmed by the developers.

Cite

CITATION STYLE

APA

Awar, N. A., Jain, K., Rossbach, C. J., & Gligoric, M. (2021). Programming and execution models for parallel bounded exhaustive testing. Proceedings of the ACM on Programming Languages, 5(OOPSLA). https://doi.org/10.1145/3485543

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free