Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
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{Czech:1988:EID,
author = "Z. J. Czech",
title = "Efficient implementation of detection of undefined
variables",
journal = j-COMP-J,
volume = "31",
number = "6",
pages = "545--549",
month = dec,
year = "1988",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/31.6.545",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68N20 (68Q25)",
MRnumber = "89j:68020",
bibdate = "Tue Dec 4 14:48:25 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/31/6.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/",
URL = "http://comjnl.oxfordjournals.org/content/31/6/545.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/tiff/545.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/tiff/546.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/tiff/547.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/tiff/548.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/tiff/549.tif",
acknowledgement = ack-nhfb,
affiliation = "Inst. of Comput. Sci., Tech. Univ. of Silesia,
Gliwice, Poland",
affiliationaddress = "Gliwice, Poland",
classcodes = "C6150C (Compilers, interpreters and other processors);
C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming)",
classification = "723; 921; C4240 (Programming and algorithm theory);
C6110 (Systems analysis and programming); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Inst. of Comput. Sci., Tech. Univ. of Silesia,
Gliwice, Poland",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "Ada; Ada compiler, Computer Programming; Algorithms;
Compilation; compilation; compiler; compilers;
complexity; computational complexity; Computer
Operating Systems--Program Compilers; Computer
Programming Languages--Ada; Direct acyclic graph;
direct acyclic graph; Directed Acyclic Graphs; directed
graphs; Mathematical Techniques--Graph Theory; program;
Program flow graph; program flow graph; Program Flow
Graphs; Programming; programming; Reducible flow graph;
reducible flow graph; time; Time complexity; Undefined
variables; Undefined Variables; undefined variables;
Uninitialised variables; uninitialised variables;
Use-Definition Chains; Use-definition chains;
use-definition chains",
thesaurus = "Ada; Computational complexity; Directed graphs;
Program compilers; Programming",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- 68Q25,
27(4)315
- acyclic,
27(1)86,
28(1)5,
32(3)228
- Ada,
25(2)248,
26(4)344,
27(1)37,
28(1)22,
28(3)343,
29(1)33,
29(5)404,
30(3)276-2,
30(4)328
- C4240,
31(6)517,
31(6)553,
31(6)557,
31(6)561,
31(6)567,
32(2)187,
32(5)437,
32(5)470,
32(5)474,
32(6)567,
32(6)571
- C6110,
31(5)391,
31(5)420,
31(5)426,
31(5)431,
31(6)481,
31(6)531,
32(1)1,
32(2)98,
32(2)122,
32(2)142,
32(2)152,
32(2)175,
32(3)202,
32(4)290,
32(4)305,
32(4)323,
32(4)333,
32(4)341,
32(5)461
- C6150C,
31(6)517,
31(6)540,
32(1)29,
32(1)91,
32(2)127,
32(2)142,
32(2)152,
32(2)175,
32(3)276,
32(5)422,
32(5)445
- chain,
26(1)10,
26(2)113,
27(2)135,
28(3)319,
30(3)201,
30(6)529,
30(6)541,
31(2)141
- compilation,
24(3)222,
26(4)296,
29(3)282,
30(2)183,
32(2)127,
32(3)273
- compiler,
23(2)115,
23(2)147,
23(3)211,
23(3)212,
23(3)223,
23(3)273,
24(2)107,
25(1)17,
25(3)331,
26(1)15,
26(2)142,
26(2)164,
27(3)233,
27(4)348,
28(1)9,
28(2)128,
28(3)257,
29(2)151,
29(3)253,
30(2)183,
30(4)328,
30(6)519,
31(6)517,
31(6)540,
32(1)29,
32(1)91,
32(2)127,
32(2)142,
32(2)152,
32(2)175,
32(3)276,
32(5)422,
32(5)445
- complexity,
25(1)63,
25(3)379,
26(3)224,
26(4)293,
26(4)354,
27(1)72,
27(2)135,
27(4)315,
27(4)340,
28(1)5,
28(1)78,
28(5)487,
28(5)496,
29(2)103,
29(2)161,
29(2)176,
29(2)182,
29(4)300,
29(4)322,
29(4)330,
29(5)451,
30(1)43,
30(2)176,
30(3)201,
30(3)223,
30(3)233,
30(3)258,
30(3)282,
30(4)308,
30(4)376,
30(5)433,
31(1)56,
31(1)71,
31(1)83,
31(3)283,
31(4)289,
31(6)490,
31(6)553,
31(6)561,
31(6)567,
32(4)362,
32(5)474
- computational,
23(2)123,
23(2)187,
26(2)164,
26(3)224,
26(4)293,
26(4)354,
27(1)72,
27(2)135,
27(4)315,
27(4)375,
28(3)335,
28(4)433,
28(5)496,
29(1)76,
29(2)103,
29(2)176,
29(4)322,
29(4)330,
29(4)373,
29(5)467,
30(1)43,
30(1)87,
30(2)176,
30(3)201,
30(3)223,
30(3)233,
30(3)282,
30(4)376,
30(5)433,
31(1)56,
31(1)71,
31(1)83,
31(3)283,
31(4)289,
31(6)490,
31(6)553,
31(6)561,
31(6)567,
32(1)93,
32(4)377,
32(5)453,
32(5)474
- detection,
23(1)66,
23(4)317,
26(1)15,
27(3)246,
29(1)12,
30(1)20,
31(4)296,
32(1)16
- direct,
23(2)188,
25(4)486,
28(4)444
- directed,
24(1)78,
25(3)397,
27(1)86,
30(1)20,
30(2)128,
31(1)71
- efficient,
23(2)186,
23(4)382,
23(4)383,
24(4)316,
25(2)264,
26(3)193,
28(2)184,
28(3)330,
28(4)375,
30(2)168,
30(3)282,
30(3)282-1,
30(3)283,
30(5)437,
31(4)330,
32(1)93,
32(2)127,
32(3)267
- flow,
25(2)207,
26(3)235,
26(4)320,
28(3)264,
29(6)506,
30(3)233,
31(4)376,
31(4)379,
32(1)1,
32(3)194,
32(3)202
- graph,
23(3)237,
24(1)85,
25(3)338,
25(3)397,
27(1)86,
27(2)165,
28(1)5,
28(1)44,
28(1)78,
28(2)105,
29(6)531,
29(6)553,
30(1)16,
30(1)20,
30(2)128,
30(6)498,
31(1)71,
31(1)76,
31(2)155,
31(3)253,
31(4)289,
31(4)304,
32(1)45,
32(2)175,
32(4)290,
32(5)461,
32(5)474
- Graph, Techniques-,
32(1)45,
32(2)175
- implementation,
23(3)212,
23(3)233,
24(1)71,
24(2)191,
24(4)384-2,
25(1)74,
25(3)307,
25(3)399,
25(4)471,
26(2)134,
26(2)164,
26(2)187,
26(3)235,
27(2)127,
27(3)260,
28(1)22,
28(2)97,
28(2)128,
28(4)391,
29(2)97,
29(3)201,
29(3)269,
29(6)500,
30(2)97,
30(2)157,
30(3)282,
30(3)282-1,
30(5)393,
30(5)420,
31(1)56,
31(2)116,
31(2)125,
31(2)147,
31(4)330,
31(5)398,
31(6)531,
32(1)93,
32(2)127,
32(2)142,
32(2)152,
32(2)175,
32(3)267,
32(4)312,
32(5)422
- interpreter,
23(3)223,
26(2)164,
30(1)37,
30(1)43,
30(6)519,
31(2)110,
31(6)517,
31(6)525,
31(6)540,
32(1)29,
32(1)91,
32(2)108,
32(2)127,
32(2)142,
32(2)152,
32(2)175,
32(3)276,
32(5)422,
32(5)445
- mathematical,
24(2)177,
24(2)180,
24(2)184,
25(1)7,
25(1)56,
25(4)478,
26(1)6,
26(2)97,
26(2)106,
26(3)193,
27(2)165,
27(4)368-1,
28(1)5,
28(1)78,
28(1)89,
28(2)142,
28(2)179,
28(4)414,
28(4)417,
28(4)426,
28(5)498,
28(5)524,
28(5)530,
28(5)538,
29(1)36,
29(1)52,
29(2)171,
29(2)176,
29(2)182,
29(4)378,
29(5)416,
29(6)553,
30(1)16,
30(1)20,
30(1)70,
30(2)128,
30(2)189,
30(3)258,
30(3)268,
30(3)282,
30(4)298,
30(5)458,
30(6)498,
30(6)569,
31(1)61,
31(1)71,
31(1)76,
31(2)155,
31(3)229,
31(3)243,
31(3)283,
31(4)364,
31(6)490,
31(6)557,
31(6)564,
31(6)567,
32(1)45,
32(1)68,
32(1)76,
32(1)86,
32(1)93,
32(2)175,
32(4)351,
32(4)374,
32(4)377
- other,
31(3)243,
31(6)496,
31(6)517,
31(6)540,
32(1)29,
32(1)91,
32(2)127,
32(2)142,
32(2)152,
32(2)175,
32(3)262,
32(3)276,
32(5)422,
32(5)445
- processor,
23(2)147,
24(1)14,
24(1)62,
25(1)22,
25(4)423,
27(4)348,
28(1)29,
28(1)34,
28(2)148,
28(3)243,
28(4)357,
29(1)12,
29(4)289,
29(5)390,
29(6)486,
30(2)119,
30(3)214,
30(5)386,
30(5)393,
30(5)404,
30(5)413,
30(5)420,
30(5)433,
30(5)437,
31(1)12,
31(6)517,
31(6)540,
32(1)29,
32(1)91,
32(2)127,
32(2)142,
32(2)152,
32(2)175,
32(3)194,
32(3)276,
32(5)422,
32(5)437,
32(5)445,
32(6)571
- Program, Systems-,
31(6)540
- reducible,
27(2)176
- Systems--Program,
31(6)540
- Techniques--Graph,
32(1)45,
32(2)175
- time,
23(1)34,
23(2)147,
23(2)153,
23(3)262,
23(4)290,
24(1)85,
24(2)156,
25(1)32,
25(1)45,
25(2)193,
25(4)429,
26(2)154,
26(3)224,
26(4)293,
26(4)320,
27(1)27,
27(3)201,
27(3)246,
27(3)254,
27(4)368-1,
28(1)9,
28(1)54,
28(1)78,
28(2)105,
28(3)309,
28(4)409,
28(4)412,
29(1)47,
29(1)52,
29(2)103,
29(2)118,
29(2)176,
29(3)229,
29(3)269,
29(5)390,
29(5)396,
29(5)436,
30(3)249,
30(4)362,
30(4)372,
30(4)376,
30(5)475,
30(6)519,
30(6)535,
31(3)243,
31(3)279,
31(3)283,
31(6)496,
31(6)553,
32(3)212,
32(3)228,
32(3)241,
32(4)374,
32(5)474
- variable,
25(1)17,
25(1)48,
26(3)282,
28(3)291,
29(1)17,
32(3)246