Travelled to:
1 × Canada
1 × China
1 × United Kingdom
2 × Denmark
2 × The Netherlands
3 × France
7 × USA
Collaborated with:
∅ Y.G.Park T.Chuang P.Hudak C.W.Barrett Y.Hu C.Ungureanu M.Marinescu M.Gloger A.Pnueli Y.Fang L.D.Zuck Sam Snodgrass Ariel Evans Brandon Packard Cathy Lu Jichen Zhu
Talks about:
optim (7) program (5) analysi (4) valid (4) refer (4) function (3) collect (3) memori (3) garbag (3) escap (3)
Person: Benjamin Goldberg
DBLP: Goldberg:Benjamin
Contributed to:
Wrote 21 papers:
- SAS-2010-Goldberg #framework #in memory #memory management #optimisation #pipes and filters #validation
- Translation Validation of Loop Optimizations and Software Pipelining in the TVOC Framework — In Memory of Amir Pnueli (BG), pp. 6–21.
- CAV-2005-BarrettFGHPZ #compilation #named #optimisation #validation
- TVOC: A Translation Validator for Optimizing Compilers (CWB, YF, BG, YH, AP, LDZ), pp. 291–295.
- COCV-J-2005-HuBGP #optimisation #validation
- Validating More Loop Optimizations (YH, CWB, BG, AP), pp. 69–84.
- SEFM-2004-HuBG #algorithm #generative #optimisation #validation
- Theory and Algorithms for the Generation and Validation of Speculative Loop Optimizations (YH, CWB, BG), pp. 281–289.
- ICFP-1997-UngureanuG #distributed #formal method #memory management #modelling
- Formal Models of Distributed Memory Management (CU, BG), pp. 280–291.
- PEPM-1997-MarinescuG #concurrent #source code
- Partial-Evaluation Techniques for Concurrent Programs (MM, BG), pp. 47–62.
- FPCA-1993-ChuangG #functional #multi #programming #realtime
- Real-Time Deques, Multihead Thring Machines, and Purely Functional Programming (TRC, BG), pp. 289–298.
- ESOP-1992-Goldberg #garbage collection #incremental
- Incremental Garbage Collection Without Tags (BG), pp. 200–218.
- LFP-1992-ChuangG #approach #finite #fixpoint
- A Syntactic Approach to Fixed Point Computation on Finite Domains (TRC, BG), pp. 109–118.
- LFP-1992-GoldbergG #garbage collection #polymorphism #re-engineering
- Polymorphic Type Reconstruction for Garbage Collection Without Tags (BG, MG), pp. 53–65.
- PLDI-1992-ParkG #analysis
- Escape Analysis on Lists (YGP, BG), pp. 116–127.
- WSA-1992-ParkG #analysis #lazy evaluation
- Order-of-Demand Analysis for Lazy Languages (YGP, BG), pp. 91–101.
- PEPM-1991-ParkG #analysis #optimisation
- Reference Escape Analysis: Optimizing Reference Counting based on the Lifetime of References (YGP, BG), pp. 178–189.
- PLDI-1991-Goldberg #garbage collection #programming language
- Tag-Free Garbage Collection for Strongly Typed Programming Languages (BG), pp. 165–176.
- ESOP-1990-GoldbergP #analysis #functional #higher-order #implementation #optimisation #stack
- Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program Implementations (BG, YGP), pp. 152–160.
- PLDI-1989-Goldberg #distributed
- Generational Reference Counting: A Reduced-Communication Distributed Storage Reclamation Scheme (BG), pp. 313–321.
- LFP-1988-Goldberg #graph #multi #named #reduction
- Buckwheat: Graph Reduction on a Shared-Memory Multiprocessor (BG), pp. 40–51.
- FPCA-1987-Goldberg #detection #functional #source code
- Detecting sharing of partial applications in functional programs (BG), pp. 408–425.
- FPCA-1985-HudakG85 #combinator #parallel
- Serial Combinators: “Optimal” Grains of Parallelism (PH, BG), pp. 382–399.
- LFP-1984-HudakG #combinator #reduction
- Experiments in Diffused Combinator Reduction (PH, BG), pp. 167–176.
- CHI-PLAY-2014-SnodgrassGEPLZ
- Extended abstract for Canvas Obscura (SS, BG, AE, BP, CL, JZ), pp. 379–382.