Re: retargetable compilers?

I only reproduce here part of the bibliography of my PhD thesis.
If you are interested for more recent publications in the domain, you could
either email me in private, or take a look at my old and obsolete html page
mentionned at the end of this mail. Only the principal and public works are
cited below.


I hope this helps,


Philippe.


Jayashree said:
|> We are working on retargetable compilers for a specific architecture class.
|> We would like to have pointers to work done on IRs for specific class of
|> architectures.
|> Send compilers articles to compilers@iecc.com, meta-mail to
|> compilers-request@iecc.com. Archives at http://www.iecc.com/compilers


\addcontentsline {toc}{chapter}{Bibliographie}


\begin{thebibliography}{Philippe Canalda 97}
\bibitem[AJU 77b]{AJU 77b}
A.V. Aho, S.C. Johnson, J.D. Ullman: ``Code generation for machines with
mutiregister operations.''
{\it In the Proceedings of the 4th Annual ACM Symposium on Principles of
Programming Languages}, 1977, pp 21-28.


\bibitem[BS 76]{BS 76}
J. Bruno, R. Sethi\,: ``Code generation for a one-register machine.''
{\it Journal of the ACM} 1976, Vol. 22, \numero 3, pp 382-396.


\bibitem[BEH 91]{BEH 91}
D.G. Bradlee, S.J. Eggers, R.R. Henry\,: ``The MARION System for Retargetable
Instruction Scheduling.''
{\it Proceedings of the SIGPLAN'91}, pp 229-240.


% \bibitem[Cat 78b]{Cat 78b}
\bibitem[Cat 78]{Cat 78}
R.G.G.Cattell: ``Using Machine Descriptions for Automatic Generation of Code
Generators.''
{\it Proceedings of the Third Jerusalem Conference on Information
Technology}, North Holland, 1978, pp 503-507.


\bibitem[Cat 80]{Cat 80}
R.G.G. Cattell: ``Automatic Derivation of Code Generators from Machine
Descriptions.''
{\it JACM Transactions on Programming Languages and Systems}, Vol. 2, \numero 2,
April 1980, pp 173-190.


% \bibitem[Cat 78a]{Cat 78a}
% R.G.G. Cattell: ``Formalization and Automatic Derivation of Code Generators.''
% {\it PhD dissertation}, Carnegie, Mellon University, April 1978.
\bibitem[Cat 82]{Cat 82}
R.G.G. Cattell: ``Formalization and automatic derivation of code generators.''
UMI Research Press, Ann Arbor, Michigan, 1982.


\bibitem[PhC 97]{PhC 97}
P.H. Canalda\,: ``Contribution to the automatic production of
optimizing instruction selectors for PAGODE, based on rewriting
technics."
{\it Ph.D.}, Orleans University, July the 4th 1997.


\bibitem[Cog 95]{Cog 95}
L. Cognard\,: ``Modilisation du comportement dynamique des processeurs pour la
giniration automatique de riordonnanceurs de code.''
{\it Thhse de Doctorat}, Universiti d'Orlians, octobre 1995.


\bibitem[CCDM 93a]{CCDM 93a}
Canalda P., Cognard L., Despland A., Mazaud M. \,: ``PAGODE\,: a
back-end generator for RISC machines.'' RT 152, May 1993, INRIA
Rocquencourt, FRANCE.


\bibitem[CCDM 93b]{CCDM 93b}
Canalda P., Cognard L., Despland A., Mazaud M.\,: ``Register allocation and
scheduling\,: a generic approach.'' {\it Lecture Notes in Computer Science},
PLILP'93, \numero 714, pp 410-411, August 93.


\bibitem[CCDM 96]{CCDM 96}
Canalda P., Cognard L., Despland A., Jourdan M., Mazaud M., Parigot D. \,:
``PAGODE\,: a realistic back-end generator.'' {\it soumission ` PLDI 96}.


\bibitem[CM 93]{CM 93}
L. Cognard, M. Mazaud\,: ``Automatic generation of schedulers in the framework
of the \PAGODEv system.'' RR 1950, Juin 1993, INRIA Rocquencourt, FRANCE.


\bibitem[DM 96]{DM 96}
Despland A., Mazaud M. \,: ``A framework for modular and generic back-ends.''
{\it soumis pour publication}.


\bibitem[DMR 87]{DMR 87}
Despland A., Mazaud M., Rakotozafy R.\,:``Using rewriting
techniques to produce code generators and proving them correct.''
{\it Rapport de Recherche}, \numero 87-4, laboratoire d'informatique
fondamental d'Orlians, Universiti d'Orlians, 1987.


\bibitem[DMR 89]{DMR 89}
Despland A., Mazaud M., Rakotozafy R.\,:``Using rewriting
techniques to produce code generators and proving them correct.''
{\it Rapport de Recherche}, \numero 1046, INRIA Rocquencourt, juin 1989.


\bibitem[DMR 90]{DMR 90}
Despland A., Mazaud M., Rakotozafy R.\,: ``Using rewriting
techniques to produce code generators and proving them correct.''
{\it Science of Computer Programming} December 1990,
\numero 15 pp 15-54.


\bibitem[ESL 89]{ESL 89}
H. Emmelmann, F.-W. Schrver, R. Landwehr: ``BEG - a Generator for Efficient Back
Ends.''
{\it Proceedings of the SIGPLAN'89 Conference on Programming Language Design and
Implementation}, ACM of the Sigplan Notices, Vol. 24, \numero 7, pp 227-237, July 1989.


\bibitem[Emm 90]{BEG}
H. Emmelmann\,: ``BEG - a Back End Generator.''
{\it User Manual}, April 1990.


\bibitem[Emm 91]{Emm 91}
H. Emmelmann\,: ``Code selection by regularly controlled term rewriting.''
{\it Code Generation - concepts, tools, techniques}, Ed. R. Giegerich and
S.L. Graham, Proceedings of the Workshops in Computing Series, Springer-Verlag,
New York-Heidelberg-Berlin, 1991, pp 3-29.


\bibitem[Emm 92]{Emm 92}
H. Emmelmann\,: ``Testing Completeness of Code Selector Specifications.''
{\it Research Report \,?\,?\,?}.


\bibitem[Emm 94]{Emm 94}
H. Emmelmann\,: ``Codeselektion mit regular gesteuerter Termersetzung.''
{\it PhD Thesis}, Gesellschaft fuer Mathematik und Datenverarbeitung, 1994.


\bibitem[Fra 89]{Fra 89}
C.W. Fraser: ``A language for writing code generators.''
{\it Proceedings of the SIGPLAN'89} pp 238-245.


\bibitem[FW 88]{FW 88}
C.W. Fraser, A.L. Wendt: ``Automatic generation of fast optimizing code
generators.''
{\it Proceedings of the SIGPLAN'88 Symposium on Compiler Construction, Sigplan
Notices} Vol.23, \numero 7, June 88, pp 79-84.


\bibitem[FH 91]{FH 91}
C.W. Fraser, D.R. Hanson: ``A retargetable compiler for ANSI C.''
{it Sigplan Notices}, Vol.26, \numero 10, October 1991.


\bibitem[FH 95]{FH 95}
C.W. Fraser, D.R. Hanson: ``A retargetable C compiler\,: design and
implementation.''
{it Benjamin/Cummings Ed.}, Redwood City, California, 1995.


\bibitem[FHP 92c]{FHP 92c}
C.W. Fraser, D.R. Hanson, T.A. Proebsting: ``Engineering a simple, efficient
code generator generator.''
{\it ACM Letters on Programming Languages and Systems}, Vol.1, \numero 3,
1992, pp 213-226.


\bibitem[GM 86]{GM 86}
P.B. Gibbons, S.S. Muchnik\,: ``Efficient Instruction Scheduling for a
Pipelined Architecture.''
{\it Proceedings of the SIGPLAN'86}, pp 11-16.


\bibitem[Gie 82]{Gie 82}
R. Giegerich: ``Automatic Generation of machine specific code optimizers.''
{\it In the Conference Record of the 9th Annual ACM Symposium on Principles of
Programming Languages}, Albuquerque, New Mexico, 25-27 January 1986, pp
75-81.


\bibitem[Gie 90a]{Gie 90a}
R. Giegerich: ``Code selection by inversion of order-sorted derivors.''
{\it Theoretical Computer Science}, Vol. 73, 1990, pp 177-211.


\bibitem[Gie 90b]{Gie 90b}
R. Giegerich: ``On the structure of verifiable code generators specifications.''
{\it Proceedings of the SIGPLAN'90 Conference on Programming Language Design and
Implementation}, Sigplan Notices, Vol.25, \numero 6, June 1990, pp 1-8.


\bibitem[Gla 77]{Gla 77}
R.S. Glanville: ``A machine independent algorithm for code generation and its
use in retargetable compilers.''
{\it Ph.D. thesis}, University of California, Berkeley, December 1977.


\bibitem[GG 78a]{GG 78a}
R.S. Glanville, S.L. Graham: ``The Use of Machine Description for Compiler Code
Generation.''
{\it Information Technology}, 1978, North Holland
pp 509-514.


\bibitem[AGHMP-L 84]{AGHMP-L 84}
P. Aigrain, S.L. Graham, R.R. Henry, M.K. McKusick, E. Pelegr\'i-Lopart\,:
``Experience with a Graham-Glanville Style Code Generator.''
{\it Proceedings of the ACM SIGPLAN'84 Symposium on Compiler Construction},
SIGPLAN Notices, Vol.19, \numero 6, June 1984, pp 13-24.


\bibitem[GHLS 92]{GHLS 92}
R.W. Gray,V.P. Heuring, S.P. Levi, A.M. Sloane, W.M. Waite: ``ELI\,: A
complete, flexible compiler construction system.''
{\it Communications of the ACM}, Vol. 35, \numero 2, February 1992, pp
121-131.


\bibitem[GP-L 88]{GP-L 88}
S.L. Graham, E. Pelegr\'i-Llopart\,: ``Optimal Code Generation for Expression
Trees\,: An Application of BURS Theory.''
{\it Proceedings of the 15th Annual ACM SIGACT-SIGPLAN Symposium on Principles
of Programming Languages}, San Diego, California, January 1988, pp 294-308.


\bibitem[Hen 84]{Hen 84}
R.R. Henry: ``Graham-Glanville code generators.''
{\it PhD Thesis}, University of California, Berkeley, 1984.


\bibitem[Hen 88]{Hen 88}
R.R. Henry: ``The codegen user's manual.''
{\it Technical Report 87-08-04}, Computer Science Department, University of
Washington, 1988.


\bibitem[Lee 89]{Lee 89}
P. Lee: ``Realistic compiler generation.''
The MIT Press, Boston, Massachusetts, 1989.


\bibitem[Lel 96]{Lel 96}
S. Lelait\,: ``Contribution ` l'allocation de registres dans les boucles.''
{\it Thhse de Doctorat}, Universiti d'Orlians, janvier 1996.


\bibitem[Mam 95]{Mam 95}
B.Mammass\,: ``Vers une approche ginirique de la partie midiane d'un
compilateur.''
{\it Rapport de DEA}, I.N.R.I.A., Universiti Paris VII, Septembre 95.


\bibitem[NK 95]{NK 95}
A. Nymeyer, J.-P. Katoen\,: ``Code generation based on formal bottom-up rewrite
systems theory and heuristic search.''
{\it Accepted for publication in Acta Informatica}, also available as Technical
Report 95-42, University of Twente, November 1995.


\bibitem[NKWA 96]{NKWA 96}
A. Nymeyer, J.-P. Katoen, Y. Westra, H. Alblas\,: ``Code Generation = A$^* $ + BURS.''
{\it Proceedings of Compiler Construction}, 6th International Conference CC'96,
LNCS \numero 1060, Tibor Gyimsthy (Ed.) Springer Verlag, Linkvping, Sweden,
April 1996, pp 160-176.


\bibitem[P-L 87]{P-L 87}
E. Pelegr\'i-Llopart: \,: ``Rewrite Systems, Pattern Matching and Code
Generation.''
{\it PhD dissertation}, Technical Report CSD-88-423, University of California,
Berkeley, December 1987.


\bibitem[PW 96]{PW 96}
T.A. Proebsting, B.R. Whaley: ``One-pass, optimal tree parsing --- with or
without trees.''
{\it Proceedings of Compiler Construction}, 6th International Conference CC'96,
LNCS \numero 1060, Tibor Gyimsthy (Ed.) Springer Verlag, Linkvping, Sweden,
April 1996, pp XXX-XXX.


\bibitem[PagodeV1.1]{PagodeV1.1}
Canalda P., Cognard L., Despland A., Mazaud M. \,: ``The \PAGODEv System\,:
User's Guide and Reference Manual.'' Version 1.1
{\it Technical Report}, July 1993, INRIA Rocquencourt, FRANCE.


\bibitem[Pro 92-PhD]{Pro 92-PhD}
T.A. Proebsting: ``Code generation techniques.''
{it PhD Thesis}. also available as a Technical Report \numero 1119, University
of Wisconsin Madison. November 1992.


\bibitem[Pro 92]{Pro 92}
T.A. Proebsting: ``Simple and Efficient BURS Table Generation.''
{it Proceedings of the SIGPLAN'92 Conference on Programming Language Design and
Implementation}, Sigplan Notices, Vol. 27, \numero 6, pp 331-340, June 92.


\bibitem[Pro 95]{Pro 95}
Proebsting T.A.: ``BURS automata generation.'' {\it JACM Transactions on
Programming Languages and Systems}, Vol.17, \numero 3, May 1995, pp 461-486.


\bibitem[RR 92]{RR 92}
R.Ramesh, I.V.Ramakrishnan\,: ``Nonlinear Pattern Matching in Trees.''
{\it Journal of the Association for Computing Machinery}, Volume 39,
\numero 2, April 1992, pp. 295-316.


\bibitem[RRS 94]{RRS 94}
R. Ramesh, I.V. Ramakrishnan, R.C. Sekar\,: ``Automata-driven efficient subterm
unification.''
{\it 14th Conference of Foundations of Software Technology and Theoretical
Computer Science}, Proceedings, December 1994, pp. 288-299.


\bibitem[Rak 82]{Rak 82}
R.Rakotozafy: ``Production de Code par Riicriture de Termes de Types Abstraits
Algibriques.''
{\it Thhse de 3$^{\mbox{hme}}$cycle}, Universiti d'Orlians, Dicembre 1982.


\bibitem[Slo 95]{Slo 95}
A.M. Sloane: ``An evaluation of an automatically generated compiler.''
{\it ACM Transactions on Programming Languages and Systems}, Vol.17, \numero 5,
September 1995, pp 691-703.


\bibitem[Sta 87]{Sta 87}
Richard M. Stallman \,: ``Internals of GNU CC.''
It exists a more recent version (1992 ?)


\bibitem[Tji 85]{Tji 85}
S.W.K. Tjiang\,: ``Twig reference manual..''
{\it Computing Science Technical Report}, \numero 120, AT\&T Bell Laboratories,
Murray Hill, 1985.


\bibitem[Tof 90]{Tof 90}
M.Tofte: ``Compiler generators.''
{\it EATCS Monographs on Theoretical Computer Science}, Vol. 19, Springer
Verlag, Berlin, Germany, 1990.


\bibitem[WEC'93]{WEC 93}
Wang J., Eisenbeis C., Canalda P.\,:Using Timed Petri Net to Analyze
the Maximum Computation Rate for Loop Programs.
{\it Proceedings of Third International Conference for Young
Computer Scientist (ICYCS'93), July 15-17, 1993, Beijing, China, pp
1.21-1.24}.


\bibitem[SUIF 94]{SUIF 94}
R.P. Wilson, R,S. French, C.S. Wilson, S.P. Amarasinghe, J.M. Anderson,
S.W.K. Tjiang, S-W. Liao, C-W. Tseng, M.W. Hall, M.S. Lam, J.L. Hennessy:
``SUIF: An infrastructure for research on parallelising and optimizing compilers.''
{\it ACM Sigplan Notices}, Vol.29, \numero 12, December 94, pp 31-37.


\bibitem[WW 89]{WW 89}
B. Weisgerber, R. Wilhelm\,: ``Two tree pattern matchers for code generation.''
{\it LNCS of Compiler Compilers and High Speed Compilation}, D.Hammer (Ed),
\numero 371, Springer Verlag, 1989, pp 215-229.


\bibitem[Cat {\it et al} 80]{CATetal 80}
W.A. Wulf, B.W. Leverett, R.G.G. Cattell, S.O. Hobbs, J.M. Newcomer,
A.H. Reiner, B.R. Schatz\,: ``An overview of the production-quality compiler
compiler project.'' {\it IEEE Computer}, Vol. 13, \numero 8, 1980, pp 38-49.
% Ce qui suit est ` compliter


\end{thebibliography}




Philippe H. Canalda ACE Associated Compiler Experts bv
Van Eeghenstraat 100
1071 GL AMSTERDAM
Email : philippe@ace.nl -- Phone : +31 20 6646416 -- Fax :
+31 20 6750389 -- Url : http://www.ace.nl/ [for a personal
but obsolete Url : http://www-rocq.inria.fr/~canalda/]
--

Return to the comp.compilers page.
Search the comp.compilers archives again.