2010 | OriginalPaper | Chapter
Contessa: Concurrency Testing Augmented with Symbolic Analysis
Authors : Sudipta Kundu, Malay K. Ganai, Chao Wang
Published in: Computer Aided Verification
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.