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
Counter-Example Guided Fence Insertion under TSO
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
Vise andre og tillknytning
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. s. 204-219
Serie
Lecture Notes in Computer Science ; 7214
HSV kategori
Identifikatorer
URN: urn:nbn:se:uu:diva-175078DOI: 10.1007/978-3-642-28756-5_15ISBN: 978-3-642-28755-8 (tryckt)OAI: oai:DiVA.org:uu-175078DiVA, id: diva2:530090
Konferanse
TACAS 2012
Prosjekter
UPMARCWeak Memory ModelsTilgjengelig fra: 2012-03-22 Laget: 2012-05-31 Sist oppdatert: 2018-01-12bibliografisk kontrollert
Inngår i avhandling
1. Verification of Software under Relaxed Memory
Åpne denne publikasjonen i ny fane eller vindu >>Verification of Software under Relaxed Memory
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
verification, relaxed memory models
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
urn:nbn:se:uu:diva-297201 (URN)978-91-554-9616-6 (ISBN)
Eksternt samarbeid:
Disputas
2016-09-07, 2446, Polacksbacken, Lägerhyddsvägen 2, Uppsala, 13:15 (engelsk)
Opponent
Veileder
Prosjekter
UPMARC
Tilgjengelig fra: 2016-08-17 Laget: 2016-06-22 Sist oppdatert: 2018-01-10

Open Access i DiVA

fulltext(518 kB)196 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 518 kBChecksum SHA-512
05477bd437c6bd5cca6f57197e48846faf790903ada2fc3b1e527b4c5bc235169a6ba257bfc839321099299208724f225c81bc36247e73f9b999cc5c58a90a0f
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekst

Personposter BETA

Abdulla, Parosh AzizAtig, Mohamed FaouziLeonardsson, Carl

Søk i DiVA

Av forfatter/redaktør
Abdulla, Parosh AzizAtig, Mohamed FaouziLeonardsson, Carl
Av organisasjonen

Søk utenfor DiVA

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

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 1341 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