English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Relaxed-Memory Concurrency and Verified Compilation

Sevcik, J., Vafeiadis, V., Zappa Nardelli, F., Jagannathan, S., & Sewell, P. (2011). Relaxed-Memory Concurrency and Verified Compilation. In POPL’11: Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (pp. 43-54). New York, NY: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-8B6D-6 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-8B6E-4
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Sevcik, Jaroslav, Author
Vafeiadis, Viktor1, Author
Zappa Nardelli, Francesco, Author
Jagannathan, Suresh, Author
Sewell, Peter, Author
Affiliations:
1Max Planck Society, ou_persistent13              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2011
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 577081
URI: http://doi.acm.org/10.1145/1926385.1926393
DOI: 10.1145/1926385.1926393
 Degree: -

Event

show
hide
Title: POPL'11
Place of Event: Austin, TX, USA
Start-/End Date: 2011-01-26 - 2011-01-28

Legal Case

show

Project information

show

Source 1

show
hide
Title: POPL’11 : Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 43 - 54 Identifier: ISBN: 978-1-4503-0490-0