A Logic for Expressions with Side-Effects. - Hans-Juergen Boehm (POPL, 1982)

A Logic for the Russell Programming Language. - Hans-Juergen Boehm (1984)

Partial Polymorphic Type Inference Is Undecidable - Hans-Juergen Boehm (FOCS, 1985)

Side Effects and Aliasing Can Have Simple Axiomatic Descriptions. - Hans-Juergen Boehm (ACM Trans. Program. Lang. Syst., 1985)

Exact Real Arithmetic: A Case Study in Higher Order Programming. - Hans-Juergen Boehm; Robert Cartwright; Mark Riggle; Michael J. O'Donnell (LISP and Functional Programming, 1986)

Implementing RUSSELL. - Hans-Juergen Boehm; Alan J. Demers (SIGPLAN Symposium on Compiler Construction, 1986)

Parallel Attribute Grammar Evaluation. - Hans-Juergen Boehm; Willy Zwaenepoel (ICDCS, 1987)

Constructive real interpretation of numerical programs. - Hans-Juergen Boehm (PLDI, 1987)

Garbage Collection in an Uncooperative Environment. - Hans-Juergen Boehm; Mark D. Weiser (Softw. Pract. Exp., 1988)

Type Inference in the Presence of Type Abstraction. - Hans-Juergen Boehm (PLDI, 1989)

Optimizing Programs over the Constructive Reals. - Vernon A. Lee Jr.; Hans-Juergen Boehm (PLDI, 1990)

Combining Generational and Conservative Garbage Collection: Framework and Implementations. - Alan J. Demers; Mark D. Weiser; Barry Hayes; Hans-Juergen Boehm; Daniel G. Bobrow; Scott Shenker (POPL, 1990)

Mostly Parallel Garbage Collection. - Hans-Juergen Boehm; Alan J. Demers; Scott Shenker (PLDI, 1991)

Space Efficient Conservative Garbage Collection. - Hans-Juergen Boehm (PLDI, 1993)

Space efficient conservative garbage collection (with retrospective) - Hans-Juergen Boehm (Best of PLDI, 1993)

Implementing Multiple Locks Using Lamport's Mutual Exclusion Algorithm. - Hans-Juergen Boehm; Alan J. Demers; Chris Uhler (LOPLAS, 1993)

Ropes: An Alternative to Strings. - Hans-Juergen Boehm; Russell R. Atkinson; Michael F. Plass (Softw. Pract. Exp., 1995)

Simple Garbage-Collector-Safety. - Hans-Juergen Boehm (PLDI, 1996)

Understanding memory allocation of scheme programs. - Manuel Serrano; Hans-Juergen Boehm (ICFP, 2000)

Reducing Garbage Collector Cache Misses. - Hans-Juergen Boehm (ISMM, 2000)

SIGPLANet - A Modest Proposal for SIGPLAN in the 21st Century. - Thomas Ball 001; Hans-Juergen Boehm (ACM SIGPLAN Notices, 2001)

Letter from the Newly Elected Chair. - Hans-Juergen Boehm (ACM SIGPLAN Notices, 2001)

Bounding space usage of conservative garbage collectors. - Hans-Juergen Boehm (POPL, 2002)

Destructors, finalizers, and synchronization. - Hans-Juergen Boehm (POPL, 2003)

An almost non-blocking stack. - Hans-Juergen Boehm (PODC, 2004)

The space cost of lazy reference counting. - Hans-Juergen Boehm (POPL, 2004)

Threads cannot be implemented as a library. - Hans-Juergen Boehm (PLDI, 2005)

The constructive reals as a Java library. - Hans-Juergen Boehm (J. Log. Algebraic Methods Program., 2005)

Reordering constraints for pthread-style locks. - Hans-Juergen Boehm (PPoPP, 2007)

Foundations of the C++ concurrency memory model. - Hans-Juergen Boehm; Sarita V. Adve (PLDI, 2008)

Garbage collection in the next C++ standard. - Hans-Juergen Boehm; Mike Spertus (ISMM, 2009)

Conflict exceptions: simplifying concurrent language semantics with precise hardware exceptions for data-races. - Brandon Lucia; Luis Ceze; Karin Strauss; Shaz Qadeer; Hans-Juergen Boehm (ISCA, 2010)

Memory models: a case for rethinking parallel languages and hardware. - Sarita V. Adve; Hans-Juergen Boehm (Commun. ACM, 2010)

A solid foundation for x86 shared memory: technical perspective. - Hans-Juergen Boehm (Commun. ACM, 2010)

The runtime abort graph and its application to software transactional memory optimization. - Dhruva R. Chakrabarti; Prithviraj Banerjee; Hans-Juergen Boehm; Pramod G. Joisha; Robert S. Schreiber (CGO, 2011)

How to Miscompile Programs with "Benign" Data Races. - Hans-Juergen Boehm (HotPar, 2011)

Performance implications of fence-based memory models. - Hans-Juergen Boehm (MSPC, 2011)

Extended sequential reasoning for data-race-free programs. - Laura Effinger-Dean; Hans-Juergen Boehm; Dhruva R. Chakrabarti; Pramod G. Joisha (MSPC, 2011)

A technique for the effective and automatic reuse of classical compiler optimizations on multithreaded code. - Pramod G. Joisha; Robert S. Schreiber; Prithviraj Banerjee; Hans-Juergen Boehm; Dhruva R. Chakrabarti (POPL, 2011)

Multi-Core Memory Models and Concurrency Theory (Dagstuhl Seminar 11011). - Hans-Juergen Boehm; Ursula Goltz; Holger Hermanns; Peter Sewell (Dagstuhl Reports, 2011)

Memory Models. - Sarita V. Adve; Hans-Juergen Boehm (Encyclopedia of Parallel Computing, 2011)

Position paper: nondeterminism is unavoidable, but data races are pure evil. - Hans-Juergen Boehm (RACES@SPLASH, 2012)

IFRit: interference-free regions for dynamic data-race detection. - Laura Effinger-Dean; Brandon Lucia; Luis Ceze; Dan Grossman; Hans-Juergen Boehm (OOPSLA, 2012)

Can seqlocks get along with programming language memory models? - Hans-Juergen Boehm (MSPC, 2012)

You don't know jack about shared variables or memory models. - Hans-Juergen Boehm; Sarita V. Adve (Commun. ACM, 2012)

On a Technique for Transparently Empowering Classical Compiler Optimizations on Multithreaded Code. - Pramod G. Joisha; Robert S. Schreiber; Prithviraj Banerjee; Hans-Juergen Boehm; Dhruva R. Chakrabarti (ACM Trans. Program. Lang. Syst., 2012)

Durability Semantics for Lock-based Multithreaded Programs. - Dhruva R. Chakrabarti; Hans-Juergen Boehm (HotPar, 2013)

Atlas: leveraging locks for non-volatile memory consistency. - Dhruva R. Chakrabarti; Hans-Juergen Boehm; Kumud Bhandari (OOPSLA, 2014)

Outlawing ghosts: avoiding out-of-thin-air results. - Hans-Juergen Boehm; Brian Demsky (MSPC@PLDI, 2014)

Practices of PLDI. - Hans-Juergen Boehm; Jack W. Davidson; Kathleen Fisher; Cormac Flanagan; Jeremy Gibbons; Mary W. Hall; Graham Hutton; David A. Padua; Frank Tip; Jan Vitek; Philip Wadler (ACM SIGPLAN Notices, 2014)

Myths and Misconceptions about Threads. - Hans-Juergen Boehm (SPAA, 2015)

Persistence programming models for non-volatile memory. - Hans-Juergen Boehm; Dhruva R. Chakrabarti (ISMM, 2016)

Makalu: fast recoverable allocation of non-volatile memory. - Kumud Bhandari; Dhruva R. Chakrabarti; Hans-Juergen Boehm (OOPSLA, 2016)

Small-data computing: correct calculator arithmetic. - Hans-Juergen Boehm (Commun. ACM, 2017)

New Challenges in Parallelism (Dagstuhl Seminar 17451). - Annette Bieniusa; Hans-Juergen Boehm; Maurice Herlihy; Erez Petrank (Dagstuhl Reports, 2017)

Towards an API for the real numbers. - Hans-Juergen Boehm (PLDI, 2020)

Foundations of Persistent Programming (Dagstuhl Seminar 21462). - Hans-Juergen Boehm; Ori Lahav 001; Azalea Raad (Dagstuhl Reports, 2021)