Browse by Person (creator, editor, contributor, etc.)

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 6.

Monograph

Batty, Mark and Owens, Scott and Sarkar, Susmit and Sewell, Peter and Weber, Tjark (2010) Mathematizing C++ Concurrency: The Post-Rapperswil Model. Technical report. ISO IEC JTC1/SC22/WG21 N3132. (The full text of this publication is not available from this repository)

Conference or workshop item

Sarkar, Susmit and Memarian, Kayvan and Owens, Scott and Batty, Mark and Sewell, Peter and Maranget, Luc and Alglave, Jade and Williams, Derek (2012) Synchronising C/C++ and POWER. In: PLDI '12: 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, 11th-16th June, 2012, Beijing, china. (The full text of this publication is not available from this repository)

Batty, Mark and Memarian, Kayvan and Owens, Scott and Sarkar, Susmit and Sewell, Peter (2012) Clarifying and Compiling C/C++ Concurrency: From C++11 to POWER. In: POPL '12: 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 25th - 27th January, 2012, Philadelphia, USA. (The full text of this publication is not available from this repository)

Blanchette, Jasmin Christian and Weber, Tjark and Batty, Mark and Owens, Scott and Sarkar, Susmit (2011) Nitpicking C++ Concurrency. In: PPDP '11: Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming. (The full text of this publication is not available from this repository)

Batty, Mark and Owens, Scott and Sarkar, Susmit and Sewell, Peter and Weber, Tjark (2011) Mathematizing C++ Concurrency. In: POPL '11: 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 26th - 28th 2011, Austin, USA. (The full text of this publication is not available from this repository)

Zappa Nardelli, Francesco and Sewell, Peter and Sevcik, Jaroslav and Sarkar, Susmit and Owens, Scott and Maranget, Luc and Batty, Mark and Alglave, Jade (2009) Relaxed Memory Models Must Be Rigorous. In: Exploiting Concurrency Efficiently and Correctly, CAV 2009 Workshop. (Unpublished) (The full text of this publication is not available from this repository)

This list was generated on Thu Oct 23 05:01:45 2014 BST.