Entry Cooper:1993:MPC from complngs.bib
Last update: Thu Jun 20 02:00:37 MDT 2019
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Cooper:1993:MPC,
author = "Keith D. Cooper and Mary W. Hall and Ken Kennedy",
title = "A methodology for procedure cloning",
journal = j-COMP-LANGS,
volume = "19",
number = "2",
pages = "105--117",
month = apr,
year = "1993",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Tue Mar 25 14:04:06 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
acknowledgement = ack-nhfb,
affiliation = "Rice Univ",
affiliationaddress = "Houston, TX, USA",
classcodes = "C6150C (Compilers, interpreters and other
processors)",
classification = "721.1; 723.1; 723.2; 921.5",
corpsource = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "Algorithms; Cloning; Code expansion; code expansion;
code optimization; Codes (symbols); compiler; Computer
programming; Data transfer; interprocedural;
Interprocedural data flow analysis; Interprocedural
optimization; Optimization; partitioning; procedure
cloning methodology; Procedures; Program compilers;
program compilers; Programming theory; running time;
Running time; Specialization; Subroutines; three-phase
algorithm; transformation",
treatment = "P Practical",
}
Related entries
- analysis,
1(1)17,
1(2)161,
1(3)197,
1(3)233,
2(3)93,
3(3)163,
3(4)227,
4(1)49,
4(3)131,
5(2)52,
5(2)115,
5(3)141,
7(2)53,
7(3)103,
9(2)89,
9(3)161,
10(1)37,
10(1)63,
10(2)127,
11(3)123,
12(1)9,
13(1)23,
13(2)51,
13(2)75,
14(1)25,
14(2)83,
14(2)99,
14(2)125,
14(4)225,
14(4)263,
16(1)39,
17(2)147,
18(4)251,
19(2)65,
19(2)79,
19(2)119,
19(4)213,
20(1)1,
20(2)127,
20(3)177,
20(3)193,
21(1)49,
22(1)1,
22(1)15,
22(1)27,
22(4)215,
23(1)25,
28(3)273,
29(1)15,
30(3)207,
31(3)183,
35(1)63,
36(4)352,
37(4)168,
38(1)44,
41(z)42,
47(z)104,
47(z)211,
49(z)36,
50(z)31,
50(z)127,
54(z)71,
54(z)406,
54(z)427,
54(z)544
- flow,
1(2)161,
1(3)197,
3(1)1,
3(3)163,
4(3)155,
5(3)141,
7(1)41,
7(2)53,
8(1)27,
8(2)69,
9(2)97,
9(3)203,
10(1)37,
10(2)91,
13(2)75,
13(3)109,
15(2)83,
21(1)49,
21(3)165,
28(1)3,
29(1)15,
35(1)63,
50(z)82,
54(z)273
- interprocedural,
6(3)115
- Kennedy, Ken,
3(3)163
- methodology,
8(3)95,
12(3)145,
13(2)51,
15(4)225,
16(1)39,
17(3)199,
23(1)25,
34(1)25,
41(z)21
- optimization,
1(2)161,
3(3)163,
5(1)29,
6(1)19,
8(2)69,
11(2)105,
14(2)63,
14(3)193,
15(1)27,
15(2)83,
16(1)81,
19(1)41,
19(2)91,
19(3)205,
21(2)113,
22(2)115,
24(1)33,
47(z)189,
54(z)119
- partitioning,
11(3)161,
20(3)135,
22(1)27,
24(4)197,
25(3)145,
53(z)143
- procedure,
1(4)277,
1(4)303,
2(3)47,
2(4)117,
3(2)75,
3(3)181,
3(4)227,
4(2)71,
4(3)171,
5(2)65,
5(3)155,
6(3)115,
8(1)15,
10(1)63,
14(1)11,
14(3)153,
14(4)225,
15(1)27,
15(2)95,
15(2)109,
16(1)5,
16(3)209,
17(1)67,
18(3)153,
22(4)215
- running,
14(2)125
- specialization,
18(3)197,
36(1)2,
37(4)193,
40(2)37
- subroutine,
3(1)31,
3(1)37,
3(2)95,
3(2)115,
3(3)163,
3(4)241,
16(1)97,
16(2)129,
17(2)147,
19(2)91
- symbol,
1(2)105,
2(4)171,
10(2)127,
12(2)123,
16(2)167,
17(2)147,
17(3)169,
19(2)65,
19(2)79,
19(3)169,
20(2)69,
21(1)1,
21(1)17,
21(1)49,
21(2)101,
22(1)27,
22(1)39,
22(2)95,
23(1)1
- time,
1(1)17,
2(1)27,
3(3)163,
5(3)155,
7(2)53,
11(1)39,
12(1)39,
13(1)23,
14(1)1,
14(2)125,
15(1)27,
15(3)153,
15(3)177,
16(1)19,
16(1)39,
16(1)65,
16(2)113,
17(3)185,
18(2)77,
18(4)241,
19(1)41,
20(1)1,
20(1)25,
20(1)43,
20(2)89,
20(3)151,
20(3)193,
20(4)239,
21(2)81,
21(3)129,
22(1)39,
23(2)87,
25(1)39,
40(3)155
- transformation,
3(4)241,
6(1)35,
8(2)69,
14(3)205,
16(1)97,
17(1)19,
17(3)157,
17(4)241,
19(3)157,
20(2)89,
20(3)135,
22(2)181,
32(2)125,
36(3)223,
37(4)193,
40(2)73,
43(z)116,
44(z)48,
46(z)106