Skip to main content
Article thumbnail
Location of Repository

Soundness of data flow analyses for weak memory models

By Jade Alglave, Daniel Kroening, John Lugton, Vincent Nimal and Michael Tautschnig

Abstract

Abstract. Modern multi-core microprocessors implement weak memory consistency models; programming for these architectures is a challenge. This paper solves a problem open for ten years, and originally posed by Rinard: we identify sufficient conditions for a data flow analysis to be sound w.r.t. weak memory models. We first identify a class of analyses that are sound, and provide a formal proof of soundness at the level of trace semantics. Then we discuss how analyses unsound with respect to weak memory models can be repaired via a fixed point iteration, and provide experimental data on the runtime overhead of this method.

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.6802
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www0.cs.ucl.ac.uk/staff... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.