Sökning: id:"swepub:oai:DiVA.org:uu-253647" >
Precise and sound a...
Precise and sound automatic fence insertion procedure under PSO
-
- Abdulla, Parosh Aziz (författare)
- Uppsala universitet,Datorteknik
-
- Atig, Mohamed Faouzi (författare)
- Uppsala universitet,Datorteknik
-
Lång, Magnus (författare)
-
visa fler...
-
- Ngo, Tuan Phong (författare)
- Uppsala universitet,Datorteknik
-
visa färre...
-
(creator_code:org_t)
- 2016-03-23
- 2015
- Engelska.
-
Ingår i: Networked Systems. - Cham : Springer. - 9783319268491 ; , s. 32-47
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We give a sound and complete procedure for fence insertion for concurrent finite-state programs running under the PSO memory model. This model allows ''write to read'' and ''write-to-write'' relaxations corresponding to the addition of an unbounded store buffers between processors and the main memory. We introduce a novel machine model, called the Hierarchical Single-Buffer (HSB) semantics, and show that the reachability problem for a program under PSO can be reduced to the reachability problem under HSB. We present a simple and effective backward reachability analysis algorithm for the latter, and propose a counter-example guided fence insertion procedure. The procedure infers automatically a minimal set of fences that ensure correctness of the program. We have implemented a prototype and run it successfully on all standard benchmarks, together with several challenging examples.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- PSO
- weak memory model
- well-quasi order
- well-structured transition system
- concurrent program
- verification
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas