Sökning: id:"swepub:oai:DiVA.org:uu-333506" >
Comparing source se...
Comparing source sets and persistent sets for partial order reduction
-
- Abdulla, Parosh (författare)
- Uppsala universitet,Datorteknik
-
- Aronis, Stavros (författare)
- Uppsala universitet,Datalogi,Programming Languages
-
- Jonsson, Bengt (författare)
- Uppsala universitet,Datorteknik
-
visa fler...
-
- Sagonas, Konstantinos (författare)
- Uppsala universitet,Datalogi,Programming Languages
-
visa färre...
-
(creator_code:org_t)
- 2017-07-25
- 2017
- Engelska.
-
Ingår i: Models, Algorithms, Logics and Tools. - Cham : Springer. - 9783319631202 - 9783319631219 ; , s. 516-536
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- vet (ämneskategori)
- kap (ämneskategori)
Hitta via bibliotek
Till lärosätets databas