Sökning: L773:1433 2779 OR L773:1433 2787 >
An integrated speci...
An integrated specification and verification technique for highly concurrent data structures
-
- Aziz Abdulla, Parosh (författare)
- Uppsala University, Sweden
-
- Haziza, Frederic (författare)
- Uppsala University, Sweden
-
- Holik, Lukas (författare)
- Uppsala University, Sweden; Brno University of Technology, Czech Republic
-
visa fler...
-
- Jonsson, Bengt (författare)
- Uppsala University, Sweden
-
- Rezine, Ahmed (författare)
- Linköpings universitet,Programvara och system,Tekniska fakulteten
-
visa färre...
-
(creator_code:org_t)
- 2016-03-16
- 2017
- Engelska.
-
Ingår i: International Journal on Software Tools for Technology Transfer. - : SPRINGER HEIDELBERG. - 1433-2779 .- 1433-2787. ; 19:5, s. 549-563
- Relaterad länk:
-
http://urn.kb.se/res...
-
visa fler...
-
http://uu.diva-porta...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We present a technique for automatically verifying safety properties of concurrent programs, in particular programs that rely on subtle dependencies of local states of different threads, such as lock-free implementations of stacks and queues in an environment without garbage collection. Our technique addresses the joint challenges of infinite-state specifications, an unbounded number of threads, and an unbounded heap managed by explicit memory allocation. Our technique builds on the automata-theoretic approach to model checking, in which a specification is given by an automaton that observes the execution of a program and accepts executions that violate the intended specification. We extend this approach by allowing specifications to be given by a class of infinite-state automata. We show how such automata can be used to specify queues, stacks, and other data structures, by extending a data-independence argument. For verification, we develop a shape analysis, which tracks correlations between pairs of threads, and a novel abstraction to make the analysis practical. We have implemented our method and used it to verify programs, some of which have not been verified by any other automatic method before.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Verification; Pointer programs; Explicit memory allocation; Queue; Stack; Unbounded; Concurrency; Specification; Linearizability
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas