Travelled to:
1 × Canada
2 × Sweden
8 × USA
Collaborated with:
∅ C.W.Fraser C.N.Fischer D.R.Hanson B.R.Whaley S.A.Watterson D.R.Engler P.Jalote R.Munshi J.Ernst W.S.Evans S.Lucco
Talks about:
code (4) generat (3) optim (3) effici (2) simpl (2) dynam (2) tree (2) architectur (1) superoper (1) probalist (1)
Person: Todd A. Proebsting
DBLP: Proebsting:Todd_A=
Contributed to:
Wrote 13 papers:
- CBSE-2006-JaloteMP #component
- Components Have Test Buddies (PJ, RM, TAP), pp. 310–319.
- PLDI-2001-HansonP
- Dynamic Variables (DRH, TAP), pp. 264–273.
- PLDI-1999-FraserP #code generation
- Finite-Static Code Generation (CWF, TAP), pp. 270–280.
- PLDI-1997-ErnstEFLP
- Code Compression (JE, WSE, CWF, SL, TAP), pp. 358–365.
- PLDI-1997-Proebsting #evaluation
- Simple Translation of Goal-Directed Evaluation (TAP), pp. 1–6.
- CC-1996-ProebstingW #parsing
- One-Pass, Optimal Tree Parsing — With Or Without Trees (TAP, BRW), pp. 294–308.
- POPL-1996-ProebstingW
- Filter Fusion (TAP, SAW), pp. 119–130.
- POPL-1995-Proebsting #c #interpreter #optimisation
- Optimizing an ANSI C Interpreter with Superoperators (TAP), pp. 322–332.
- ASPLOS-1994-EnglerP #code generation #definite clause grammar #named #performance
- DCG: An Efficient, Retargetable Dynamic Code Generation System (DRE, TAP), pp. 263–272.
- POPL-1994-ProebstingF #detection #pipes and filters
- Detecting Pipeline Structural Hazards Quickly (TAP, CWF), pp. 280–286.
- PLDI-1992-Proebsting #generative #performance
- Simple and Efficient BURS Table Generation (TAP), pp. 331–340.
- PLDI-1992-ProebstingF
- Probalistic Register Allocation (TAP, CNF), pp. 300–310.
- PLDI-1991-ProebstingF #architecture #linear #scheduling
- Linear-Time, Optimal Code Scheduling for Delayed-Load Architectures (TAP, CNF), pp. 256–267.