English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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

Symbolic Partial-Order Execution for Testing Multi-Threaded Programs