liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures
Uppsala University, Sweden.
Uppsala University, Sweden.
Brno University of Technology, Czech Republic.
Uppsala University, Sweden.
Vise andre og tillknytning
2013 (engelsk)Inngår i: The 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2013), Rome, Italy, March 16-24, 2013. / [ed] Piterman, Nir, Smolka, Scott, 2013Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

We present a technique for automatically verifying safety properties of concurrent programs, in particular programs which 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.

sted, utgiver, år, opplag, sider
2013.
Serie
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-92595DOI: 10.1007/978-3-642-36742-7_23ISI: 000435018600024ISBN: 978-3-642-36742-7 (tryckt)OAI: oai:DiVA.org:liu-92595DiVA, id: diva2:621304
Konferanse
TACAS'13
Tilgjengelig fra: 2013-05-14 Laget: 2013-05-14 Sist oppdatert: 2019-07-03

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Rezine, Ahmed

Søk i DiVA

Av forfatter/redaktør
Rezine, Ahmed
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 844 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf