Jan-Willem Maessen - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2008

Split hardware transactions: true nesting of transactions using best-effort hardware transactional memoryYossi Lev, Jan-Willem Maessen. ppopp 2008: 197-206 [doi]

2007

Store Atomicity for Transactional MemoryJan-Willem Maessen, Arvind. ENTCS, 174(9):117-137, 2007. [doi]

2006

Memory Model = Instruction Reordering + Store AtomicityArvind, Jan-Willem Maessen. isca 2006: 29-40 [doi]

2004

Object-oriented units of measurementEric E. Allen, David Chase, Victor Luchangco, Jan-Willem Maessen, Guy L. Steele Jr.. OOPSLA 2004: 384-403 [doi]

2002

Hybrid eager and lazy evaluation for efficient compilation of HaskellJan-Willem Maessen. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, 2002. [doi]

Eager Haskell: resource-bounded execution yields efficient iterationJan-Willem Maessen. haskell 2002: 38-50 [doi]

2001

Program analysis for safety guarantees in a Java virtual machine written in JavaJan-Willem Maessen, Vivek Sarkar, David Grove. PASTE 2001: 62-65 [doi]

2000

Improving the Java memory model using CRFJan-Willem Maessen, Arvind, Xiaowei Shen. OOPSLA 2000: 1-12 [doi]

1998

LambdaS: an implicitly parallel lambda-calculus with letrec, synchronization and side-effectsArvind, Jan-Willem Maessen, Rishiyur S. Nikhil, Joseph E. Stoy. ENTCS, 16(3):265-290, 1998. [doi]

1996

A Multithreaded Substrate and Compilation Model for the Implicity Parallel Language pHArvind, Alejandro Caro, Jan-Willem Maessen, Shail Aditya. lcpc 1997: 519-533

A Lambda Calculus with Letrecs and BarriersArvind, Jan-Willem Maessen, Rishiyur S. Nikhil, Joseph E. Stoy. fsttcs 1996: 19-36

Sign in or sign up to see more results.

runs on WebDSL