Optimal dynamic partial order reduction

Stateless model checking is a powerful technique for program verification, which however suffers from an exponential growth in the number of explored executions. A successful technique for reducing this number, while still maintaining complete coverage, is Dynamic Partial Order Reduction (DPOR). We present a new DPOR algorithm, which is the first to be provably optimal in that it always explores the minimal number of executions. It is based on a novel class of sets, called source sets, which replace the role of persistent sets in previous algorithms. First, we show how to modify an existing DPOR algorithm to work with source sets, resulting in an efficient and simple to implement algorithm. Second, we extend this algorithm with a novel mechanism, called wakeup trees, that allows to achieve optimality. We have implemented both algorithms in a stateless model checking tool for Erlang programs. Experiments show that source sets significantly increase the performance and that wakeup trees incur only a small overhead in both time and space.

Aronis, StavrosUppsala universitet,Datalogi,Programming Languages(Swepub:uu)staar721 (author)
Jonsson, BengtUppsala universitet,Datorteknik(Swepub:uu)bengtjs (author)
Sagonas, KonstantinosUppsala universitet,Datalogi,Programming Languages(Swepub:uu)ksa25356 (author)
Uppsala universitetDatorteknik (creator_code:org_t)

In:Proc. 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesNew York : ACM Press, s. 373-3849781450325448

By the author/editor: Abdulla, Parosh; Aronis, Stavros; Jonsson, Bengt; Sagonas, Konstan ...

About the subject

NATURAL SCIENCES: NATURAL SCIENCES; and Computer and Inf ...; and Software Enginee ...

ENGINEERING AND TECHNOLOGY: ENGINEERING AND ...; and Electrical Engin ...; and Computer Systems

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.