Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=248
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity
Luke Hornof
,
Jacques Noyé
Theoretical Computer Science
248
(1-2), 2000, pp. 3-27
Interconvertibility of a class of set constraints and context-free-language reachability
David Melski
,
Thomas Reps
Theoretical Computer Science
248
(1-2), 2000, pp. 29-98
Extending a partial evaluator which supports separate compilation
Rogardt Heldal
,
John Hughes
Theoretical Computer Science
248
(1-2), 2000, pp. 99-145
DyC: An expressive annotation-directed dynamic compiler for
C
Brian Grant
,
Markus Mock
,
Matthai Philipose
,
Craig Chambers
,
Susan J. Eggers
Theoretical Computer Science
248
(1-2), 2000, pp. 147-199
Accurate program analyses for successful specialization of legacy system software
Gilles Muller
,
Renaud Marlet
,
Eugen-Nicolae Volanschi
Theoretical Computer Science
248
(1-2), 2000, pp. 201-210
MetaML and multi-stage programming with explicit annotations
Walid Taha
,
Tim Sheard
Theoretical Computer Science
248
(1-2), 2000, pp. 211-242
Lambda-dropping: Transforming recursive equations into programs with block structure
Olivier Danvy
,
Ulrik P. Schultz
Theoretical Computer Science
248
(1-2), 2000, pp. 243-287