2008 |
30 | EE | Hans-Juergen Boehm,
Sarita V. Adve:
Foundations of the C++ concurrency memory model.
PLDI 2008: 68-78 |
2007 |
29 | EE | Hans-Juergen Boehm:
Reordering constraints for pthread-style locks.
PPOPP 2007: 173-182 |
2006 |
28 | | 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 |
2005 |
27 | EE | Hans-Juergen Boehm:
Threads cannot be implemented as a library.
PLDI 2005: 261-268 |
26 | EE | Hans-Juergen Boehm:
The constructive reals as a Java library.
J. Log. Algebr. Program. 64(1): 3-11 (2005) |
2004 |
25 | EE | Hans-Juergen Boehm:
An almost non-blocking stack.
PODC 2004: 40-49 |
24 | EE | Hans-Juergen Boehm:
The space cost of lazy reference counting.
POPL 2004: 210-219 |
2003 |
23 | EE | Hans-Juergen Boehm:
Destructors, finalizers, and synchronization.
POPL 2003: 262-272 |
2002 |
22 | EE | Hans-Juergen Boehm:
Bounding space usage of conservative garbage collectors.
POPL 2002: 93-100 |
2001 |
21 | | Thomas Ball,
Hans-Juergen Boehm:
SIGPLANet - A Modest Proposal for SIGPLAN in the 21st Century.
SIGPLAN Notices 36(4): 1-2 (2001) |
20 | | Hans-Juergen Boehm:
Letter from the Newly Elected Chair.
SIGPLAN Notices 36(9): 1-2 (2001) |
2000 |
19 | EE | Manuel Serrano,
Hans-Juergen Boehm:
Understanding memory allocation of scheme programs.
ICFP 2000: 245-256 |
18 | | Hans-Juergen Boehm:
Reducing Garbage Collector Cache Misses.
ISMM 2000: 59-64 |
1996 |
17 | | Hans-Juergen Boehm:
Simple Garbage-Collector-Safety.
PLDI 1996: 89-98 |
1995 |
16 | | Hans-Juergen Boehm,
Russell R. Atkinson,
Michael F. Plass:
Ropes: An Alternative to Strings.
Softw., Pract. Exper. 25(12): 1315-1330 (1995) |
1993 |
15 | EE | Hans-Juergen Boehm:
Space efficient conservative garbage collection (with retrospective)
Best of PLDI 1993: 490-501 |
14 | | Hans-Juergen Boehm:
Space Efficient Conservative Garbage Collection.
PLDI 1993: 197-206 |
13 | EE | Hans-Juergen Boehm,
Alan J. Demers,
Christ Uhler:
Implementing Multiple Locks Using Lamport's Mutual Exclusion Algorithm.
LOPLAS 2(1-4): 46-58 (1993) |
1991 |
12 | | Hans-Juergen Boehm,
Alan J. Demers,
Scott Shenker:
Mostly Parallel Garbage Collection.
PLDI 1991: 157-164 |
1990 |
11 | | Vernon A. Lee Jr.,
Hans-Juergen Boehm:
Optimizing Programs over the Constructive Reals.
PLDI 1990: 102-111 |
10 | | Alan J. Demers,
Mark Weiser,
Barry Hayes,
Hans-Juergen Boehm,
Daniel G. Bobrow,
Scott Shenker:
Combining Generational and Conservative Garbage Collection: Framework and Implementations.
POPL 1990: 261-269 |
1989 |
9 | | Hans-Juergen Boehm:
Type Inference in the Presence of Type Abstraction.
PLDI 1989: 192-206 |
1988 |
8 | | Hans-Juergen Boehm,
Mark Weiser:
Garbage Collection in an Uncooperative Environment.
Softw., Pract. Exper. 18(9): 807-820 (1988) |
1987 |
7 | | Hans-Juergen Boehm,
Willy Zwaenepoel:
Parallel Attribute Grammar Evaluation.
ICDCS 1987: 347-355 |
6 | EE | Hans-Juergen Boehm:
Constructive real interpretation of numerical programs.
PLDI 1987: 214-221 |
1986 |
5 | | 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 |
4 | EE | Hans-Juergen Boehm,
Alan J. Demers:
Implementing RUSSELL.
SIGPLAN Symposium on Compiler Construction 1986: 186-195 |
1985 |
3 | | Hans-Juergen Boehm:
Partial Polymorphic Type Inference Is Undecidable
FOCS 1985: 339-345 |
2 | EE | Hans-Juergen Boehm:
Side Effects and Aliasing Can Have Simple Axiomatic Descriptions.
ACM Trans. Program. Lang. Syst. 7(4): 637-655 (1985) |
1982 |
1 | | Hans-Juergen Boehm:
A Logic for Expressions with Side-Effects.
POPL 1982: 268-280 |