research-article

Types for relaxed memory models

Authors:

Radha Jagadeesan,

James RielyAuthors Info & Claims

TLDI '12: Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation

Pages 25 - 38

https://doi.org/10.1145/2103786.2103791

Published: 28 January 2012 Publication History

Abstract

Multicore computers implementing weak memory models are mainstream, yet type-based analyses of these models remain rare. We help fill this gap. We not only prove the soundness of a type system for a weak execution model, but we also show that interesting properties of that model can be embedded in the types themselves.

We argue that correspondence assertions can be used in a programming discipline that captures happens-before relationships, which are the basis for reasoning about weak memory in Java. This programming discipline is flexible and can be statically enforced. We present several examples from java.util.concurrent and prove the static semantics sound with respect to an execution model based on Java's memory model.

References

[1]

M. Abadi, C. Flanagan, and S. N. Freund. Types for safe locking: Static race detection for Java. TOPLAS, 28 (2): 207--255, 2006.

Digital Library

[2]

S. V. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. Computer, 29 (12): 66--76, 1996.

Digital Library

[3]

J. Alglave, D. Kroening, J. Lugton, V. Nimal, and M. Tautschnig. Soundness of data flow analyses for weak memory models. In APLAS, 2011.

Digital Library

[4]

H.-J. Boehm and S. V. Adve. Foundations of the C++ concurrency memory model. In PLDI'08, pages 68--78, 2008.

Digital Library

[5]

G. Boudol and G. Petri. Relaxed memory models: an operational approach. In POPL, pages 392--403, 2009.

Digital Library

[6]

S. Burckhardt, P. Kothari, M. Musuvathi, and S. Nagarakatte. A randomized scheduler with probabilistic guarantees of finding bugs. In ASPLOS, pages 167--178, 2010.

Digital Library

[7]

P. Cenciarelli, A. Knapp, and E. Sibilio. The Java memory model: Operationally, denotationally, axiomatically. In ESOP, pages 331--346, 2007.

Digital Library

[8]

P. Ferrara. Static analysis via abstract interpretation of the happens-before memory model. In TAP, pages 116--133, 2008.

Digital Library

[9]

C. Flanagan and S. N. Freund. Fasttrack: efficient and precise dynamic race detection. In PLDI, pages 121--133, 2009.

Digital Library

[10]

B. Goetz, T. Peierls, J. Bloch, J. Bowbeer, D. Holmes, and D. Lea. Java Concurrency in Practice. Addison-Wesley Professional, 2005.

Digital Library

[11]

A. D. Gordon and A. Jeffrey. Typing correspondence assertions for communication protocols. Theor. Comput. Sci., 300: 379--409, 2003.

Digital Library

[12]

C. Hawblitzel. Linear types for aliased resources. Technical Report MSR-TR-2005--141, Microsoft Research, 2005.

[13]

A. Igarashi, B. C. Pierce, and P. Wadler. Featherweight Java: a minimal core calculus for Java and GJ. ACM TOPLAS, 23 (3): 396--450, 2001.

Digital Library

[14]

R. Jagadeesan, C. Pitcher, and J. Riely. Generative operational semantics for relaxed memory models. In ESOP, 2010.

Digital Library

[15]

L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess program. IEEE Trans. Comput., 28 (9): 690--691, 1979.

Digital Library

[16]

D. Lea. The JSR-133 cookbook for compiler writers. http://gee.cs.oswego.edu/dl/jmm/cookbook.html, 2008.

[17]

J. M. Lucassen and D. K. Gifford. Polymorphic effect systems. In POPL, pages 47--57, 1988.

Digital Library

[18]

J. Manson, W. Pugh, and S. V. Adve. The Java memory model. In POPL'05, pages 378--391, 2005.

Digital Library

[19]

A. Miné. Static analysis of run-time errors in embedded critical parallel c programs. In ESOP, pages 398--418, 2011.

Digital Library

[20]

V. A. Saraswat. Concurrent constraint-based memory machines: A framework for Java memory models. In ASIAN, 2004.

Digital Library

[21]

J. Sevcík. Program Transformations in Weak Memory Models. PhD, Univ. of Edinburgh, 2008.

[22]

J. Sevcík and D. Aspinall. On validity of program transformations in the Java memory model. In ECOOP, pages 27--51, 2008.

Digital Library

[23]

J. Sevcík, V. Vafeiadis, F. Z. Nardelli, S. Jagannathan, and P. Sewell. Relaxed-memory concurrency and verified compilation. In POPL, 2011.

Digital Library

[24]

P. Sewell. Global/local subtyping and capability inference for a distributed π-calculus. In ICALP'98, LNCS 1443, pages 695--706, 1998.

Digital Library

[25]

R. C. Steinke and G. J. Nutt. A unified theory of shared memory consistency. J. ACM, 51 (5): 800--849, 2004.

Digital Library

[26]

T. Terauchi and A. Aiken. Witnessing side effects. TOPLAS, 30 (3), 2008.

Digital Library

[27]

T. Y. C. Woo and S. S. Lam. Authentication for distributed systems. IEEE Computer, 25: 39--52, January 1992.

Digital Library

[28]

T. Zhao, J. Palsberg, and J. Vitek. Type-based confinement. J. Funct. Program., 16: 83--128, January 2006.

Digital Library

Cited By

Bocchi LMelgratti H(2018)On the behaviour of general purpose applications on cloud storagesService Oriented Computing and Applications10.1007/s11761-014-0165-79:3-4(213-227)Online publication date: 13-Dec-2018
https://dl.acm.org/doi/10.1007/s11761-014-0165-7
Lochbihler A(2018)Mechanising a Type-Safe Model of Multithreaded Java with a Verified CompilerJournal of Automated Reasoning10.1007/s10817-018-9452-x61:1-4(243-332)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s10817-018-9452-x
Jeffrey ARiely JKoskinen EGrohe MShankar N(2016)On Thin Air Reads Towards an Event Structures Model of Relaxed MemoryProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2934536(759-767)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2934536
Show More Cited By

Index Terms

Types for relaxed memory models
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
      1. Semantics
2. Theory of computation
  1. Semantics and reasoning
    1. Program semantics

Recommendations

Verification of STM on relaxed memory models

Software transactional memories (STM) are described in the literature with assumptions of sequentially consistent program execution and atomicity of high level operations like read, write, and abort. However, in a realistic setting, processors use ...
Relaxed memory models: an operational approach
POPL '09

Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to have in a given model. A minimal guarantee memory models should provide to ...
Partial-coherence abstractions for relaxed memory models
PLDI '11

We present an approach for automatic verification and fence inference in concurrent programs running under relaxed memory models. Verification under relaxed memory models is a hard problem. Given a finite state program and a safety specification, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

TLDI '12: Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation

January 2012

110 pages

ISBN:9781450311205

DOI:10.1145/2103786

General Chair:
Benjamin C. Pierce
Monterey, CA., USA

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

In-Cooperation

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 January 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

POPL '12

Sponsor:

SIGPLAN

POPL '12: The 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

January 28, 2012

Pennsylvania, Philadelphia, USA

Acceptance Rates

Overall Acceptance Rate 11 of 26 submissions, 42%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
178
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bocchi LMelgratti H(2018)On the behaviour of general purpose applications on cloud storagesService Oriented Computing and Applications10.1007/s11761-014-0165-79:3-4(213-227)Online publication date: 13-Dec-2018
https://dl.acm.org/doi/10.1007/s11761-014-0165-7
Lochbihler A(2018)Mechanising a Type-Safe Model of Multithreaded Java with a Verified CompilerJournal of Automated Reasoning10.1007/s10817-018-9452-x61:1-4(243-332)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s10817-018-9452-x
Jeffrey ARiely JKoskinen EGrohe MShankar N(2016)On Thin Air Reads Towards an Event Structures Model of Relaxed MemoryProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2934536(759-767)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2934536
Lochbihler A(2014)Making the java memory model safeACM Transactions on Programming Languages and Systems10.1145/251819135:4(1-65)Online publication date: 3-Jan-2014
https://dl.acm.org/doi/10.1145/2518191
Bocchi LMelgratti H(2014)On the Behaviour of General-Purpose Applications on Cloud StoragesWeb Services and Formal Methods10.1007/978-3-319-08260-8_3(29-47)Online publication date: 25-Jun-2014
https://doi.org/10.1007/978-3-319-08260-8_3

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten