About: Compositional Verification of Compiler Optimisations on Relaxed Memory

Not logged in : Login

(Sponging disallowed)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Compositional Verification of Compiler Optimisations on Relaxed Memory Goto Sponge Distinct Permalink

An Entity of Type : bibo:AcademicArticle, within Data Space : linkeddata.uriburner.com:28898 associated with source document(s)

Attributes	Values
type	http://eprints.org/ontology/ConferenceItemEPrint http://eprints.org/ontology/EPrint Article Academic Article
seeAlso	HTML Summary of #66630 Compositional Verification of Compiler Optimisations on Relaxed Memory
sameAs	Compositional Verification of Compiler Optimisations on Relaxed Memory
http://eprints.org/ontology/hasAccepted	Compositional Verification of Compiler Optimisations on Relaxed Memory (PDF)
http://eprints.org/ontology/hasDocument	Compositional Verification of Compiler Optimisations on Relaxed Memory (PDF) Compositional Verification of Compiler Optimisations on Relaxed Memory (Other) Compositional Verification of Compiler Optimisations on Relaxed Memory (Other) Compositional Verification of Compiler Optimisations on Relaxed Memory (Other) Compositional Verification of Compiler Optimisations on Relaxed Memory (Other) Compositional Verification of Compiler Optimisations on Relaxed Memory (Other)
dc:hasVersion	Compositional Verification of Compiler Optimisations on Relaxed Memory (PDF)
Title	Compositional Verification of Compiler Optimisations on Relaxed Memory
described by	https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3
Date	2018-04-14
Creator	Alexey Gotsman Mike Dodds Mark Batty
status	peer reviewed published
Publisher	Springer
abstract	This paper is about verifying program transformations on an axiomatic relaxed memory model of the kind used in C/C++ and Java. Relaxed models present particular challenges for verifying program transformations, because they generate many additional modes of interaction between code and context. For a block of code being transformed, we define a denotation from its behaviour in a set of representative contexts. Our denotation summarises interactions of the code block with the rest of the program both through local and global variables, and through subtle synchronisation effects due to relaxed memory. We can then prove that a transformation does not introduce new program behaviours by comparing the denotations of the code block before and after. Our approach is compositional: by examining only representative contexts, transformations are verified for any context. It is also fully abstract, meaning any valid transformation can be verified. We cover several tricky aspects of C/C++-style memory models, including release-acquire operations, sequentially consistent fences, and non-atomics. We also define a variant of our denotation that is finite at the cost of losing full abstraction. Based on this variant, we have implemented a prototype verification tool and app
Is Part Of	Financial Cryptography and Data Security https://kar.kent.ac.uk/id/repository
Subject	QA 75 Electronic computers. Computer science
list of authors	https://kar.kent.ac.uk/id/eprint/66630#authors
presented at	ESOP 2018
volume	10801
is topic of	https://www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3
is primary topic of	HTML Summary of #66630 Compositional Verification of Compiler Optimisations on Relaxed Memory

Faceted Search & Find service v1.17_git149 as of Dec 03 2024

Alternative Linked Data Documents: iSPARQL | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Aug 25 2024, on Linux (x86_64-ubuntu_noble-linux-glibc2.38-64), Single-Server Edition (378 GB total memory, 12 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software