uu.seUppsala universitets publikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • 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
Verification of Software under Relaxed Memory
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
2016 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
Abstract [en]

The work covered in this thesis concerns automatic analysis of correctness of parallel programs running under relaxed memory models.

When a parallel program is compiled and executed on a modern architecture, various optimizations may cause it to behave in unexpected ways. In particular, accesses to the shared memory may appear in the execution in the opposite order to how they appear in the control flow of the original program source code. The memory model determines which memory accesses can be reordered in a program on a given system. Any memory model that allows some observable memory access reordering is called a relaxed memory model. The reorderings may cause bugs and make the production of parallel programs more difficult.

In this work, we consider three main approaches to analysis of correctness of programs running under relaxed memory models. An exact analysis for finite state programs running under the TSO memory model (Paper I). This technique is based on the well quasi ordering framework. An over-approximate analysis for integer programs running under TSO (Paper II), based on predicate abstraction combined with a buffer abstraction. Two under-approximate analysis techniques for programs running under the TSO, PSO or POWER memory models (Papers III and IV). The latter two techniques are based on stateless model checking and dynamic partial order reduction.

In addition to determining whether a program is correct under a given memory model, the problem of automatic fence synthesis is also considered. A memory fence is an instruction that can be inserted into a program in order to locally disable some memory access reorderings. The fence synthesis problem is the problem of automatically inferring a minimal set of memory fences which restores sufficient order in a given program to ensure its correctness.

sted, utgiver, år, opplag, sider
Uppsala: Acta Universitatis Upsaliensis, 2016. , s. 102
Serie
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 1387
Emneord [en]
verification, relaxed memory models
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
URN: urn:nbn:se:uu:diva-297201ISBN: 978-91-554-9616-6 (tryckt)OAI: oai:DiVA.org:uu-297201DiVA, id: diva2:941290
Disputas
2016-09-07, 2446, Polacksbacken, Lägerhyddsvägen 2, Uppsala, 13:15 (engelsk)
Opponent
Veileder
Prosjekter
UPMARCTilgjengelig fra: 2016-08-17 Laget: 2016-06-22 Sist oppdatert: 2018-01-10
Delarbeid
1. Counter-Example Guided Fence Insertion under TSO
Åpne denne publikasjonen i ny fane eller vindu >>Counter-Example Guided Fence Insertion under TSO
Vise andre…
2012 (engelsk)Inngår i: Tools and Algorithms for the Construction and Analysis of Systems, Berlin: Springer-Verlag , 2012, s. 204-219Konferansepaper, Publicerat paper (Fagfellevurdert)
sted, utgiver, år, opplag, sider
Berlin: Springer-Verlag, 2012
Serie
Lecture Notes in Computer Science ; 7214
HSV kategori
Identifikatorer
urn:nbn:se:uu:diva-175078 (URN)10.1007/978-3-642-28756-5_15 (DOI)978-3-642-28755-8 (ISBN)
Konferanse
TACAS 2012
Prosjekter
UPMARCWeak Memory Models
Tilgjengelig fra: 2012-03-22 Laget: 2012-05-31 Sist oppdatert: 2018-01-12bibliografisk kontrollert
2. Automatic fence insertion in integer programs via predicate abstraction
Åpne denne publikasjonen i ny fane eller vindu >>Automatic fence insertion in integer programs via predicate abstraction
Vise andre…
2012 (engelsk)Inngår i: Static Analysis, Berlin: Springer-Verlag , 2012, s. 164-180Konferansepaper, Publicerat paper (Fagfellevurdert)
sted, utgiver, år, opplag, sider
Berlin: Springer-Verlag, 2012
Serie
Lecture Notes in Computer Science ; 7460
HSV kategori
Identifikatorer
urn:nbn:se:uu:diva-175079 (URN)10.1007/978-3-642-33125-1_13 (DOI)978-3-642-33124-4 (ISBN)
Eksternt samarbeid:
Konferanse
SAS 2012
Prosjekter
UPMARCWeak Memory Models
Tilgjengelig fra: 2012-09-11 Laget: 2012-05-31 Sist oppdatert: 2018-01-12bibliografisk kontrollert
3. Stateless model checking for TSO and PSO
Åpne denne publikasjonen i ny fane eller vindu >>Stateless model checking for TSO and PSO
Vise andre…
2015 (engelsk)Inngår i: Tools and Algorithms for the Construction and Analysis of Systems: TACAS 2015, Springer Berlin/Heidelberg, 2015, s. 353-367Konferansepaper, Publicerat paper (Fagfellevurdert)
sted, utgiver, år, opplag, sider
Springer Berlin/Heidelberg, 2015
Serie
Lecture Notes in Computer Science ; 9035
HSV kategori
Identifikatorer
urn:nbn:se:uu:diva-251580 (URN)10.1007/978-3-662-46681-0_28 (DOI)978-3-662-46680-3 (ISBN)
Konferanse
TACAS 2015, April 11–18, London, UK
Prosjekter
UPMARC
Tilgjengelig fra: 2015-04-21 Laget: 2015-04-21 Sist oppdatert: 2018-01-11bibliografisk kontrollert
4. Stateless model checking for POWER
Åpne denne publikasjonen i ny fane eller vindu >>Stateless model checking for POWER
2016 (engelsk)Inngår i: Computer Aided Verification: Part II, Springer, 2016, s. 134-156Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

We present the first framework for efficient application of stateless model checking (SMC) to programs running under the relaxed memory model of POWER. The framework combines several contributions. The first contribution is that we develop a scheme for systematically deriving operational execution models from existing axiomatic ones. The scheme is such that the derived execution models are well suited for efficient SMC. We apply our scheme to the axiomatic model of POWER from [8]. Our main contribution is a technique for efficient SMC, called Relaxed Stateless Model Checking (RSMC), which systematically explores the possible inequivalent executions of a program. RSMC is suitable for execution models obtained using our scheme. We prove that RSMC is sound and optimal for the POWER memory model, in the sense that each complete program behavior is explored exactly once. We show the feasibility of our technique by providing an implementation for programs written in C/pthreads.

sted, utgiver, år, opplag, sider
Springer, 2016
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 9780
HSV kategori
Identifikatorer
urn:nbn:se:uu:diva-295424 (URN)10.1007/978-3-319-41540-6_8 (DOI)000387731400008 ()9783319415390 (ISBN)9783319415406 (ISBN)
Konferanse
CAV 2016, July 17–23, Toronto, Canada
Prosjekter
UPMARC
Tilgjengelig fra: 2016-07-13 Laget: 2016-06-07 Sist oppdatert: 2018-01-10bibliografisk kontrollert

Open Access i DiVA

fulltext(783 kB)251 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 783 kBChecksum SHA-512
474a84e5d49ddb6bda858df9de139bbdb1af4e0fa9cee1ab87b08f4a9fcb2ede9a932d8c8a729cd1eb421a54efa98cdef8984e8db57d626dc99839e03367fc10
Type fulltextMimetype application/pdf
Kjøp publikasjonen >>

Personposter BETA

Leonardsson, Carl

Søk i DiVA

Av forfatter/redaktør
Leonardsson, Carl
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 251 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

isbn
urn-nbn

Altmetric

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

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • 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