Entry Sabelfeld:1990:ADF from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
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{Sabelfeld:1990:ADF,
author = "V. K. Sabelfeld",
title = "An algorithm deciding functional equivalence in a new
class of program schemes",
journal = j-THEOR-COMP-SCI,
volume = "71",
number = "2",
pages = "265--279",
day = "30",
month = mar,
year = "1990",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
conflocation = "Nice, France; 23-25 Feb. 1988",
conftitle = "INFORMATIKA 88. 2nd French-Soviet Workshop on Methods
of Compilation and Program Construction",
corpsource = "Comput. Center, Acad. of Sci., Novosibirsk, USSR",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm; automata theory; decidability; equivalence
classes; formal languages; free interpretation;
functional equivalence; predicate; program
optimization; program schemes; program verification;
through schemes; undecidable problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- decidability,
71(1)29,
71(3)281,
72(1)39,
73(3)295,
74(1)3,
74(1)71,
74(3)341,
78(2)347,
79(1)37,
79(1)263,
80(1)77,
80(2)227,
80(2)303,
81(1)137,
81(2)269,
81(2)289,
82(1)19,
82(1)131,
85(1)33,
85(2)253,
87(1)25,
87(2)287,
88(2)269,
88(2)325,
89(1)33,
91(1)71,
91(1)101,
94(1)1,
94(2)367,
95(1)115,
95(2)187,
96(2)325,
98(1)5,
98(2)199,
99(2)291,
101(1)143,
103(1)39,
103(1)143,
103(2)387,
106(1)87,
106(1)135,
106(2)337,
108(1)103,
108(2)237,
109(1)83,
110(1)145,
110(2)419,
112(2)311,
113(1)93,
113(1)119,
114(1)93,
116(2)339,
117(1)39,
118(2)167,
118(2)193,
120(2)229,
121(1)71,
121(1)89,
123(2)315,
126(1)31,
126(1)113,
127(1)1,
127(1)69,
127(1)149,
127(2)229,
129(1)167,
129(2)419,
130(2)239,
131(2)243,
131(2)271,
131(2)431,
131(2)441,
132(1)37,
132(1)85,
132(1)129,
132(1)395,
134(1)107,
134(1)175,
134(2)287,
134(2)311,
134(2)329,
134(2)365,
135(2)345
- deciding,
103(2)387,
112(2)311,
123(2)183,
131(2)441
- free,
70(2)179,
72(1)65,
73(1)81,
73(3)335,
74(1)3,
74(2)121,
78(2)319,
79(1)227,
79(1)241,
86(2)233,
92(1)77,
92(2)249,
92(2)269,
94(2)199,
94(2)367,
97(1)67,
97(2)301,
98(1)5,
98(1)79,
98(1)115,
99(2)231,
100(1)67,
100(2)267,
101(2)161,
102(1)185,
103(1)25,
103(1)51,
108(1)z,
112(2)311,
115(2)359,
116(2)421,
117(1)91,
117(1)217,
119(2)363,
121(1)309,
123(2)427,
125(2)167,
126(2)237,
134(1)3,
134(1)107,
134(1)209,
134(2)537
- functional,
70(1)99,
70(1)159,
70(2)193,
71(2)z,
71(3)381,
72(2)133,
72(2)225,
72(2)z,
77(3)291,
79(1)179,
80(1)105,
81(1)117,
81(2)201,
83(1)57,
87(1)209,
91(1)23,
93(1)1,
93(1)75,
93(2)201,
96(1)73,
101(1)143,
102(1)135,
103(2)235,
104(1)129,
104(2)313,
105(2)167,
111(1)3,
116(1)59,
117(1)45,
118(2)231,
119(1)145,
121(1)113,
121(1)145,
121(1)411,
122(1)201,
122(1)263,
123(2)397,
124(1)127,
131(1)219,
132(1)1,
133(2)387,
135(1)5,
136(1)243
- interpretation,
71(2)209,
75(1)3,
75(1)15,
75(1)157,
75(3)263,
79(1)179,
87(2)287,
92(1)145,
93(1)1,
94(2)215,
94(2)281,
95(1)43,
106(1)119,
111(1)3,
111(1)191,
115(2)291,
117(1)91,
117(1)113,
118(2)231,
119(1)23,
120(1)1,
120(1)69,
121(1)113,
122(1)3,
122(1)119,
124(1)93,
131(1)121,
133(2)267,
134(1)209,
135(1)5
- new,
71(1)29,
71(1)79,
71(2)209,
80(2)289,
80(2)303,
81(2)201,
81(2)237,
83(2)169,
85(2)305,
87(1)43,
91(2)205,
93(1)91,
103(2)283,
104(1)109,
117(1)289,
118(1)81,
119(1)23,
121(1)71
- optimization,
76(1)143,
80(2)303,
81(2)317,
82(1)1,
84(1)77,
84(2)179,
90(1)17,
90(1)61,
94(2)175,
97(1)105,
99(1)157,
104(2)285,
107(1)3,
107(1)145,
116(1)59,
118(2)231,
123(1)9,
125(1)17,
128(1)179,
134(2)493
- predicate,
75(1)111,
76(1)3,
76(1)115,
87(1)143,
89(1)63,
90(2)309,
93(2)169,
95(1)115,
100(2)365,
101(1)133,
101(2)337,
102(1)207,
104(1)109,
105(1)27,
107(2)277,
111(1)59,
111(1)z,
112(2)255,
116(1)151,
118(2)99,
122(1)119,
123(2)341,
124(2)221,
124(2)297,
131(1)121
- schemes,
71(2)z,
77(3)291,
81(2)295,
83(2)237,
99(1)1,
100(2)347,
110(2)419,
118(1)67,
129(1)123,
130(1)17
- through,
70(3)305,
115(1)151,
117(1)303,
136(1)183
- undecidable,
71(3)281,
83(2)169,
87(1)25,
106(2)337,
121(1)71,
127(2)229,
132(1)85,
132(1)129,
134(1)79,
134(2)311,
134(2)365
- verification,
70(1)127,
74(3)253,
79(2)295,
79(2)323,
80(2)263,
80(2)319,
88(1)15,
89(1)179,
90(1)37,
94(1)141,
94(2)237,
94(2)335,
96(1)157,
97(1)67,
101(2)289,
101(2)337,
102(1)165,
102(1)185,
103(2)191,
104(1)89,
105(1)129,
106(1)3,
107(2)305,
111(1)125,
112(1)145,
118(2)99,
119(1)23,
119(1)127,
119(1)173,
119(1)z,
120(1)69,
120(1)83,
120(1)123,
122(1)119,
124(1)180,
126(2)143,
128(1)99,
128(1)127,
129(1)123,
131(1)95,
131(1)139,
133(2)341,
135(2)319,
135(2)345