Static analysis via abstract interpretation of the happens-before memory model

Authors:
Pietro Ferrara
Affiliations:
École Polytechnique, Palaiseau, France and Dipartimento di Informatica, Università Ca' Foscari di Venezia, Venezia, Italy
Venue:
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Year:
2008

Citing 16
Cited 5

What are race conditions?: Some issues and formalizations

ACM Letters on Programming Languages and Systems (LOPLAS)
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Java Virtual Machine Specification

Java Virtual Machine Specification
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Specifying multithreaded Java semantics for program verification

Proceedings of the 24th International Conference on Software Engineering
A formal model of the java multi-threading system and its validation on a known problem

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
The Java memory model

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Software and the Concurrency Revolution

Queue - Multiprocessors
The octagon abstract domain

Higher-Order and Symbolic Computation
A theory of memory models

Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
MMC: the Mono Model Checker

Electronic Notes in Theoretical Computer Science (ENTCS)
The java memory model: operationally, denotationally, axiomatically

ESOP'07 Proceedings of the 16th European conference on Programming
Causal dataflow analysis for concurrent programs

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Toward a grainless semantics for shared-variable concurrency

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
A memory model sensitive checker for c#

FM'06 Proceedings of the 14th international conference on Formal Methods

State-space exploration for concurrent algorithms under weak memory orderings: (preliminary version)

ACM SIGARCH Computer Architecture News
Static analysis of run-time errors in embedded critical parallel C programs

ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Types for relaxed memory models

TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
Soundness of data flow analyses for weak memory models

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Java memory model-aware model checking

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Memory models define which executions of multithreaded programs are legal. This paper formalises in a fixpoint form the happens-before memory model, an over-approximation of the Java one, and it presents a static analysis using abstract interpretation. Our approach is completely independent of both the programming language and the analysed property. It also appears to be a promising framework to define, compare and statically analyse other memory models.