Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Symbolic Partial-Order Execution for Testing Multi-Threaded Programs

: Schemmel, D.; Büning, J.; Rodríguez, C.; Laprell, D.; Wehrle, K.

Fulltext ()

Lahiri, S.K.:
Computer Aided Verification. 32nd International Conference, CAV 2020. Proceedings. Pt.1 : Los Angeles, California, USA, July 21-24 2020
Cham: Springer, 2020 (Lecture Notes in Computer Science 12224)
ISBN: 978-3-030-53287-1
ISBN: 978-3-030-53288-8
International Conference on Computer Aided Verification (CAV) <32, 2020, Online>
European Commission EC
H2020; 647295; SYMBIOSYS
Symbolic Analysis of Temporal and Functional Behavior of Networked Systems
Conference Paper, Electronic Publication
Fraunhofer FKIE ()

We describe a technique for systematic testing of multi-threaded programs. We combine Quasi-Optimal Partial-Order Reduction, a state-of-the-art technique that tackles path explosion due to interleaving non-determinism, with symbolic execution to handle data non-determinism. Our technique iteratively and exhaustively finds all executions of the program. It represents program executions using partial orders and finds the next execution using an underlying unfolding semantics. We avoid the exploration of redundant program traces using cutoff events. We implemented our technique as an extension of KLEE and evaluated it on a set of large multi-threaded C programs. Our experiments found several previously undiscovered bugs and undefined behaviors in memcached and GNU sort, showing that the new method is capable of finding bugs in industrial-size benchmarks.