-
Notifications
You must be signed in to change notification settings - Fork 0
/
thesis.bib
460 lines (428 loc) · 14.3 KB
/
thesis.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
@book{Forth,
author = {{American National Standards Institute} and {Computer and
Business Equipment Manufacturers Association}},
title = {{American National Standard} for information systems:
programming languages: {Forth}: {ANSI/X3.215-1994}},
publisher = {American National Standards Institute},
day = {24},
month = mar,
year = {1994},
}
@online{Cat,
author = {Christopher Diggins},
title = {The Cat Programming Language},
year = {2007},
url = {http://cat-language.com/},
urldate = {2011-09-01}
}
@book{PostScript,
author = {{Adobe Systems Incorporated}},
title = {{PostScript} Language Reference},
publisher = {Addison-Wesley},
edition = {Third edition},
year = {1999},
isbn = {0-201-37922-8},
url = {http://partners.adobe.com/public/developer/en/ps/PLRM.pdf},
urldate = {2011-09-01}
}
@inproceedings{DLS,
author = {Slava Pestov and Daniel Ehrenberg and Joe Groff},
title = {Factor: A Dynamic Stack-based Programming Language},
booktitle = {Proceedings of the 6th Symposium on Dynamic languages},
series = {DLS '10},
year = {2010},
isbn = {978-1-4503-0405-4},
pages = {43--58},
numpages = {16},
url = {http://doi.acm.org/10.1145/1869631.1869637},
publisher = {ACM},
}
@inproceedings{GGC,
author = {Paul R. Wilson},
title = {Uniprocessor Garbage Collection Techniques},
booktitle = {Proceedings of the International Workshop on Memory Management},
series = {IWMM '92},
year = {1992},
isbn = {3-540-55940-X},
pages = {1--42},
numpages = {42},
url = {http://portal.acm.org/citation.cfm?id=645648.664824},
publisher = {Springer-Verlag},
}
@article{SSA,
author = {Ron Cytron and Jeanne Ferrante and Barry K. Rosen and Mark N.
Wegman and F. Kenneth Zadeck},
title = {Efficiently Computing Static Single Assignment Form and the
Control Dependence Graph},
journal = {ACM Transactions Programming Languages and Systems},
volume = {13},
issue = {4},
month = oct,
year = {1991},
issn = {0164-0925},
pages = {451--490},
numpages = {40},
url =
{http://www.eecs.umich.edu/~mahlke/583w03/reading/cytron_toplas_91.pdf},
urldate = {2011-09-01},
doi = {http://doi.acm.org/10.1145/115372.115320},
acmid = {115320},
publisher = {ACM},
}
@article{SCCP,
author = {Mark N. Wegman and F. Kenneth Zadeck},
title = {Constant Propagation with Conditional Branches},
journal = {ACM Transactions on Programming Languages and Systems},
volume = {13},
issue = {2},
month = apr,
year = {1991},
issn = {0164-0925},
pages = {181--210},
numpages = {30},
url = {http://doi.acm.org/10.1145/103135.103136},
doi = {http://doi.acm.org/10.1145/103135.103136},
acmid = {103136},
publisher = {ACM},
}
@article{construct-ssa,
author = {Preston Briggs and Keith D. Cooper and Timothy J. Harvey and L.
Taylor Simpson},
title = {Practical Improvements to the Construction and Destruction of
Static Single Assignment Form},
journal = {Software---Practice \& Experience},
volume = {28},
issue = {8},
month = jul,
year = {1998},
issn = {0038-0644},
pages = {859--881},
numpages = {23},
url = {http://portal.acm.org/citation.cfm?id=295545.295551},
acmid = {295551},
publisher = {John Wiley \& Sons, Inc.},
}
@article{TDMSC,
author = {Dibyendu Das and U. Ramakrishna},
title = {A Practical and Fast Iterative Algorithm for $\phi$-function
Computation using DJ Graphs},
journal = {ACM Transactions Programming Languages and Systems},
volume = {27},
issue = {3},
month = may,
year = {2005},
issn = {0164-0925},
pages = {426--440},
numpages = {15},
url = {http://doi.acm.org/10.1145/1065887.1065890},
doi = {http://doi.acm.org/10.1145/1065887.1065890},
acmid = {1065890},
publisher = {ACM},
}
% AWZ based on Hopcroft's DFA minimization algorithm
@techreport{Hopcroft,
author = {John E. Hopcroft},
title = {An n log n Algorithm for Minimizing States in a Finite
Automaton},
year = {1971},
institution = {Stanford University},
address = {Stanford, CA, USA},
}
% GVN -- intro SSA
@inproceedings{AWZ,
author = {Bowen Alpern and Mark N. Wegman and F. Kenneth Zadeck},
title = {Detecting Equality of Variables in Programs},
booktitle = {Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on
Principles of Programming Languages},
series = {POPL '88},
year = {1988},
isbn = {0-89791-252-7},
pages = {1--11},
numpages = {11},
url = {http://doi.acm.org/10.1145/73560.73561},
doi = {http://doi.acm.org/10.1145/73560.73561},
acmid = {73561},
publisher = {ACM},
}
%Using AWZ for limited Redundancy Elimination -- intro SSA
@inproceedings{RWZ,
author = {Barry K. Rosen and Mark N. Wegman and F. Kenneth Zadeck},
title = {Global Value Numbers and Redundant Computations},
booktitle = {Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on
Principles of Programming Languages},
series = {POPL '88},
year = {1988},
isbn = {0-89791-252-7},
pages = {12--27},
numpages = {16},
url = {http://doi.acm.org/10.1145/73560.73562},
doi = {http://doi.acm.org/10.1145/73560.73562},
acmid = {73562},
publisher = {ACM},
}
% Hash-based (not-so-G)VN
@techreport{Cocke,
author = {John Cocke and Jacob T. Schwartz},
title = {Programming Languages and Their Compilers: Preliminary Notes},
institution = {Courant Institute of Mathematical Sciences, New York
Univeristy},
year = {1970}
}
% Hash-based (moreso-but-not-quite-G)VN
@inbook{ch7,
author = {Bowen Alpern and F. Kenneth Zadeck},
chapter = {7},
title = {Value Numbering},
booktitle = {Optimization in Compilers},
year = {1992},
publisher = {ACM Press and Addison-Wesley},
url = {http://www.cs.ucr.edu/~gupta/teaching/553-07/Papers/value.pdf},
urldate = {2011-09-01},
pubstate = inpreparation
}
% SSC-based GVN
@phdthesis{Simpson,
author = {Loren Taylor Simpson},
title = {Value-Driven Redundancy Elimination},
month = apr,
year = {1996},
school = {Rice University},
address = {Houston, TX, USA}
}
% Incorporate more optimizations than SCC-GVN; balanced vs. global vs. local
@inproceedings{Gargi,
author = {Karthik Gargi},
title = {A Sparse Algorithm for Predicated Global Value Numbering},
booktitle = {Proceedings of the ACM SIGPLAN 2002 Conference on Programming
Language Design and Implementation},
series = {PLDI '02},
year = {2002},
isbn = {1-58113-463-0},
pages = {45--56},
numpages = {12},
url = {http://doi.acm.org/10.1145/512529.512536},
doi = {http://doi.acm.org/10.1145/512529.512536},
acmid = {512536},
publisher = {ACM},
}
% PRE invention
@article{PRE,
author = {E. Morel and C. Renvoise},
title = {Global Optimization by Suppression of Partial Redundancies},
journal = {Communications of the ACM},
volume = {22},
issue = 2,
month = feb,
year = {1979},
issn = {0001-0782},
pages = {96--103},
numpages = 8,
url = {http://doi.acm.org/10.1145/359060.359069},
doi = {http://doi.acm.org/10.1145/359060.359069},
acmid = {359069},
publisher = {ACM},
address = {New York, NY, USA},
}
% PRE; see also Bodik, if start going into PRE more deeply
@phdthesis{VanDrunen,
author = {Thomas John VanDrunen},
title = {Partial Redundancy Elimination for Global Value Numbering},
month = aug,
year = {2004},
isbn = {0-496-15310-2},
school = {Purdue University},
address = {West Lafayette, IN, USA},
}
% Combining GVN with other optimizations
@phdthesis{Click,
author = {Clifford Noel Click},
title = {Combining Analyses, Combining Optimizations},
school = {Rice University},
month = feb,
year = {1995},
address = {Houston, TX, USA}
}
% Precursor to Abstract Interpretation GVN
@inproceedings{Kildall,
author = {Gary A. Kildall},
title = {A Unified Approach to Global Program Optimization},
booktitle = {Proceedings of the 1st ACM SIGACT-SIGPLAN Symposium on
Principles of Programming Languages},
series = {POPL '73},
year = {1973},
pages = {194--206},
numpages = {13},
url = {http://doi.acm.org/10.1145/512927.512945},
doi = {http://doi.acm.org/10.1145/512927.512945},
acmid = {512945},
publisher = {ACM},
}
% Definition of Abstract Interpretation
@inproceedings{Cousot,
author = {Patrick Cousot and Radhia Cousot},
title = {Abstract Interpretation: A Unified Lattice Model for Static
Analysis of Programs by Construction or Approximation of
Fixpoints},
booktitle = {Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on
Principles of Programming Languages},
series = {POPL '77},
year = {1977},
pages = {238--252},
numpages = {15},
url = {http://doi.acm.org/10.1145/512950.512973},
doi = {http://doi.acm.org/10.1145/512950.512973},
acmid = {512973},
publisher = {ACM},
}
% Start of ``theoretical'' line
@inproceedings{Steffen,
author = {Bernhard Steffen},
title = {Optimal Run Time Optimization Proved By A New Look at Abstract
Interpretations},
booktitle = {The International Joint Conference on Theory and Practice of
Software Development on TAPSOFT '87},
year = {1987},
isbn = {0-387-17660-8},
pages = {52--68},
numpages = {17},
url = {http://portal.acm.org/citation.cfm?id=29580.29585},
acmid = {29585},
publisher = {Springer-Verlag},
}
% Value Flow Graphs vs. SSA; using Abstract Interpretation for GVN
% RKS vs. SKR?
@inproceedings{RKS,
author = {Oliver R\"uthing and Jens Knoop and Bernhard Steffen},
title = {Detecting Equalities of Variables: Combining Efficiency with
Precision},
booktitle = {Proceedings of the 6th International Symposium on Static
Analysis},
series = {SAS '99},
year = {1999},
isbn = {3-540-66459-9},
pages = {232--247},
numpages = {16},
url = {http://portal.acm.org/citation.cfm?id = 647168.718137},
acmid = {718137},
publisher = {Springer-Verlag},
}
% Novel Approaches: Random Interpretation GVN
@inproceedings{Gulwani04,
author = {Sumit Gulwani and George C. Necula},
title = {Global Value Numbering Using Random Interpretation},
booktitle = {Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on
Principles of Programming Languages},
series = {POPL '04},
year = {2004},
isbn = {1-58113-729-X},
pages = {342--352},
numpages = {11},
url = {http://doi.acm.org/10.1145/964001.964030},
doi = {http://doi.acm.org/10.1145/964001.964030},
acmid = {964030},
publisher = {ACM},
}
% Novel Approaches: O(n) Complete GVN
% Note: Criticisms of other algorithms
% AWZ incomplete; treats phi as uninterpreted
% RKS incomplete; introduces a degree of pessimism
@article{Gulwani07,
author = {Sumit Gulwani and George C. Necula},
title = {A Polynomial-Time Algorithm for Global Value Numbering},
journal = {Science of Computer Programming},
volume = {64},
issue = 1,
month = jan,
year = {2007},
issn = {0167-6423},
pages = {97--114},
numpages = {18},
url = {http://portal.acm.org/citation.cfm?id = 1222241.1222599},
doi = {10.1016/j.scico.2006.03.005},
acmid = {1222599},
publisher = {Elsevier North-Holland, Inc.},
}
% Latest
@inproceedings{Nie,
author = {Jiu-Tao Nie and Xu Cheng},
title = {An Efficient SSA-Based Algorithm for Complete Global Value
Numbering},
booktitle = {Proceedings of the 5th Asian Conference on Programming Languages
and Systems},
series = {APLAS '07},
year = {2007},
isbn = {3-540-76636-7, 978-3-540-76636-0},
pages = {319--334},
numpages = {16},
url = {http://portal.acm.org/citation.cfm?id = 1784774.1784806},
acmid = {1784806},
publisher = {Springer-Verlag},
}
%%% Auxiliary citations
@book{DragonBook,
title = {Compilers: Principles, Techniques, \& Tools},
author = {Alfred V. Aho and Monica S. Lam and Ravi Sethi and Jeffrey D.
Ullman},
publisher = {Addison-Wesley},
year = {2007},
edition = {Second edition}
}
@article{Tarjan,
author = {Robert Tarjan},
journal = {SIAM Journal on Computing},
number = 2,
pages = {146--160},
publisher = {SIAM},
title = {{Depth-First Search and Linear Graph Algorithms}},
volume = 1,
year = {1972}
}
@article{SSAConstruction,
author = {Gianfranco Bilardi and Keshav Pingali},
title = {Algorithms for Computing the Static Single Assignment Form},
journal = {Journal of the ACM},
volume = {50},
issue = 3,
month = may,
year = {2003},
issn = {0004-5411},
pages = {375--425},
numpages = {51},
url = {http://doi.acm.org/10.1145/765568.765573},
doi = {http://doi.acm.org/10.1145/765568.765573},
acmid = {765573},
publisher = {ACM},
}
@article{Completeness,
author = {Roberto Giacobazzi and Francesco Ranzato and Francesca Scozzari},
title = {Making Abstract Interpretations Complete},
journal = {Journal of the ACM},
volume = {47},
issue = 2,
month = mar,
year = {2000},
issn = {0004-5411},
pages = {361--416},
numpages = {56},
url = {http://doi.acm.org/10.1145/333979.333989},
doi = {http://doi.acm.org/10.1145/333979.333989},
acmid = {333989},
publisher = {ACM},
}
@phdthesis{Biggar,
author = {Paul Biggar},
title = {Design and Implementation of an Ahead-of-Time Compiler for PHP},
school = {Trinity College, Dublin},
year = {2009},
month = oct,
url = {http://www.paulbiggar.com/research/wip-thesis.pdf},
urldate = {2011-09-01}
}
@misc{young-factor,
title = {Factor},
url = {http://concatenative.org/wiki/view/Factor},
urldate = {2011-09-01},
note = {From Factor's documentation wiki.},
year = {2010},
month = sep
}