Entry Cater:1984:CLE 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{Cater:1984:CLE,
author = "Steven C. Cater and S. Sitharama Iyengar and John
Fuller",
title = "Computation of Logical Effort in High Level
Languages",
journal = j-COMP-LANGS,
volume = "9",
number = "3-4",
pages = "133--148",
month = "????",
year = "1984",
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,
affiliationaddress = "Louisiana State Univ, Dep of Computer Science,
Baton Rouge, LA, USA",
classcodes = "C6110 (Systems analysis and programming); C6140D (High
level languages)",
classification = "723",
corpsource = "Dept. of Comput. Sci., Louisiana State Univ., Baton
Rouge, LA, USA",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "Boolean; computer programming --- Algorithms; computer
programming languages; computer software; control
structure; cyclomatic complexity; disjunctive normal
form; effort; function; high level languages;
independence; language virtuality; logical effort;
segment; segment independence; software complexity;
software engineering",
treatment = "P Practical",
}
Related entries
- boolean,
17(3)185,
19(4)261
- complexity,
3(3)163,
7(2)61,
7(3)103,
7(3)147,
9(3)203,
10(3)211,
13(1)23,
13(3)109,
14(1)11,
14(2)125,
15(1)27,
15(2)83,
17(4)251,
17(4)269,
19(2)135,
19(3)169,
20(1)43,
20(1)53,
20(2)89,
20(2)101,
20(2)127,
20(3)177,
20(4)239,
20(4)267,
21(1)17,
21(1)49,
21(2)101,
21(2)113,
24(1)33
- computation,
1(2)121,
3(3)163,
4(1)17,
10(2)147,
11(3)143,
12(1)1,
12(2)109,
15(3)141,
16(2)179,
16(3)197,
19(1)1,
20(1)1,
20(1)25,
20(4)253,
22(2)95,
23(2)161,
28(2)181,
33(3)82,
34(4)184,
35(3)217,
40(1)19
- control,
1(1)3,
3(3)163,
4(3)155,
5(3)141,
6(3)131,
7(2)89,
8(1)1,
8(1)15,
8(2)61,
9(1)1,
9(3)183,
10(2)75,
10(3)179,
11(3)143,
12(1)39,
13(3)109,
14(1)1,
14(3)153,
14(4)255,
15(2)83,
15(2)109,
15(3)141,
16(1)39,
16(2)147,
16(3)197,
17(4)269,
18(4)217,
19(1)51,
20(1)53,
20(2)117,
21(1)17,
22(1)15,
22(4)259,
23(2)87,
24(4)229,
39(3)67,
39(3)109,
45(z)80,
45(z)161,
47(z)44
- cyclomatic,
7(3)147
- disjunctive,
23(2)161
- effort,
7(3)147,
15(2)109
- engineering,
5(2)103,
8(3)139,
9(1)1,
9(1)39,
9(3)203,
10(3)179,
13(3)109,
14(2)83,
14(3)165,
15(4)225,
15(4)251,
16(1)19,
16(1)39,
17(2)83,
17(3)199,
18(2)77,
18(3)153,
18(3)169,
20(2)117,
21(1)17,
21(1)39,
21(2)67,
21(2)81,
21(3)147,
22(1)39,
22(2)95,
22(4)193,
23(1)25,
23(1)43,
23(2)87,
24(1)1,
27(1)115,
43(z)139,
44(z)1,
46(z)206,
47(z)151,
49(z)174,
49(z)216,
50(z)140,
54(z)139,
54(z)297,
54(z)386,
54(z)472
- form,
1(1)45,
5(2)77,
8(3)139,
9(3)183,
12(1)9,
13(3)109,
14(3)153,
15(3)141,
17(2)133,
20(1)43,
23(2)179,
35(2)173
- Fuller, John,
7(3)147
- function,
1(2)121,
3(1)13,
3(1)31,
7(3)103,
10(1)1,
11(2)55,
11(2)85,
12(2)69,
12(3)163,
14(3)181,
15(1)55,
17(2)133,
17(2)147,
18(2)125,
18(4)217,
19(1)1,
19(2)91,
19(4)213,
20(2)101,
20(3)177,
21(3)129,
24(1)1,
35(3)266,
43(z)41,
47(z)77
- Iyengar, S. Sitharama,
7(3)147
- logical,
1(2)161,
1(3)197,
2(1)27,
7(3)147,
9(3)183,
12(1)9,
14(1)35,
17(2)133,
19(2)79,
22(2)51,
22(4)237,
23(1)25,
23(2)161
- normal,
17(3)185,
20(1)43
- segment,
5(2)115,
20(4)213