Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimal dynamic partial order reduction
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Programming Languages)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Programming Languages)
2014 (English)In: Proc. 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New York: ACM Press, 2014, 373-384 p.Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
New York: ACM Press, 2014. 373-384 p.
Series
ACM SIGPLAN NOTICES, ISSN 0362-1340 ; 49:1
National Category
Software Engineering Computer Systems
Identifiers
URN: urn:nbn:se:uu:diva-215414DOI: 10.1145/2535838.2535845ISI: 000331120500032ISBN: 978-1-4503-2544-8 (print)OAI: oai:DiVA.org:uu-215414DiVA: diva2:687063
Conference
POPL 2014, January 22-24, San Diego, CA
Projects
UPMARCRELEASEProFuN
Funder
EU, FP7, Seventh Framework Programme, 287510
Available from: 2014-01-13 Created: 2014-01-13 Last updated: 2015-05-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Abdulla, ParoshAronis, StavrosJonsson, BengtSagonas, Konstantinos
By organisation
Computer SystemsComputing Science
Software EngineeringComputer Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 1002 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf