Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Foundations of Software Science and Computational Structures

FoSSaCS 2012: Foundations of Software Science and Computational Structures pp 180–194Cite as

  1. Home
  2. Foundations of Software Science and Computational Structures
  3. Conference paper
Brookes Is Relaxed, Almost!

Brookes Is Relaxed, Almost!

  • Radha Jagadeesan17,
  • Gustavo Petri17 &
  • James Riely17 
  • Conference paper
  • 857 Accesses

  • 3 Citations

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7213)

Abstract

We revisit the Brookes [1996] semantics for a shared variable parallel programming language in the context of the Total Store Ordering TSO relaxed memory model. We describe a denotational semantics that is fully abstract for Brookes’ language and also sound for the new commands that are specific to TSO. Our description supports the folklore sentiment about the simplicity of the TSO memory model.

Research supported by NSF 0916741.

Download conference paper PDF

References

  • Adve, S.V., Boehm, H.-J.: Memory models: a case for rethinking parallel languages and hardware. Commun. ACM 53, 90–101 (2010) ISSN 0001-0782

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

  • Adve, S.V., Hill, M.D.: Weak ordering - a new definition. In: ISCA, pp. 2–14 (1990)

    Google Scholar 

  • Boudol, G., Petri, G.: Relaxed memory models: an operational approach. In: POPL, pp. 392–403 (2009)

    Google Scholar 

  • Brookes, S.: A semantics for concurrent separation logic. Theor. Comput. Sci. 375(1-3), 227–270 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Brookes, S.: Full abstraction for a shared-variable parallel language. Inf. Comput. 127(2), 145–163 (1996)

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Jagadeesan, R., Pitcher, C., Riely, J.: Generative Operational Semantics for Relaxed Memory Models. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 307–326. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

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

    CrossRef  MATH  Google Scholar 

  • Manson, J., Pugh, W., Adve, S.V.: The java memory model. In: POPL, pp. 378–391 (2005)

    Google Scholar 

  • O’Hearn, P.W.: Resources, concurrency, and local reasoning. Theor. Comput. Sci. 375(1-3), 271–307 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Owens, S., Sarkar, S., Sewell, P.: A Better x86 Memory Model: x86-TSO. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 391–407. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  • Parkinson, M.J., Bornat, R., O’Hearn, P.W.: Modular verification of a non-blocking stack. In: POPL, pp. 297–302 (2007)

    Google Scholar 

  • Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS, pp. 55–74 (2002)

    Google Scholar 

  • Sevcík, J., Vafeiadis, V., Nardelli, F.Z., Jagannathan, S., Sewell, P.: Relaxed-memory concurrency and verified compilation. In: POPL, pp. 43–54 (2011)

    Google Scholar 

  • Sewell, P., Sarkar, S., Owens, S., Nardelli, F.Z., Myreen, M.O.: x86-TSO: a rigorous and usable programmer’s model for x86 multiprocessors. Commun. ACM 53(7), 89–97 (2010)

    CrossRef  Google Scholar 

  • Inc. CORPORATE. SPARC. The SPARC Architecture Manual (version 9). Prentice-Hall, Inc., Upper Saddle River (1994)

    Google Scholar 

  • Turon, A.J., Wand, M.: A separation logic for refining concurrent objects. SIGPLAN Not. 46, 247–258 (2011) ISSN 0362-1340

    CrossRef  Google Scholar 

  • Vafeiadis, V., Parkinson, M.J.: A Marriage of Rely/Guarantee and Separation Logic. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 256–271. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, DePaul University, USA

    Radha Jagadeesan, Gustavo Petri & James Riely

Authors
  1. Radha Jagadeesan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gustavo Petri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. James Riely
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Lars Birkedal

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jagadeesan, R., Petri, G., Riely, J. (2012). Brookes Is Relaxed, Almost!. In: Birkedal, L. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2012. Lecture Notes in Computer Science, vol 7213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28729-9_12

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-28729-9_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28728-2

  • Online ISBN: 978-3-642-28729-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature