refs.opt 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546
  1. %T Principles of compiler design
  2. %A A.V. Aho
  3. %A J.D. Ullman
  4. %I Addison-Wesley
  5. %C Reading, Massachusetts
  6. %D 1978
  7. %T The Design and Analysis of Computer Algorithms
  8. %A A.V. Aho
  9. %A J.E. Hopcroft
  10. %A J.D. Ullman
  11. %I Addison-Wesley
  12. %C Reading, Massachusetts
  13. %D 1974
  14. %T Code generation in a machine-independent compiler
  15. %A R.G.G. Cattell
  16. %A J.M. Newcomer
  17. %A B.W. Leverett
  18. %J SIGPLAN Notices
  19. %V 14
  20. %N 8
  21. %P 65-75
  22. %D August 1979
  23. %T An algorithm for Reduction of Operator Strength
  24. %A J. Cocke
  25. %A K. Kennedy
  26. %J CACM
  27. %V 20
  28. %N 11
  29. %P 850-856
  30. %D November 1977
  31. %T Reduction of Operator Strength
  32. %A F.E. Allen
  33. %A J. Cocke
  34. %A K. Kennedy
  35. %B Program Flow Analysis
  36. %E S.S. Muchnick and D. Jones
  37. %I Prentice-Hall
  38. %C Englewood Cliffs, N.J.
  39. %D 1981
  40. %T Simplifying Code Generation Through Peephole Optimization
  41. %A J.W. Davidson
  42. %R Ph.D. thesis
  43. %I Dept. of Computer Science
  44. %C Univ. of Arizona
  45. %D December 1981
  46. %T A study of selective optimization techniques
  47. %A G.R. Katkus
  48. %R Ph.D. Thesis
  49. %C University of Southern California
  50. %D 1973
  51. %T Automatic subroutine generation in an optimizing compiler
  52. %A J.B. Shaffer
  53. %R Ph.D. Thesis
  54. %C University of Maryland
  55. %D 1978
  56. %T Optimal mixed code generation for microcomputers
  57. %A D.S. Photopoulos
  58. %R Ph.D. Thesis
  59. %C Northeastern University
  60. %D 1981
  61. %T The Design of an Optimizing Compiler
  62. %A W.A. Wulf
  63. %A R.K. Johnsson
  64. %A C.B. Weinstock
  65. %A S.O. Hobbs
  66. %A C.M. Geschke
  67. %I American Elsevier Publishing Company
  68. %C New York
  69. %D 1975
  70. %T Retargetable Compiler Code Generation
  71. %A M. Ganapathi
  72. %A C.N. Fischer
  73. %A J.L. Hennessy
  74. %J ACM Computing Surveys
  75. %V 14
  76. %N 4
  77. %P 573-592
  78. %D December 1982
  79. %T An Optimizing Pascal Compiler
  80. %A R.N. Faiman
  81. %A A.A. Kortesoja
  82. %J IEEE Trans. on Softw. Eng.
  83. %V 6
  84. %N 6
  85. %P 512-518
  86. %D November 1980
  87. %T Experience with the SETL Optimizer
  88. %A S.M. Freudenberger
  89. %A J.T. Schwartz
  90. %J TOPLAS
  91. %V 5
  92. %N 1
  93. %P 26-45
  94. %D Januari 1983
  95. %T An Optimizing Ada Compiler
  96. %A W. Kirchgaesner
  97. %A J. Uhl
  98. %A G. Winterstein
  99. %A G. Goos
  100. %A M. Dausmann
  101. %A S. Drossopoulou
  102. %I Institut fur Informatik II, Universitat Karlsruhe
  103. %D February 1983
  104. %T A Fast Algorithm for Finding Dominators
  105. in a Flowgraph
  106. %A T. Lengauer
  107. %A R.E. Tarjan
  108. %J TOPLAS
  109. %V 1
  110. %N 1
  111. %P 121-141
  112. %D July 1979
  113. %T Optimization of hierarchical directed graphs
  114. %A M.T. Lepage
  115. %A D.T. Barnard
  116. %A A. Rudmik
  117. %J Computer Languages
  118. %V 6
  119. %N 1
  120. %P 19-34
  121. %D Januari 1981
  122. %T Object Code Optimization
  123. %A E.S. Lowry
  124. %A C.W. Medlock
  125. %J CACM
  126. %V 12
  127. %N 1
  128. %P 13-22
  129. %D Januari 1969
  130. %T Automatic Program Improvement:
  131. Variable Usage Transformations
  132. %A B. Maher
  133. %A D.H. Sleeman
  134. %J TOPLAS
  135. %V 5
  136. %N 2
  137. %P 236-264
  138. %D April 1983
  139. %T The design of a global optimizer
  140. %A R.J. Mintz
  141. %A G.A. Fisher
  142. %A M. Sharir
  143. %J SIGPLAN Notices
  144. %V 14
  145. %N 9
  146. %P 226-234
  147. %D September 1979
  148. %T Global Optimization by Suppression of Partial Redundancies
  149. %A E. Morel
  150. %A C. Renvoise
  151. %J CACM
  152. %V 22
  153. %N 2
  154. %P 96-103
  155. %D February 1979
  156. %T Efficient Computation of Expressions with Common Subexpressions
  157. %A B. Prabhala
  158. %A R. Sethi
  159. %J JACM
  160. %V 27
  161. %N 1
  162. %P 146-163
  163. %D Januari 1980
  164. %T An Analysis of Inline Substitution for a Structured
  165. Programming Language
  166. %A R.W. Scheifler
  167. %J CACM
  168. %V 20
  169. %N 9
  170. %P 647-654
  171. %D September 1977
  172. %T Immediate Predominators in a Directed Graph
  173. %A P.W. Purdom
  174. %A E.F. Moore
  175. %J CACM
  176. %V 15
  177. %N 8
  178. %P 777-778
  179. %D August 1972
  180. %T The Generation of Optimal Code for Arithmetic Expressions
  181. %A R. Sethi
  182. %A J.D. Ullman
  183. %J JACM
  184. %V 17
  185. %N 4
  186. %P 715-728
  187. %D October 1970
  188. %T Exposing side-effects in a PL/I optimizing compiler
  189. %A T.C. Spillman
  190. %B Information Processing 1971
  191. %I North-Holland Publishing Company
  192. %C Amsterdam
  193. %P 376-381
  194. %D 1971
  195. %T Inner Loops in Flowgraphs and Code Optimization
  196. %A S. Vasudevan
  197. %J Acta Informatica
  198. %N 17
  199. %P 143-155
  200. %D 1982
  201. %T A New Strategy for Code Generation - the General-Purpose
  202. Optimizing Compiler
  203. %A W.H. Harrison
  204. %J IEEE Trans. on Softw. Eng.
  205. %V 5
  206. %N 4
  207. %P 367-373
  208. %D July 1979
  209. %T PQCC: A Machine-Relative Compiler Technology
  210. %A W.M. Wulf
  211. %R CMU-CS-80-144
  212. %I Carnegie-Mellon University
  213. %C Pittsburgh
  214. %D 25 september 1980
  215. %T Machine-independent Pascal code optimization
  216. %A D.R. Perkins
  217. %A R.L. Sites
  218. %J SIGPLAN Notices
  219. %V 14
  220. %N 8
  221. %P 201-207
  222. %D August 1979
  223. %T A Case Study of a New Code Generation Technique for Compilers
  224. %A J.L. Carter
  225. %J CACM
  226. %V 20
  227. %N 12
  228. %P 914-920
  229. %D December 1977
  230. %T Table-driven Code Generation
  231. %A S.L. Graham
  232. %J IEEE Computer
  233. %V 13
  234. %N 8
  235. %P 25-33
  236. %D August 1980
  237. %T Register Allocation in Optimizing Compilers
  238. %A B.W. Leverett
  239. %R Ph.D. Thesis, CMU-CS-81-103
  240. %I Carnegie-Mellon University
  241. %C Pittsburgh
  242. %D February 1981
  243. %T Register Allocation via Coloring
  244. %A G.J. Chaitin
  245. %A M.A. Auslander
  246. %A A.K. Chandra
  247. %A J. Cocke
  248. %A M.E. Hopkins
  249. %A P.W. Markstein
  250. %J Computer Languages
  251. %V 6
  252. %N 1
  253. %P 47-57
  254. %D January 1981
  255. %T How to Call Procedures, or Second Thoughts on
  256. Ackermann's Function
  257. %A B.A. Wichmann
  258. %J Software - Practice and Experience
  259. %V 7
  260. %P 317-329
  261. %D 1977
  262. %T Register Allocation Via Usage Counts
  263. %A R.A. Freiburghouse
  264. %J CACM
  265. %V 17
  266. %N 11
  267. %P 638-642
  268. %D November 1974
  269. %T Machine-independent register allocation
  270. %A R.L. Sites
  271. %J SIGPLAN Notices
  272. %V 14
  273. %N 8
  274. %P 221-225
  275. %D August 1979
  276. %T An Overview of the Production-Quality Compiler-Compiler Project
  277. %A B.W. Leverett
  278. %A R.G.G Cattell
  279. %A S.O. Hobbs
  280. %A J.M. Newcomer
  281. %A A.H. Reiner
  282. %A B.R. Schatz
  283. %A W.A. Wulf
  284. %J IEEE Computer
  285. %V 13
  286. %N 8
  287. %P 38-49
  288. %D August 1980
  289. %T An Overview of the Production-Quality Compiler-Compiler Project
  290. %A B.W. Leverett
  291. %A R.G.G Cattell
  292. %A S.O. Hobbs
  293. %A J.M. Newcomer
  294. %A A.H. Reiner
  295. %A B.R. Schatz
  296. %A W.A. Wulf
  297. %R CMU-CS-79-105
  298. %I Carnegie-Mellon University
  299. %C Pittsburgh
  300. %D 1979
  301. %T Topics in Code Generation and Register Allocation
  302. %A B.W. Leverett
  303. %R CMU-CS-82-130
  304. %I Carnegie-Mellon University
  305. %C Pittsburgh
  306. %D 28 July 1982
  307. %T Predicting the Effects of Optimization on a Procedure Body
  308. %A J.E. Ball
  309. %J SIGPLAN Notices
  310. %V 14
  311. %N 8
  312. %P 214-220
  313. %D August 1979
  314. %T The C Language Calling Sequence
  315. %A S.C. Johnson
  316. %A D.M. Ritchie
  317. %I Bell Laboratories
  318. %C Murray Hill, New Jersey
  319. %D September 1981
  320. %T A Generalization of Two Code Ordering Optimizations
  321. %A C.W. Fraser
  322. %R TR 82-11
  323. %I Department of Computer Science
  324. %C The University of Arizona, Tucson
  325. %D October 1982
  326. %T A Survey of Data Flow Analysis Techniques
  327. %A K. Kennedy
  328. %B Program Flow Analysis
  329. %E S.S. Muchnick and D. Jones
  330. %I Prentice-Hall
  331. %C Englewood Cliffs
  332. %D 1981
  333. %T Delayed Binding in PQCC Generated Compilers
  334. %A W.A. Wulf
  335. %A K.V. Nori
  336. %R CMU-CS-82-138
  337. %I Carnegie-Mellon University
  338. %C Pittsburgh
  339. %D 1982
  340. %T Interprocedural Data Flow Analysis in the presence
  341. of Pointers, Procedure Variables, and Label Variables
  342. %A W.E. Weihl
  343. %J Conf. Rec. of the 7th ACM Symp. on Principles of
  344. Programming Languages
  345. %C Las Vegas, Nevada
  346. %P 83-94
  347. %D 1980
  348. %T Low-Cost, High-Yield Code Optimization
  349. %A D.R. Hanson
  350. %R TR 82-17
  351. %I Department of Computer Science
  352. %C The University of Arizona, Tucson
  353. %D November 1982
  354. %T Program Flow Analysis
  355. %E S.S. Muchnick and D. Jones
  356. %I Prentice-Hall
  357. %C Englewood Cliffs
  358. %D 1981
  359. %T A machine independent algorithm for code generation and its
  360. use in retargetable compilers
  361. %A R. Glanville
  362. %R Ph.D. thesis
  363. %C University of California, Berkeley
  364. %D December 1977
  365. %T A formal framework for the derivation of machine-specific optimizers
  366. %A R. Giegerich
  367. %J TOPLAS
  368. %V 5
  369. %N 3
  370. %P 478-498
  371. %D July 1983
  372. %T Engineering a compiler: Vax-11 code generation and optimization
  373. %A P. Anklam
  374. %A D. Cutler
  375. %A R. Heinen
  376. %A M. MacLaren
  377. %I Digital Equipment Corporation
  378. %D 1982
  379. %T Analyzing exotic instructions for a retargetable code generator
  380. %A T.M. Morgan
  381. %A L.A. Rowe
  382. %J SIGPLAN Notices
  383. %V 17
  384. %N 6
  385. %P 197-204
  386. %D June 1982
  387. %T TCOLAda and the Middle End of the PQCC Ada Compiler
  388. %A B.M. Brosgol
  389. %J SIGPLAN Notices
  390. %V 15
  391. %N 11
  392. %P 101-112
  393. %D November 1980
  394. %T Implementation Implications of Ada Generics
  395. %A G. Bray
  396. %J Ada Letters
  397. %V III
  398. %N 2
  399. %P 62-71
  400. %D September 1983
  401. %T Attributed Linear Intermediate Representations for Retargetable
  402. Code Generators
  403. %A M. Ganapathi
  404. %A C.N. Fischer
  405. %J Software-Practice and Experience
  406. %V 14
  407. %N 4
  408. %P 347-364
  409. %D April 1984
  410. %T UNCOL: The myth and the fact
  411. %A T.B. Steel
  412. %J Annu. Rev. Autom. Program.
  413. %V 2
  414. %D 1960
  415. %P 325-344
  416. %T Experience with a Graham-Glanville Style Code Generator
  417. %A P. Aigrain
  418. %A S.L. Graham
  419. %A R.R. Henry
  420. %A M.K. McKusick
  421. %A E.P. Llopart
  422. %J SIGPLAN Notices
  423. %V 19
  424. %N 6
  425. %D June 1984
  426. %P 13-24
  427. %T Using Dynamic Programming to generate Optimized Code in a
  428. Graham-Glanville Style Code Generator
  429. %A T.W. Christopher
  430. %A P.J. Hatcher
  431. %A R.C. Kukuk
  432. %J SIGPLAN Notices
  433. %V 19
  434. %N 6
  435. %D June 1984
  436. %P 25-36
  437. %T Peep - An Architectural Description Driven Peephole Optimizer
  438. %A R.R. Kessler
  439. %J SIGPLAN Notices
  440. %V 19
  441. %N 6
  442. %D June 1984
  443. %P 106-110
  444. %T Automatic Generation of Peephole Optimizations
  445. %A J.W. Davidson
  446. %A C.W. Fraser
  447. %J SIGPLAN Notices
  448. %V 19
  449. %N 6
  450. %D June 1984
  451. %P 111-116
  452. %T Analysing and Compressing Assembly Code
  453. %A C.W. Fraser
  454. %A E.W. Myers
  455. %A A.L. Wendt
  456. %J SIGPLAN Notices
  457. %V 19
  458. %N 6
  459. %D June 1984
  460. %P 117-121
  461. %T Register Allocation by Priority-based Coloring
  462. %A F. Chow
  463. %A J. Hennessy
  464. %J SIGPLAN Notices
  465. %V 19
  466. %N 6
  467. %D June 1984
  468. %P 222-232
  469. %V 19
  470. %N 6
  471. %D June 1984
  472. %P 117-121
  473. %T Code Selection through Object Code Optimization
  474. %A J.W. Davidson
  475. %A C.W. Fraser
  476. %I Dept. of Computer Science
  477. %C Univ. of Arizona
  478. %D November 1981
  479. %T A Portable Machine-Independent Global Optimizer - Design
  480. and Measurements
  481. %A F.C. Chow
  482. %I Computer Systems Laboratory
  483. %C Stanford University
  484. %D December 1983