Contessa: Concurrency testing augmented with symbolic analysis

13Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Testing of multi-threaded programs poses enormous challenges. To improve the coverage of testing, we present a framework named Contessa that augments conventional testing (concrete execution) with symbolic analysis in a scalable and efficient manner to explore both thread interleaving and input data space. It is built on partial-order reduction techniques that generate verification conditions with reduced size and search space. It also provides a visual support for debugging the witness traces. We show its significance in testbeds. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Kundu, S., Ganai, M. K., & Wang, C. (2010). Contessa: Concurrency testing augmented with symbolic analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6174 LNCS, pp. 127–131). https://doi.org/10.1007/978-3-642-14295-6_13

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