Optimal interprocedural program optimization: a new framework and its application
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Berlin ; Heidelberg ; New York ; Barcelona ; Budapest u.a.
Springer
1998
|
Schriftenreihe: | Lecture notes in computer science
1428 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XXV, 288 S. graph. Darst. |
ISBN: | 3540651233 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV012163058 | ||
003 | DE-604 | ||
005 | 20030512 | ||
007 | t| | ||
008 | 980915s1998 gw d||| |||| 00||| eng d | ||
016 | 7 | |a 954454197 |2 DE-101 | |
020 | |a 3540651233 |9 3-540-65123-3 | ||
035 | |a (OCoLC)39868125 | ||
035 | |a (DE-599)BVBBV012163058 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c DE | ||
049 | |a DE-91G |a DE-384 |a DE-739 |a DE-703 |a DE-29T |a DE-706 |a DE-634 |a DE-83 |a DE-188 | ||
050 | 0 | |a QA76.6.K63 1998 | |
082 | 0 | |a 005.1 21 | |
082 | 0 | |a 005.1 |2 21 | |
084 | |a DAT 343f |2 stub | ||
084 | |a DAT 345f |2 stub | ||
084 | |a 28 |2 sdnb | ||
100 | 1 | |a Knoop, Jens |e Verfasser |4 aut | |
245 | 1 | 0 | |a Optimal interprocedural program optimization |b a new framework and its application |c Jens Knoop |
264 | 1 | |a Berlin ; Heidelberg ; New York ; Barcelona ; Budapest u.a. |b Springer |c 1998 | |
300 | |a XXV, 288 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 1428 | |
650 | 4 | |a Algorithmes | |
650 | 7 | |a Algorithmes |2 ram | |
650 | 7 | |a Algoritmen |2 gtt | |
650 | 4 | |a Compilateurs (Logiciels) | |
650 | 7 | |a Compilateurs (logiciels) |2 ram | |
650 | 7 | |a Engenharia de programacao (software) |2 larpcal | |
650 | 7 | |a Linguagens de programacao (computadores) |2 larpcal | |
650 | 7 | |a Optimaliseren |2 gtt | |
650 | 7 | |a Ordinateurs - Programmation |2 ram | |
650 | 7 | |a Programacao de computadores |2 larpcal | |
650 | 4 | |a Programmation (Informatique) | |
650 | 7 | |a Programmatuurtechniek |2 gtt | |
650 | 7 | |a Software basico |2 larpcal | |
650 | 7 | |a Verificatie |2 gtt | |
650 | 7 | |a langage procédure |2 inriac | |
650 | 7 | |a optimisation interprocédurale |2 inriac | |
650 | 7 | |a optimisation programme |2 inriac | |
650 | 7 | |a transformation programme |2 inriac | |
650 | 4 | |a Computer programming | |
650 | 4 | |a Computer algorithms | |
650 | 4 | |a Compilers (Computer programs) | |
650 | 0 | 7 | |a Programmoptimierung |0 (DE-588)4191605-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Compiler |0 (DE-588)4148248-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Programmtransformation |0 (DE-588)4263654-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Optimierender Compiler |0 (DE-588)4342511-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmische Programmierung |0 (DE-588)4293504-0 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Compiler |0 (DE-588)4148248-7 |D s |
689 | 0 | 1 | |a Optimierung |0 (DE-588)4043664-0 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Programmoptimierung |0 (DE-588)4191605-0 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Programmtransformation |0 (DE-588)4263654-1 |D s |
689 | 2 | 1 | |a Optimierender Compiler |0 (DE-588)4342511-2 |D s |
689 | 2 | 2 | |a Algorithmische Programmierung |0 (DE-588)4293504-0 |D s |
689 | 2 | |5 DE-604 | |
830 | 0 | |a Lecture notes in computer science |v 1428 |w (DE-604)BV000000607 |9 1428 | |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008239466&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-008239466 |
Datensatz im Suchindex
_version_ | 1820874880493551616 |
---|---|
adam_text |
TABLE OF CONTENTS
1. PREFACE
.
1
1.1 SUMMARY
.
1
1.2 MOTIVATION
.
1
1.2.1 THE FRAMEWORK
.
3
1.2.2 THE APPLICATION
.
7
1.2.3 RELATED WORK
.
8
1.2.4ORGANIZATION OF THE MONOGRAPH
.
10
PART I. = INTRODUCTION
2. THE INTRAPROCEDURAL FRAMEWORK
.
15
2.1 INTRAPROCEDURAL PROGRAM OPTIMIZATION
.
15
2.1.1 PROCEDURES AND FLOW GRAPHS
.
16
2.1.2 PROVABLY OPTIMAL PROGRAM TRANSFORMATIONS
.
17
2.1.3 PROVABLY PRECISE DATA FLOW ANALYSES
.
18
2.2 ABSTRACT INTERPRETATION
.
18
2.2.1 DATA FLOW INFORMATION
.
19
2.2.2 LOCAL ABSTRACT SEMANTICS
.
19
2.2.3 GLOBAL ABSTRACT SEMANTICS
.
19
2.2.4
MOP
-CORRECTNESS AND
MOP
-PRECISION
.
21
2.2.5 THE GENERIC FIXED POINT ALGORITHM
.
21
2.2.6 FORMAL SPECIFICATION OF DFA-ALGORITHMS
.
23
2.2.7 FORWARD, BACKWARD, AND BIDIRECTIONAL DFA-ALGORITHMS 25
2.3 A COOKBOOK FOR *INTRAPROCEDURAL OPTIMIZATION*
.
26
2.3.1 OPTIMAL PROGRAM OPTIMIZATION
.
26
2.3.2 PRECISE DATA FLOW ANALYSIS
.
27
3. INTRAPROCEDURAL CODE MOTION: THE TRANSFORMATIONS
.
31
3.1 PRELIMINARIES
.
31
3.2 INTRAPROCEDURAL CODE MOTION TRANSFORMATIONS
.
33
3.2.1 ADMISSIBLE TRANSFORMATIONS
.
34
3.2.2 COMPUTATIONALLY OPTIMAL TRANSFORMATIONS
.
36
3.2.3 LIFETIME OPTIMAL TRANSFORMATIONS
.
37
XXII TABLE OF CONTENTS
3.3 THE
BCM
-TRANSFORMATION
.
38
3.3.1 SPECIFICATION
.
38
3.3.2 PROVING COMPUTATIONAL OPTIMALITY
.
39
3.4THE
LCM
-TRANSFORMATION
.
40
3.4.1 SPECIFICATION
.
40
3.4.2 PROVING LIFETIME OPTIMALITY
.
41
3.5 AN ILLUSTRATING EXAMPLE
.
42
4. INTRAPROCEDURAL CODE MOTION: THE DFA-ALGORITHMS
.
49
4.1 DFA-ALGORITHM
A
DS
: DOWN-SAFETY
.
49
4.1.1 SPECIFICATION
.
50
4.1.2 PROVING PRECISION
.
50
4.2 DFA-ALGORITHM
A
EA
: EARLIESTNESS
.
54
4.2.1 SPECIFICATION
.
54
4.2.2 PROVING PRECISION
.
55
4.3 DFA-ALGORITHM
A
DL
: DELAYABILITY
.
58
4.3.1 SPECIFICATION
.
58
4.3.2 PROVING PRECISION
.
59
4.4 DFA-ALGORITHM
A
UN
: UNUSABILITY
.
63
4.4.1 SPECIFICATION
.
63
4.4.2 PROVING PRECISION
.
64
PART II. = THE FRAMEWORK
5. THE PROGRAMMING LANGUAGE
.
71
5.1 PROGRAMS
.
71
5.1.1 SYNTAX
.
71
5.1.2 NOTATIONS
.
73
5.1.3 CONVENTIONS
.
74
5.2 SUBLANGUAGES
.
75
5.3 SEPARATE COMPILATION AND SEPARATE OPTIMIZATION
.
76
6. HIGHER ORDER DATA FLOW ANALYSIS
.
79
6.1 FORMAL CALLABILITY
.
80
6.2 FORMAL PASSABILITY
.
84
6.3 POTENTIAL PASSABILITY
.
86
6.3.1 COMPUTING POTENTIAL PASSABILITY
.
91
6.3.2 AN EFFICIENT VARIANT
.
94
6.4MAIN RESULTS ON POTENTIAL PASSABILITY
.
95
6.4.1 CORRECTNESS AND PRECISION
.
95
6.4.2 COMPLEXITY
.
97
TABLE OF CONTENTS XXIII
7. THE INTERPROCEDURAL SETTING
.
99
7.1 FLOW GRAPH SYSTEMS
.
99
7.1.1 THE FUNCTIONS
FG
,
CALLEE
,
CALLER
,
START
,AND
END
.
100
7.1.2 THE INTERFACE BETWEEN HO-DFA AND IDFA
.
101
7.2 INTERPROCEDURAL FLOW GRAPHS
.
101
7.2.1 INTERPROCEDURAL PATHS
.
103
7.2.2 COMPLETE INTERPROCEDURAL PATHS
.
105
7.3 INTERPROCEDURAL PROGRAM OPTIMIZATION
.
106
7.3.1 PROVABLY OPTIMAL INTERPROCEDURAL PROGRAM
TRANSFORMATIONS
.
107
7.3.2 PROVABLY PRECISE INTERPROCEDURAL DATA FLOW ANALYSES
.
108
8. ABSTRACT INTERPRETATION
.
109
8.1 DATA FLOW ANALYSIS STACKS
.
109
8.2 LOCAL ABSTRACT SEMANTICS
.
111
8.2.1 THE STRUCTURE OF THE SEMANTIC FUNCTIONS
.
112
8.3 GLOBAL ABSTRACT SEMANTICS
.
114
8.3.1 THE INTERPROCEDURAL MEET OVER ALL PATHS APPROACH
.
114
8.3.2 THE INTERPROCEDURAL MAXIMAL FIXED POINT APPROACH
.
115
8.4
IMOP
-CORRECTNESS AND
IMOP
-PRECISION
.
117
8.4.1 THE MAIN LEMMA
.
117
8.4.2 THE INTERPROCEDURAL CORRECTNESS THEOREM
.
121
8.4.3 THE INTERPROCEDURAL COINCIDENCE THEOREM
.
123
8.5 THE GENERIC FIXED POINT ALGORITHMS
.
126
8.5.1 COMPUTING THE SEMANTICS OF PROCEDURES
.
126
8.5.2 COMPUTING THE
IMFP
-SOLUTION
.
131
8.5.3 AN EFFICIENT VARIANT FOR COMPUTING THE
IMFP
-SOLUTION 135
8.6 FORMAL SPECIFICATION OF IDFA-ALGORITHMS
.
137
8.7 FORWARD, BACKWARD, BIDIRECTIONAL IDFA-ALGORITHMS
.
139
9. COOKBOOK *INTERPROCEDURAL OPTIMIZATION*
.
141
9.1 OPTIMAL INTERPROCEDURAL PROGRAM OPTIMIZATION
.
141
9.1.1 FIXING THE PROGRAM TRANSFORMATIONS AND THE
OPTIMALITY CRITERION
.
141
9.1.2 FIXING THE OPTIMAL PROGRAM TRANSFORMATION
.
142
9.2 PRECISE INTERPROCEDURAL DATA FLOW ANALYSIS
.
142
9.2.1 SPECIFYING THE IDFA
A
*
.
142
9.2.2 PROVING PRECISION OF
A
*
.
143
XXIV TABLE OF CONTENTS
PART III. = THE APPLICATION
10. INTERPROCEDURAL CODE MOTION: THE TRANSFORMATIONS
.
147
10.1 DIFFERENCES TO THE INTRAPROCEDURAL SETTING
.
148
10.1.1 COMPUTATIONAL OPTIMALITY
.
148
10.1.2 SAFETY
.
153
10.1.3 DOWN-SAFETY
.
154
10.1.4CANONICITY
.
157
10.2 PRELIMINARIES
.
157
10.2.1 BASIC DEFINITIONS
.
160
10.2.2 FIRST RESULTS
.
164
10.3 INTERPROCEDURAL CODE MOTION TRANSFORMATIONS
.
166
10.3.1 ADMISSIBLE TRANSFORMATIONS
.
167
10.3.2 COMPUTATIONALLY OPTIMAL TRANSFORMATIONS
.
170
10.3.3 LIFETIME OPTIMAL TRANSFORMATIONS
.
171
10.4THE
IBCM
-TRANSFORMATION
.
173
10.4.1 SPECIFICATION
.
174
10.4.2 PROVING COMPUTATIONAL OPTIMALITY
.
178
10.5 THE
ILCM
-TRANSFORMATION
.
189
10.5.1 SPECIFICATION
.
191
10.5.2 PROVING LIFETIME OPTIMALITY
.
196
10.6 AN EXAMPLE
.
201
11. INTERPROCEDURAL CODE MOTION: THE IDFA-ALGORITHMS
.
209
11.1 IDFA-ALGORITHM
A
DS
.
209
11.1.1 SPECIFICATION
.
210
11.1.2 PROVING PRECISION
.
212
11.2 IDFA-ALGORITHM
A
EA
.
221
11.2.1 SPECIFICATION
.
221
11.2.2 PROVING PRECISION
.
223
11.3 IDFA-ALGORITHM
A
DL
.
229
11.3.1 SPECIFICATION
.
229
11.3.2 PROVING PRECISION
.
230
11.4IDFA-ALGORITHM
A
UN
.
238
11.4.1 SPECIFICATION
.
239
11.4.2 PROVING PRECISION
.
240
TABLE OF CONTENTS XXV
PART IV. = CONCLUSION
12. PERSPECTIVES
.
251
12.1 RECONSIDERING CODE MOTION ANOMALIES
.
251
12.2 PRAGMATICS
.
260
12.2.1 STATIC PROCEDURE NESTING AND COMPLEXITY OF IDFA
.
260
12.2.2 ALIASING: CALL BY NAME AND CALL BY REFERENCE
.
264
12.3 FUTURE WORK
.
265
12.3.1 THE FRAMEWORK SIDE
.
265
12.3.2 THE APPLICATION SIDE
.
267
12.3.3 GENERATORS FOR IDFA AND OPTIMIZATION
.
269
BIBLIOGRAPHY
.
271
INDEX
.
285 |
any_adam_object | 1 |
author | Knoop, Jens |
author_facet | Knoop, Jens |
author_role | aut |
author_sort | Knoop, Jens |
author_variant | j k jk |
building | Verbundindex |
bvnumber | BV012163058 |
callnumber-first | Q - Science |
callnumber-label | QA76 |
callnumber-raw | QA76.6.K63 1998 |
callnumber-search | QA76.6.K63 1998 |
callnumber-sort | QA 276.6 K63 41998 |
callnumber-subject | QA - Mathematics |
classification_rvk | SS 4800 |
classification_tum | DAT 343f DAT 345f |
ctrlnum | (OCoLC)39868125 (DE-599)BVBBV012163058 |
dewey-full | 005.121 005.1 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.1 21 005.1 |
dewey-search | 005.1 21 005.1 |
dewey-sort | 15.1 221 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV012163058</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20030512</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">980915s1998 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">954454197</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540651233</subfield><subfield code="9">3-540-65123-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)39868125</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012163058</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.6.K63 1998</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1 21</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 343f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 345f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Knoop, Jens</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal interprocedural program optimization</subfield><subfield code="b">a new framework and its application</subfield><subfield code="c">Jens Knoop</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg ; New York ; Barcelona ; Budapest u.a.</subfield><subfield code="b">Springer</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXV, 288 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">1428</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compilateurs (Logiciels)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Compilateurs (logiciels)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Engenharia de programacao (software)</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Linguagens de programacao (computadores)</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimaliseren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Ordinateurs - Programmation</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programacao de computadores</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmatuurtechniek</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Software basico</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Verificatie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage procédure</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">optimisation interprocédurale</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">optimisation programme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">transformation programme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compilers (Computer programs)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmoptimierung</subfield><subfield code="0">(DE-588)4191605-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Compiler</subfield><subfield code="0">(DE-588)4148248-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmtransformation</subfield><subfield code="0">(DE-588)4263654-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierender Compiler</subfield><subfield code="0">(DE-588)4342511-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Compiler</subfield><subfield code="0">(DE-588)4148248-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Programmoptimierung</subfield><subfield code="0">(DE-588)4191605-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Programmtransformation</subfield><subfield code="0">(DE-588)4263654-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Optimierender Compiler</subfield><subfield code="0">(DE-588)4342511-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">1428</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">1428</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008239466&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008239466</subfield></datafield></record></collection> |
id | DE-604.BV012163058 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:06:45Z |
institution | BVB |
isbn | 3540651233 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008239466 |
oclc_num | 39868125 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-703 DE-29T DE-706 DE-634 DE-83 DE-188 |
owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-703 DE-29T DE-706 DE-634 DE-83 DE-188 |
physical | XXV, 288 S. graph. Darst. |
publishDate | 1998 |
publishDateSearch | 1998 |
publishDateSort | 1998 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Knoop, Jens Verfasser aut Optimal interprocedural program optimization a new framework and its application Jens Knoop Berlin ; Heidelberg ; New York ; Barcelona ; Budapest u.a. Springer 1998 XXV, 288 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1428 Algorithmes Algorithmes ram Algoritmen gtt Compilateurs (Logiciels) Compilateurs (logiciels) ram Engenharia de programacao (software) larpcal Linguagens de programacao (computadores) larpcal Optimaliseren gtt Ordinateurs - Programmation ram Programacao de computadores larpcal Programmation (Informatique) Programmatuurtechniek gtt Software basico larpcal Verificatie gtt langage procédure inriac optimisation interprocédurale inriac optimisation programme inriac transformation programme inriac Computer programming Computer algorithms Compilers (Computer programs) Programmoptimierung (DE-588)4191605-0 gnd rswk-swf Compiler (DE-588)4148248-7 gnd rswk-swf Programmtransformation (DE-588)4263654-1 gnd rswk-swf Optimierender Compiler (DE-588)4342511-2 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Algorithmische Programmierung (DE-588)4293504-0 gnd rswk-swf Compiler (DE-588)4148248-7 s Optimierung (DE-588)4043664-0 s DE-604 Programmoptimierung (DE-588)4191605-0 s Programmtransformation (DE-588)4263654-1 s Optimierender Compiler (DE-588)4342511-2 s Algorithmische Programmierung (DE-588)4293504-0 s Lecture notes in computer science 1428 (DE-604)BV000000607 1428 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008239466&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Knoop, Jens Optimal interprocedural program optimization a new framework and its application Lecture notes in computer science Algorithmes Algorithmes ram Algoritmen gtt Compilateurs (Logiciels) Compilateurs (logiciels) ram Engenharia de programacao (software) larpcal Linguagens de programacao (computadores) larpcal Optimaliseren gtt Ordinateurs - Programmation ram Programacao de computadores larpcal Programmation (Informatique) Programmatuurtechniek gtt Software basico larpcal Verificatie gtt langage procédure inriac optimisation interprocédurale inriac optimisation programme inriac transformation programme inriac Computer programming Computer algorithms Compilers (Computer programs) Programmoptimierung (DE-588)4191605-0 gnd Compiler (DE-588)4148248-7 gnd Programmtransformation (DE-588)4263654-1 gnd Optimierender Compiler (DE-588)4342511-2 gnd Optimierung (DE-588)4043664-0 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd |
subject_GND | (DE-588)4191605-0 (DE-588)4148248-7 (DE-588)4263654-1 (DE-588)4342511-2 (DE-588)4043664-0 (DE-588)4293504-0 |
title | Optimal interprocedural program optimization a new framework and its application |
title_auth | Optimal interprocedural program optimization a new framework and its application |
title_exact_search | Optimal interprocedural program optimization a new framework and its application |
title_full | Optimal interprocedural program optimization a new framework and its application Jens Knoop |
title_fullStr | Optimal interprocedural program optimization a new framework and its application Jens Knoop |
title_full_unstemmed | Optimal interprocedural program optimization a new framework and its application Jens Knoop |
title_short | Optimal interprocedural program optimization |
title_sort | optimal interprocedural program optimization a new framework and its application |
title_sub | a new framework and its application |
topic | Algorithmes Algorithmes ram Algoritmen gtt Compilateurs (Logiciels) Compilateurs (logiciels) ram Engenharia de programacao (software) larpcal Linguagens de programacao (computadores) larpcal Optimaliseren gtt Ordinateurs - Programmation ram Programacao de computadores larpcal Programmation (Informatique) Programmatuurtechniek gtt Software basico larpcal Verificatie gtt langage procédure inriac optimisation interprocédurale inriac optimisation programme inriac transformation programme inriac Computer programming Computer algorithms Compilers (Computer programs) Programmoptimierung (DE-588)4191605-0 gnd Compiler (DE-588)4148248-7 gnd Programmtransformation (DE-588)4263654-1 gnd Optimierender Compiler (DE-588)4342511-2 gnd Optimierung (DE-588)4043664-0 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd |
topic_facet | Algorithmes Algoritmen Compilateurs (Logiciels) Compilateurs (logiciels) Engenharia de programacao (software) Linguagens de programacao (computadores) Optimaliseren Ordinateurs - Programmation Programacao de computadores Programmation (Informatique) Programmatuurtechniek Software basico Verificatie langage procédure optimisation interprocédurale optimisation programme transformation programme Computer programming Computer algorithms Compilers (Computer programs) Programmoptimierung Compiler Programmtransformation Optimierender Compiler Optimierung Algorithmische Programmierung |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008239466&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT knoopjens optimalinterproceduralprogramoptimizationanewframeworkanditsapplication |