Comparing Source Sets and Persistent Sets for Partial Order Reduction

Autor:	Konstantinos Sagonas, Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson
Rok vydání:	2017
Předmět:	Theoretical computer science Partial order reduction Basis (linear algebra) Computer science 020204 information systems 0202 electrical engineering electronic engineering information engineering 020207 software engineering 02 engineering and technology
Zdroj:	Lecture Notes in Computer Science ISBN: 9783319631202 Models, Algorithms, Logics and Tools
Popis:	Partial order reduction has traditionally been based on persistent sets, ample sets, stubborn sets, or variants thereof. Recently, we have presented a strengthening of this foundation, using source sets instead of persistent/ample/stubborn sets. Source sets subsume persistent sets and are often smaller than persistent sets. We introduced source sets as a basis for Dynamic Partial Order Reduction (DPOR), in a framework which assumes that processes are deterministic and that all program executions are finite. In this paper, show how to use source sets for partial order reduction in a framework which does not impose these restrictions. We also compare source sets with persistent sets, providing some insights into conditions under which source sets and persistent sets do or do not differ.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::ff5ea2db1b3d82f48c0e7e5142985f58 https://doi.org/10.1007/978-3-319-63121-9_26 Zobrazit plný text záznamu