default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans-Juergen Boehm
Person information
- affiliation: Google, Palo Alto, CA, US
- affiliation (former): HP
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i3]Hans-Juergen Boehm, Ori Lahav, Azalea Raad:
Foundations of Persistent Programming (Dagstuhl Seminar 21462). Dagstuhl Reports 11(10): 94-110 (2021)- 2020
- [c39]Hans-Juergen Boehm:
Towards an API for the real numbers. PLDI 2020: 562-576
2010 – 2019
- 2017
- [j13]Hans-Juergen Boehm:
Small-data computing: correct calculator arithmetic. Commun. ACM 60(8): 44-49 (2017) - [i2]Annette Bieniusa, Hans-Juergen Boehm, Maurice Herlihy, Erez Petrank:
New Challenges in Parallelism (Dagstuhl Seminar 17451). Dagstuhl Reports 7(11): 1-27 (2017) - 2016
- [c38]Hans-Juergen Boehm, Dhruva R. Chakrabarti:
Persistence programming models for non-volatile memory. ISMM 2016: 55-67 - [c37]Kumud Bhandari, Dhruva R. Chakrabarti, Hans-Juergen Boehm:
Makalu: fast recoverable allocation of non-volatile memory. OOPSLA 2016: 677-694 - 2015
- [c36]Hans-Juergen Boehm:
Myths and Misconceptions about Threads. SPAA 2015: 55 - 2014
- [j12]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:
Practices of PLDI. ACM SIGPLAN Notices 49(4S): 33-38 (2014) - [c35]Dhruva R. Chakrabarti, Hans-Juergen Boehm, Kumud Bhandari:
Atlas: leveraging locks for non-volatile memory consistency. OOPSLA 2014: 433-452 - [c34]Hans-Juergen Boehm, Brian Demsky:
Outlawing ghosts: avoiding out-of-thin-air results. MSPC@PLDI 2014: 7:1-7:6 - 2013
- [c33]Dhruva R. Chakrabarti, Hans-Juergen Boehm:
Durability Semantics for Lock-based Multithreaded Programs. HotPar 2013 - [e7]Hans-Juergen Boehm, Cormac Flanagan:
ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '13, Seattle, WA, USA, June 16-19, 2013. ACM 2013, ISBN 978-1-4503-2014-6 [contents] - 2012
- [j11]Hans-Juergen Boehm, Sarita V. Adve:
You don't know jack about shared variables or memory models. Commun. ACM 55(2): 48-54 (2012) - [j10]Pramod G. Joisha, Robert S. Schreiber, Prithviraj Banerjee, Hans-Juergen Boehm, Dhruva R. Chakrabarti:
On a Technique for Transparently Empowering Classical Compiler Optimizations on Multithreaded Code. ACM Trans. Program. Lang. Syst. 34(2): 9:1-9:42 (2012) - [c32]Hans-Juergen Boehm:
Position paper: nondeterminism is unavoidable, but data races are pure evil. RACES@SPLASH 2012: 9-14 - [c31]Laura Effinger-Dean, Brandon Lucia, Luis Ceze, Dan Grossman, Hans-Juergen Boehm:
IFRit: interference-free regions for dynamic data-race detection. OOPSLA 2012: 467-484 - [c30]Hans-Juergen Boehm:
Can seqlocks get along with programming language memory models? MSPC 2012: 12-20 - [e6]Hans-Juergen Boehm, Luis Ceze:
4th USENIX Workshop on Hot Topics in Parallelism, HotPar'12, Berkeley, CA, USA, June 7-8, 2012. USENIX Association 2012 [contents] - 2011
- [c29]Dhruva R. Chakrabarti, Prithviraj Banerjee, Hans-Juergen Boehm, Pramod G. Joisha, Robert S. Schreiber:
The runtime abort graph and its application to software transactional memory optimization. CGO 2011: 42-53 - [c28]Hans-Juergen Boehm:
How to Miscompile Programs with "Benign" Data Races. HotPar 2011 - [c27]Hans-Juergen Boehm:
Performance implications of fence-based memory models. MSPC 2011: 13-19 - [c26]Laura Effinger-Dean, Hans-Juergen Boehm, Dhruva R. Chakrabarti, Pramod G. Joisha:
Extended sequential reasoning for data-race-free programs. MSPC 2011: 22-29 - [c25]Pramod G. Joisha, Robert S. Schreiber, Prithviraj Banerjee, Hans-Juergen Boehm, Dhruva R. Chakrabarti:
A technique for the effective and automatic reuse of classical compiler optimizations on multithreaded code. POPL 2011: 623-636 - [e5]Hans-Juergen Boehm, David F. Bacon:
Proceedings of the 10th International Symposium on Memory Management, ISMM 2011, San Jose, CA, USA, June 04 - 05, 2011. ACM 2011, ISBN 978-1-4503-0263-0 [contents] - [r1]Sarita V. Adve, Hans-Juergen Boehm:
Memory Models. Encyclopedia of Parallel Computing 2011: 1107-1110 - [i1]Hans-Juergen Boehm, Ursula Goltz, Holger Hermanns, Peter Sewell:
Multi-Core Memory Models and Concurrency Theory (Dagstuhl Seminar 11011). Dagstuhl Reports 1(1): 1-26 (2011) - 2010
- [j9]Hans-Juergen Boehm:
A solid foundation for x86 shared memory: technical perspective. Commun. ACM 53(7): 88 (2010) - [j8]Sarita V. Adve, Hans-Juergen Boehm:
Memory models: a case for rethinking parallel languages and hardware. Commun. ACM 53(8): 90-101 (2010) - [c24]Brandon Lucia, Luis Ceze, Karin Strauss, Shaz Qadeer, Hans-Juergen Boehm:
Conflict exceptions: simplifying concurrent language semantics with precise hardware exceptions for data-races. ISCA 2010: 210-221
2000 – 2009
- 2009
- [c23]Hans-Juergen Boehm, Mike Spertus:
Garbage collection in the next C++ standard. ISMM 2009: 30-38 - 2008
- [c22]Hans-Juergen Boehm, Sarita V. Adve:
Foundations of the C++ concurrency memory model. PLDI 2008: 68-78 - 2007
- [c21]Hans-Juergen Boehm:
Reordering constraints for pthread-style locks. PPoPP 2007: 173-182 - 2006
- [e4]Hans-Juergen Boehm, David Grove:
Proceedings of the 2nd International Conference on Virtual Execution Environments, VEE 2006, Ottawa, Ontario, Canada, June 14-16, 2006. ACM 2006, ISBN 978-1-59593-332-4 [contents] - 2005
- [j7]Hans-Juergen Boehm:
The constructive reals as a Java library. J. Log. Algebraic Methods Program. 64(1): 3-11 (2005) - [c20]Hans-Juergen Boehm:
Threads cannot be implemented as a library. PLDI 2005: 261-268 - 2004
- [c19]Hans-Juergen Boehm:
An almost non-blocking stack. PODC 2004: 40-49 - [c18]Hans-Juergen Boehm:
The space cost of lazy reference counting. POPL 2004: 210-219 - 2003
- [c17]Hans-Juergen Boehm:
Destructors, finalizers, and synchronization. POPL 2003: 262-272 - 2002
- [c16]Hans-Juergen Boehm:
Bounding space usage of conservative garbage collectors. POPL 2002: 93-100 - [e3]Hans-Juergen Boehm, David Detlefs:
Proceedings of The Workshop on Memory Systems Performance (MSP 2002), June 16, 2002 and The International Symposium on Memory Management (ISMM 2002), June 20-21, 2002, Berlin, Germany. ACM 2002, ISBN 1-58113-539-4 [contents] - 2001
- [j6]Thomas Ball, Hans-Juergen Boehm:
SIGPLANet - A Modest Proposal for SIGPLAN in the 21st Century. ACM SIGPLAN Notices 36(4): 1-2 (2001) - [j5]Hans-Juergen Boehm:
Letter from the Newly Elected Chair. ACM SIGPLAN Notices 36(9): 1-2 (2001) - 2000
- [c15]Manuel Serrano, Hans-Juergen Boehm:
Understanding memory allocation of scheme programs. ICFP 2000: 245-256 - [c14]Hans-Juergen Boehm:
Reducing Garbage Collector Cache Misses. ISMM 2000: 59-64
1990 – 1999
- 1996
- [c13]Hans-Juergen Boehm:
Simple Garbage-Collector-Safety. PLDI 1996: 89-98 - [e2]Hans-Juergen Boehm, Guy L. Steele Jr.:
Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, St. Petersburg Beach, Florida, USA, January 21-24, 1996. ACM Press 1996, ISBN 0-89791-769-3 [contents] - 1995
- [j4]Hans-Juergen Boehm, Russell R. Atkinson, Michael F. Plass:
Ropes: An Alternative to Strings. Softw. Pract. Exp. 25(12): 1315-1330 (1995) - 1994
- [e1]Hans-Juergen Boehm, Bernard Lang, Daniel M. Yellin:
Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, USA, January 17-21, 1994. ACM Press 1994, ISBN 0-89791-636-0 [contents] - 1993
- [j3]Hans-Juergen Boehm, Alan J. Demers, Chris Uhler:
Implementing Multiple Locks Using Lamport's Mutual Exclusion Algorithm. LOPLAS 2(1-4): 46-58 (1993) - [c12]Hans-Juergen Boehm:
Space Efficient Conservative Garbage Collection. PLDI 1993: 197-206 - [c11]Hans-Juergen Boehm:
Space efficient conservative garbage collection (with retrospective). Best of PLDI 1993: 490-501 - 1991
- [c10]Hans-Juergen Boehm, Alan J. Demers, Scott Shenker:
Mostly Parallel Garbage Collection. PLDI 1991: 157-164 - 1990
- [c9]Vernon A. Lee Jr., Hans-Juergen Boehm:
Optimizing Programs over the Constructive Reals. PLDI 1990: 102-111 - [c8]Alan J. Demers, Mark D. Weiser, Barry Hayes, Hans-Juergen Boehm, Daniel G. Bobrow, Scott Shenker:
Combining Generational and Conservative Garbage Collection: Framework and Implementations. POPL 1990: 261-269
1980 – 1989
- 1989
- [c7]Hans-Juergen Boehm:
Type Inference in the Presence of Type Abstraction. PLDI 1989: 192-206 - 1988
- [j2]Hans-Juergen Boehm, Mark D. Weiser:
Garbage Collection in an Uncooperative Environment. Softw. Pract. Exp. 18(9): 807-820 (1988) - 1987
- [c6]Hans-Juergen Boehm, Willy Zwaenepoel:
Parallel Attribute Grammar Evaluation. ICDCS 1987: 347-355 - [c5]Hans-Juergen Boehm:
Constructive real interpretation of numerical programs. PLDI 1987: 214-221 - 1986
- [c4]Hans-Juergen Boehm, Robert Cartwright, Mark Riggle, Michael J. O'Donnell:
Exact Real Arithmetic: A Case Study in Higher Order Programming. LISP and Functional Programming 1986: 162-173 - [c3]Hans-Juergen Boehm, Alan J. Demers:
Implementing RUSSELL. SIGPLAN Symposium on Compiler Construction 1986: 186-195 - 1985
- [j1]Hans-Juergen Boehm:
Side Effects and Aliasing Can Have Simple Axiomatic Descriptions. ACM Trans. Program. Lang. Syst. 7(4): 637-655 (1985) - [c2]Hans-Juergen Boehm:
Partial Polymorphic Type Inference Is Undecidable. FOCS 1985: 339-345 - 1984
- [b1]Hans-Juergen Boehm:
A Logic for the Russell Programming Language. Cornell University, USA, 1984 - 1982
- [c1]Hans-Juergen Boehm:
A Logic for Expressions with Side-Effects. POPL 1982: 268-280
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-10 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
