default search action
Benjamin Goldberg 0001
Person information
- affiliation: New York University, NY, USA
- affiliation (former): Yale University, New Heaven, CT, USA
Other persons with the same name
- Benjamin Goldberg 0002
(aka: Benjamin S. Goldberg) — U.S. Army, Soldier Center, Orlando, FL USA (and 1 more)
- Benjamin Goldberg 0003 — Harvard University, School of Engineering and Applied Sciences, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [c29]Benjamin Goldberg:
Translation Validation of Loop Optimizations and Software Pipelining in the TVOC Framework - In Memory of Amir Pnueli. SAS 2010: 6-21
2000 – 2009
- 2005
- [j8]Lenore D. Zuck, Amir Pnueli, Benjamin Goldberg, Clark W. Barrett
Translation and Run-Time Validation of Loop Transformations. Formal Methods Syst. Des. 27(3): 335-360 (2005) - [c28]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 - [c27]Cory Plock, Benjamin Goldberg, Lenore D. Zuck:
From Requirements to Specifications. ECBS 2005: 183-190 - [c26]Ying Hu, Clark W. Barrett
Validating More Loop Optimizations. COCV@ETAPS 2005: 69-84 - 2004
- [c25]Ying Hu, Clark W. Barrett, Benjamin Goldberg:
Theory and Algorithms for the Generation and Validation of Speculative Loop Optimizations. SEFM 2004: 281-289 - [c24]Benjamin Goldberg, Lenore D. Zuck, Clark W. Barrett
Into the Loops: Practical Issues in Translation Validation for Optimizing Compilers. COCV@ETAPS 2004: 53-71 - 2003
- [j7]Lenore D. Zuck, Amir Pnueli, Benjamin Goldberg:
VOC: A Methodology for the Translation Validation of OptimizingCompilers. J. Univers. Comput. Sci. 9(3): 223-247 (2003) - [c23]Clark W. Barrett
Run-Time Validation of Speculative Optimizations using CVC. RV@CAV 2003: 89-107 - 2002
- [c22]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 - [c21]Lenore D. Zuck, Amir Pnueli, Yi Fang, Benjamin Goldberg:
VOC: A Translation Validator for Optimizing Compilers. COCV@ETAPS 2002: 2-18 - [c20]Lenore D. Zuck, Amir Pnueli, Yi Fang, Benjamin Goldberg, Ying Hu:
Translation and Run-Time Validation of Optimized Code. RV@FLoC 2002: 179-200
1990 – 1999
- 1997
- [j6]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) - [c19]Cristian Ungureanu, Benjamin Goldberg:
Formal Models of Distributed Memory Management. ICFP 1997: 280-291 - [c18]Mihnea Marinescu, Benjamin Goldberg:
Partial-Evaluation Techniques for Concurrent Programs. PEPM 1997: 47-62 - [r1]Benjamin Goldberg:
Functional Programming Languages. The Computer Science and Engineering Handbook 1997: 2006-2036 - 1996
- [j5]Benjamin Goldberg:
Functional Programming Languages. ACM Comput. Surv. 28(1): 249-251 (1996) - 1995
- [j4]Young Park, Benjamin Goldberg:
Static Analysis for Optimizing Reference Counting. Inf. Process. Lett. 55(4): 229-234 (1995) - [j3]Young Gil Park, Benjamin Goldberg:
Order-of-Demand Analysis for Lazy Languages. Inf. Process. Lett. 55(6): 343-348 (1995) - 1993
- [c17]Tyng-Ruey Chuang, Benjamin Goldberg:
Real-Time Deques, Multihead Thring Machines, and Purely Functional Programming. FPCA 1993: 289-298 - 1992
- [c16]Benjamin Goldberg:
Incremental Garbage Collection Without Tags. ESOP 1992: 200-218 - [c15]Benjamin Goldberg, Michael Gloger:
Polymorphic Type Reconstruction for Garbage Collection Without Tags. LISP and Functional Programming 1992: 53-65 - [c14]Tyng-Ruey Chuang, Benjamin Goldberg:
A Syntactic Approach to Fixed Point Computation on Finite Domains. LISP and Functional Programming 1992: 109-118 - [c13]Young Gil Park, Benjamin Goldberg:
Escape Analysis on Lists. PLDI 1992: 116-127 - [c12]Young Gil Park, Benjamin Goldberg:
Order-of-Demand Analysis for Lazy Languages. WSA 1992: 91-101 - 1991
- [c11]Young Gil Park, Benjamin Goldberg:
Reference Escape Analysis: Optimizing Reference Counting based on the Lifetime of References. PEPM 1991: 178-189 - [c10]Benjamin Goldberg:
Tag-Free Garbage Collection for Strongly Typed Programming Languages. PLDI 1991: 165-176 - 1990
- [c9]Benjamin Goldberg, Young Gil Park:
Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program Implementations. ESOP 1990: 152-160
1980 – 1989
- 1989
- [c8]Benjamin Goldberg:
Generational Reference Counting: A Reduced-Communication Distributed Storage Reclamation Scheme. PLDI 1989: 313-321 - 1988
- [j2]Benjamin Goldberg:
Multiprocessor execution of functional programs. Int. J. Parallel Program. 17(5): 425-473 (1988) - [c7]Benjamin Goldberg, Paul Hudak:
Implementing functional programs on a hypercube multiprocessor. C³P 1988: 489-504 - [c6]Benjamin Goldberg:
Buckwheat: Graph Reduction on a Shared-Memory Multiprocessor. LISP and Functional Programming 1988: 40-51 - 1987
- [c5]Benjamin Goldberg:
Detecting sharing of partial applications in functional programs. FPCA 1987: 408-425 - 1986
- [c4]Benjamin Goldberg, Paul Hudak:
Alfalfa: Distributed graph reduction on a hypercube multiprocessor. Graph Reduction 1986: 94-113 - 1985
- [j1]Paul Hudak, Benjamin Goldberg:
Distributed Execution of Functional Programs Using Serial Combinators. IEEE Trans. Computers 34(10): 881-891 (1985) - [c3]Paul Hudak, Benjamin Goldberg:
Serial Combinators: "Optimal" Grains of Parallelism. FPCA 1985: 382-399 - [c2]Paul Hudak, Benjamin Goldberg:
Efficient Distributed Evaluation of Functional Programs Using Serial Combinators. ICPP 1985: 831-839 - 1984
- [c1]Paul Hudak, Benjamin Goldberg:
Experiments in Diffused Combinator Reduction. LISP and Functional Programming 1984: 167-176
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 2025-04-03 00:15 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: