License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2015.456
URN: urn:nbn:de:0030-drops-53637
URL: http://drops.dagstuhl.de/opus/volltexte/2015/5363/
Go to the corresponding LIPIcs Volume Portal


Rodríguez, César ; Sousa, Marcelo ; Sharma, Subodh ; Kroening, Daniel

Unfolding-based Partial Order Reduction

pdf-format:
3.pdf (0.6 MB)


Abstract

Partial order reduction (POR) and net unfoldings are two alternative methods to tackle state-space explosion caused by concurrency. In this paper, we propose the combination of both approaches in an effort to combine their strengths. We first define, for an abstract execution model, unfolding semantics parameterized over an arbitrary independence relation. Based on it, our main contribution is a novel stateless POR algorithm that explores at most one execution per Mazurkiewicz trace, and in general, can explore exponentially fewer, thus achieving a form of super-optimality. Furthermore, our unfolding-based POR copes with non-terminating executions and incorporates state caching. On benchmarks with busy-waits, among others, our experiments show a dramatic reduction in the number of executions when compared to a state-of-the-art DPOR.

BibTeX - Entry

@InProceedings{rodrguez_et_al:LIPIcs:2015:5363,
  author =	{C{\'e}sar Rodr{\'i}guez and Marcelo Sousa and Subodh Sharma and Daniel Kroening},
  title =	{{Unfolding-based Partial Order Reduction}},
  booktitle =	{26th International Conference on Concurrency Theory (CONCUR 2015)},
  pages =	{456--469},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-91-0},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{42},
  editor =	{Luca Aceto and David de Frutos Escrig},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5363},
  URN =		{urn:nbn:de:0030-drops-53637},
  doi =		{10.4230/LIPIcs.CONCUR.2015.456},
  annote =	{Keywords: Partial order reduction, unfoldings, concurrency, model checking}
}

Keywords: Partial order reduction, unfoldings, concurrency, model checking
Seminar: 26th International Conference on Concurrency Theory (CONCUR 2015)
Issue Date: 2015
Date of publication: 25.08.2015


DROPS-Home | Fulltext Search | Imprint Published by LZI