Hans-Juergen Boehm

发表

New Challenges in Parallelism (Dagstuhl Seminar 17451)

Maurice Herlihy, Annette Bieniusa, Hans-Juergen Boehm, 2017, Dagstuhl Reports.

IFRit: interference-free regions for dynamic data-race detection

Dan Grossman, Brandon Lucia, Hans-Juergen Boehm, 2012, OOPSLA '12.

Implementing multiple locks using Lamport's mutual exclusion algorithm

Hans-Juergen Boehm, Alan J. Demers, Chris Uhler, 1993, LOPL.

Foundations of the C++ concurrency memory model

Hans-Juergen Boehm, Sarita V. Adve, S. Adve, 2008, PLDI '08.

Simple garbage-collector-safety

Hans-Juergen Boehm, 1996, PLDI '96.

On a Technique for Transparently Empowering Classical Compiler Optimizations on Multithreaded Code

Hans-Juergen Boehm, Prithviraj Banerjee, Dhruva R. Chakrabarti, 2012, TOPL.

A solid foundation for x86 shared memory

Hans-Juergen Boehm, 2010, Commun. ACM.

A logic for expressions with side-effects

Hans-Juergen Boehm, 1982, POPL '82.

Letter from the Newly Elected Chair

Hans-Juergen Boehm, 2001, ACM SIGPLAN Notices.

Outlawing ghosts: avoiding out-of-thin-air results

Hans-Juergen Boehm, Brian Demsky, 2014, MSPC@PLDI.

A modest proposal for SIGPLAN in the 21st century

Hans-Juergen Boehm, Thomas Ball, 2001, SIGP.

Understanding memory allocation of scheme programs

Hans-Juergen Boehm, Manuel Serrano, 2000, ICFP '00.

Persistence programming models for non-volatile memory

Hans-Juergen Boehm, Dhruva R. Chakrabarti, 2016, ISMM.

An almost non-blocking stack

Hans-Juergen Boehm, 2004, PODC '04.

Space efficient conservative garbage collection (with retrospective)

Hans-Juergen Boehm, 1993, PLDI 1993.

The space cost of lazy reference counting

Hans-Juergen Boehm, 2004, POPL '04.

The constructive reals as a Java library

Hans-Juergen Boehm, H. Boehm, 2005, J. Log. Algebraic Methods Program..

Makalu: fast recoverable allocation of non-volatile memory

Hans-Juergen Boehm, Dhruva R. Chakrabarti, Kumud Bhandari, 2016, OOPSLA.

Reordering constraints for pthread-style locks

Hans-Juergen Boehm, 2007, PPOPP.

You don't know jack about shared variables or memory models

Hans-Juergen Boehm, Sarita V. Adve, S. Adve, 2011, Commun. ACM.

HP Laboratories

Hans-Juergen Boehm, H. Boehm, 2006 .

Reducing garbage collector cache misses

Hans-Juergen Boehm, H. Boehm, 2000, ISMM '00.

Garbage collection in an uncooperative environment

Hans-Juergen Boehm, Mark Weiser, M. Weiser, 1988, Softw. Pract. Exp..

Space efficient conservative garbage collection

Hans-Juergen Boehm, 2004, SIGP.

The runtime abort graph and its application to software transactional memory optimization

Hans-Juergen Boehm, Prithviraj Banerjee, Dhruva R. Chakrabarti, 2011, International Symposium on Code Generation and Optimization (CGO 2011).

Combining generational and conservative garbage collection: framework and implementations

Daniel G. Bobrow, Scott Shenker, Hans-Juergen Boehm, 1989, POPL '90.

Atlas: leveraging locks for non-volatile memory consistency

Hans-Juergen Boehm, Dhruva R. Chakrabarti, Kumud Bhandari, 2014, OOPSLA.

Extended sequential reasoning for data-race-free programs

Hans-Juergen Boehm, Laura Effinger-Dean, Dhruva R. Chakrabarti, 2011, MSPC '11.

Memory models

Hans-Juergen Boehm, Sarita V. Adve, S. Adve, 2010, Encyclopedia of Parallel Computing.

Constructive real interpretation of numerical programs

Hans-Juergen Boehm, H. Boehm, 1987, SIGPLAN '87.

Exact real arithmetic: a case study in higher order programming

Hans-Juergen Boehm, Robert Cartwright, Michael J. O'Donnell, 1986, LFP '86.

Can seqlocks get along with programming language memory models?

Hans-Juergen Boehm, 2012, MSPC '12.

Bounding space usage of conservative garbage collectors

Hans-Juergen Boehm, 2002, POPL '02.

Ropes: An alternative to strings

Hans-Juergen Boehm, Michael F. Plass, Russell R. Atkinson, 1995, Softw. Pract. Exp..

Optimizing programs over the constructive reals

Hans-Juergen Boehm, Vernon A. Lee, H. Boehm, 1990, PLDI '90.

Partial Polymorphic Type Inference Is Undecidable

Hans-Juergen Boehm, 1985, FOCS.

Durability Semantics for Lock-based Multithreaded Programs

Hans-Juergen Boehm, Dhruva R. Chakrabarti, 2013, HotPar.

Destructors, finalizers, and synchronization

Hans-Juergen Boehm, H. Boehm, 2003, POPL '03.

Type inference in the presence of type abstraction

Hans-Juergen Boehm, 1989, PLDI '89.

Myths and Misconceptions about Threads

Hans-Juergen Boehm, 2015, SPAA.

Side effects and aliasing can have simple axiomatic descriptions

Hans-Juergen Boehm, H. Boehm, 1985, TOPL.

Mostly parallel garbage collection

Scott Shenker, Hans-Juergen Boehm, Alan J. Demers, 1991, PLDI '91.

SIGPLANet - A Modest Proposal for SIGPLAN in the 21 st Century.

Hans-Juergen Boehm, Thomas Ball, 2001 .

Garbage collection in the next C++ standard

Hans-Juergen Boehm, Mike Spertus, 2009, ISMM '09.

Small-data computing

Hans-Juergen Boehm, 2017, Commun. ACM.

Performance implications of fence-based memory models

Hans-Juergen Boehm, 2011, MSPC '11.

Parallel Attribute Grammar Evaluation

Willy Zwaenepoel, Hans-Juergen Boehm, 1987, ICDCS.

Multi-Core Memory Models and Concurrency Theory (Dagstuhl Seminar 11011)

Hans-Juergen Boehm, Holger Hermanns, Ursula Goltz, 2011, Dagstuhl Reports.

Implementing RUSSELL

Hans-Juergen Boehm, Alan J. Demers, Hans-Juergen Boehm, 1986, SIGPLAN '86.

Conflict exceptions: simplifying concurrent language semantics with precise hardware exceptions for data-races

Brandon Lucia, Hans-Juergen Boehm, Luis Ceze, 2010, ISCA.

A technique for the effective and automatic reuse of classical compiler optimizations on multithreaded code

Hans-Juergen Boehm, Prithviraj Banerjee, Dhruva R. Chakrabarti, 2011, POPL '11.

How to Miscompile Programs with "Benign" Data Races

Hans-Juergen Boehm, H. Boehm, 2011, HotPar.