| 2005 |
|---|
| 35 | EE | Clark W. Barrett,
Yi Fang,
Benjamin Goldberg,
Ying Hu,
Amir Pnueli,
Lenore D. Zuck:
TVOC: A Translation Validator for Optimizing Compilers.
CAV 2005: 291-295 |
| 34 | EE | Cory Plock,
Benjamin Goldberg,
Lenore D. Zuck:
From Requirements to Specifications.
ECBS 2005: 183-190 |
| 33 | EE | Benjamin Goldberg,
Lenore D. Zuck,
Clark W. Barrett:
Into the Loops: Practical Issues in Translation Validation for Optimizing Compilers.
Electr. Notes Theor. Comput. Sci. 132(1): 53-71 (2005) |
| 32 | EE | Ying Hu,
Clark W. Barrett,
Benjamin Goldberg,
Amir Pnueli:
Validating More Loop Optimizations.
Electr. Notes Theor. Comput. Sci. 141(2): 69-84 (2005) |
| 31 | EE | Lenore D. Zuck,
Amir Pnueli,
Benjamin Goldberg,
Clark W. Barrett,
Yi Fang,
Ying Hu:
Translation and Run-Time Validation of Loop Transformations.
Formal Methods in System Design 27(3): 335-360 (2005) |
| 2004 |
|---|
| 30 | EE | Ying Hu,
Clark W. Barrett,
Benjamin Goldberg:
Theory and Algorithms for the Generation and Validation of Speculative Loop Optimizations.
SEFM 2004: 281-289 |
| 2003 |
|---|
| 29 | EE | Clark W. Barrett,
Benjamin Goldberg,
Lenore D. Zuck:
Run-Time Validation of Speculative Optimizations using CVC.
Electr. Notes Theor. Comput. Sci. 89(2): (2003) |
| 28 | EE | Lenore D. Zuck,
Amir Pnueli,
Benjamin Goldberg:
VOC: A Methodology for the Translation Validation of OptimizingCompilers.
J. UCS 9(3): 223-247 (2003) |
| 2002 |
|---|
| 27 | EE | Benjamin Goldberg,
Emily Crutcher,
Chad Huneycutt,
Krishna V. Palem:
Software Bubbles: Using Predication to Compensate for Aliasing in Software Pipelines.
IEEE PACT 2002: 211-221 |
| 26 | EE | Lenore D. Zuck,
Amir Pnueli,
Yi Fang,
Benjamin Goldberg:
VOC: A Translation Validator for Optimizing Compilers.
Electr. Notes Theor. Comput. Sci. 65(2): (2002) |
| 25 | EE | Lenore D. Zuck,
Amir Pnueli,
Yi Fang,
Benjamin Goldberg,
Ying Hu:
Translation and Run-Time Validation of Optimized Code.
Electr. Notes Theor. Comput. Sci. 70(4): (2002) |
| 1997 |
|---|
| 24 | | Cristian Ungureanu,
Benjamin Goldberg:
Formal Models of Distributed Memory Management.
ICFP 1997: 280-291 |
| 23 | EE | Mihnea Marinescu,
Benjamin Goldberg:
Partial-Evaluation Techniques for Concurrent Programs.
PEPM 1997: 47-62 |
| 22 | | Benjamin Goldberg:
Functional Programming Languages.
The Computer Science and Engineering Handbook 1997: 2006-2036 |
| 21 | | Tyng-Ruey Chuang,
Benjamin Goldberg:
A Syntactic Method for Finding Least Fixed Points of Higher-Order Functions over Finite Domains.
J. Funct. Program. 7(4): 357-394 (1997) |
| 1996 |
|---|
| 20 | | Benjamin Goldberg:
Functional Programming Languages.
ACM Comput. Surv. 28(1): 249-251 (1996) |
| 1995 |
|---|
| 19 | EE | Young Park,
Benjamin Goldberg:
Static Analysis for Optimizing Reference Counting.
Inf. Process. Lett. 55(4): 229-234 (1995) |
| 18 | EE | Young Gil Park,
Benjamin Goldberg:
Order-of-Demand Analysis for Lazy Languages.
Inf. Process. Lett. 55(6): 343-348 (1995) |
| 1993 |
|---|
| 17 | | Tyng-Ruey Chuang,
Benjamin Goldberg:
Real-Time Deques, Multihead Thring Machines, and Purely Functional Programming.
FPCA 1993: 289-298 |
| 1992 |
|---|
| 16 | | Benjamin Goldberg:
Incremental Garbage Collection Without Tags.
ESOP 1992: 200-218 |
| 15 | EE | Tyng-Ruey Chuang,
Benjamin Goldberg:
A Syntactic Approach to Fixed Point Computation on Finite Domains.
LISP and Functional Programming 1992: 109-118 |
| 14 | EE | Benjamin Goldberg,
Michael Gloger:
Polymorphic Type Reconstruction for Garbage Collection Without Tags.
LISP and Functional Programming 1992: 53-65 |
| 13 | | Young Gil Park,
Benjamin Goldberg:
Escape Analysis on Lists.
PLDI 1992: 116-127 |
| 12 | | Young Gil Park,
Benjamin Goldberg:
Order-of-Demand Analysis for Lazy Languages.
WSA 1992: 91-101 |
| 1991 |
|---|
| 11 | | Young Gil Park,
Benjamin Goldberg:
Reference Escape Analysis: Optimizing Reference Counting based on the Lifetime of References.
PEPM 1991: 178-189 |
| 10 | | Benjamin Goldberg:
Tag-Free Garbage Collection for Strongly Typed Programming Languages.
PLDI 1991: 165-176 |
| 1990 |
|---|
| 9 | | Benjamin Goldberg,
Young Gil Park:
Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program Implementations.
ESOP 1990: 152-160 |
| 1989 |
|---|
| 8 | | Benjamin Goldberg:
Generational Reference Counting: A Reduced-Communication Distributed Storage Reclamation Scheme.
PLDI 1989: 313-321 |
| 1988 |
|---|
| 7 | EE | Benjamin Goldberg:
Buckwheat: Graph Reduction on a Shared-Memory Multiprocessor.
LISP and Functional Programming 1988: 40-51 |
| 1987 |
|---|
| 6 | | Benjamin Goldberg:
Detecting sharing of partial applications in functional programs.
FPCA 1987: 408-425 |
| 1986 |
|---|
| 5 | | Benjamin Goldberg,
Paul Hudak:
Alfalfa: Distributed graph reduction on a hypercube multiprocessor.
Graph Reduction 1986: 94-113 |
| 1985 |
|---|
| 4 | | Paul Hudak,
Benjamin Goldberg:
Serial Combinators: ``Optimal'' Grains of Parallelism.
FPCA 1985: 382-399 |
| 3 | | Paul Hudak,
Benjamin Goldberg:
Efficient Distributed Evaluation of Functional Programs Using Serial Combinators.
ICPP 1985: 831-839 |
| 2 | | Paul Hudak,
Benjamin Goldberg:
Distributed Execution of Functional Programs Using Serial Combinators.
IEEE Trans. Computers 34(10): 881-891 (1985) |
| 1984 |
|---|
| 1 | | Paul Hudak,
Benjamin Goldberg:
Experiments in Diffused Combinator Reduction.
LISP and Functional Programming 1984: 167-176 |
