Hans-Juergen Boehm

Affiliations:
  • Google, Palo Alto, CA, US
  • HP (former)


According to our database1, Hans-Juergen Boehm authored at least 57 papers between 1982 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Foundations of Persistent Programming (Dagstuhl Seminar 21462).
Dagstuhl Reports, 2021

2020
Towards an API for the real numbers.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

2017
New Challenges in Parallelism (Dagstuhl Seminar 17451).
Dagstuhl Reports, 2017

Small-data computing: correct calculator arithmetic.
Commun. ACM, 2017

2016
Makalu: fast recoverable allocation of non-volatile memory.
Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, 2016

Persistence programming models for non-volatile memory.
Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management, Santa Barbara, CA, USA, June 14, 2016

2015
Myths and Misconceptions about Threads.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014
Practices of PLDI.
ACM SIGPLAN Notices, 2014

Outlawing ghosts: avoiding out-of-thin-air results.
Proceedings of the workshop on Memory Systems Performance and Correctness, 2014

Atlas: leveraging locks for non-volatile memory consistency.
Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, 2014

2013
Durability Semantics for Lock-based Multithreaded Programs.
Proceedings of the 5th USENIX Workshop on Hot Topics in Parallelism, 2013

2012
On a Technique for Transparently Empowering Classical Compiler Optimizations on Multithreaded Code.
ACM Trans. Program. Lang. Syst., 2012

You don't know jack about shared variables or memory models.
Commun. ACM, 2012

Can seqlocks get along with programming language memory models?
Proceedings of the 2012 ACM SIGPLAN workshop on Memory Systems Performance and Correctness: held in conjunction with PLDI '12, 2012

IFRit: interference-free regions for dynamic data-race detection.
Proceedings of the 27th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2012

Position paper: nondeterminism is unavoidable, but data races are pure evil.
Proceedings of the 2012 ACM workshop on Relaxing synchronization for multicore and manycore scalability, 2012

2011
Memory Models.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Multi-Core Memory Models and Concurrency Theory (Dagstuhl Seminar 11011).
Dagstuhl Reports, 2011

A technique for the effective and automatic reuse of classical compiler optimizations on multithreaded code.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Extended sequential reasoning for data-race-free programs.
Proceedings of the 2011 ACM SIGPLAN workshop on Memory Systems Performance and Correctness: held in conjunction with PLDI '11, 2011

Performance implications of fence-based memory models.
Proceedings of the 2011 ACM SIGPLAN workshop on Memory Systems Performance and Correctness: held in conjunction with PLDI '11, 2011

How to Miscompile Programs with "Benign" Data Races.
Proceedings of the 3rd USENIX Workshop on Hot Topics in Parallelism, 2011

The runtime abort graph and its application to software transactional memory optimization.
Proceedings of the CGO 2011, 2011

2010
A solid foundation for x86 shared memory: technical perspective.
Commun. ACM, 2010

Memory models: a case for rethinking parallel languages and hardware.
Commun. ACM, 2010

Conflict exceptions: simplifying concurrent language semantics with precise hardware exceptions for data-races.
Proceedings of the 37th International Symposium on Computer Architecture (ISCA 2010), 2010

2009
Garbage collection in the next C++ standard.
Proceedings of the 8th International Symposium on Memory Management, 2009

2008
Foundations of the C++ concurrency memory model.
Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, 2008

2007
Reordering constraints for pthread-style locks.
Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2007

2005
The constructive reals as a Java library.
J. Log. Algebraic Methods Program., 2005

Threads cannot be implemented as a library.
Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation, 2005

2004
The space cost of lazy reference counting.
Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

An almost non-blocking stack.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003
Destructors, finalizers, and synchronization.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

2002
Bounding space usage of conservative garbage collectors.
Proceedings of the Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002

2001
Letter from the Newly Elected Chair.
ACM SIGPLAN Notices, 2001

SIGPLANet - A Modest Proposal for SIGPLAN in the 21<sup>st</sup> Century.
ACM SIGPLAN Notices, 2001

2000
Reducing Garbage Collector Cache Misses.
Proceedings of the ISMM 2000, 2000

Understanding memory allocation of scheme programs.
Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), 2000

1996
Simple Garbage-Collector-Safety.
Proceedings of the ACM SIGPLAN'96 Conference on Programming Language Design and Implementation (PLDI), 1996

1995
Ropes: An Alternative to Strings.
Softw. Pract. Exp., 1995

1993
Implementing Multiple Locks Using Lamport's Mutual Exclusion Algorithm.
LOPLAS, 1993

Space efficient conservative garbage collection (with retrospective)
Proceedings of the 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, 1993

Space Efficient Conservative Garbage Collection.
Proceedings of the ACM SIGPLAN'93 Conference on Programming Language Design and Implementation (PLDI), 1993

1991
Mostly Parallel Garbage Collection.
Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), 1991

1990
Combining Generational and Conservative Garbage Collection: Framework and Implementations.
Proceedings of the Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990

Optimizing Programs over the Constructive Reals.
Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation (PLDI), 1990

1989
Type Inference in the Presence of Type Abstraction.
Proceedings of the ACM SIGPLAN'89 Conference on Programming Language Design and Implementation (PLDI), 1989

1988
Garbage Collection in an Uncooperative Environment.
Softw. Pract. Exp., 1988

1987
Constructive real interpretation of numerical programs.
Proceedings of the Symposium on Interpreters and Interpretive Techniques, 1987, St. Paul, Minnesota, USA, June 24, 1987

Parallel Attribute Grammar Evaluation.
Proceedings of the 7th International Conference on Distributed Computing Systems, 1987

1986
Implementing RUSSELL.
Proceedings of the 1986 SIGPLAN Symposium on Compiler Construction, 1986

Exact Real Arithmetic: A Case Study in Higher Order Programming.
Proceedings of the 1986 ACM Conference on LISP and Functional Programming, 1986

1985
Side Effects and Aliasing Can Have Simple Axiomatic Descriptions.
ACM Trans. Program. Lang. Syst., 1985

Partial Polymorphic Type Inference Is Undecidable
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
A Logic for the Russell Programming Language.
PhD thesis, 1984

1982
A Logic for Expressions with Side-Effects.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982


  Loading...