Entry Tiomkin:1989:PTV from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Tiomkin:1989:PTV,
  author =       "M. Tiomkin",
  title =        "Probabilistic termination versus fair termination",
  journal =      j-THEOR-COMP-SCI,
  volume =       "66",
  number =       "3",
  pages =        "333--340",
  day =          "26",
  month =        aug,
  year =         "1989",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Technion-Israel Inst. of
                 Technol., Haifa, Israel",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; concurrent programs; fair termination;
                 probabilistic termination; program verification;
                 recursive ordinals",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}
Related entries
- C6150G,
46(2)175,
50(3)285,
61(2)225,
66(3)299,
69(2)117
 
- concurrent,
36(1)27,
38(1)1,
38(2)193,
39(2)107,
40(2)149,
43(2)213,
43(2)277,
45(1)1,
46(2)285,
49(2)185,
50(3)241,
51(3)281,
55(1)1,
55(1)87,
56(1)37,
58(0)3,
58(1)3,
58(1)183,
58(1)263,
58(1)347,
58(1)379,
59(1)25,
60(1)1,
61(1)93,
61(2)121,
64(3)221,
64(3)281,
65(1)35,
66(0)117,
66(2)117,
69(1)69
 
- debugging,
46(2)175,
50(3)285,
61(2)225,
66(3)299,
69(2)117
 
- Diagnostic,
46(2)175,
50(3)285,
61(2)225,
66(3)299,
69(2)117
 
- evaluating,
41(2)319,
46(2)175,
50(3)285,
54(2)315,
61(2)225,
66(3)299,
69(2)117
 
- fair,
37(3)305,
45(2)193,
49(2)121,
51(1)129,
58(1)263,
59(3)235,
64(3)221,
64(3)281,
64(3)305
 
- probabilistic,
38(1)69,
40(1)57,
41(2)325,
49(2)267,
52(3)269,
53(1)67,
53(1)z,
54(1)65,
57(0)3,
57(1)87,
58(1)129,
58(1)263,
62(3)251
 
- recursive,
35(2)227,
35(2)261,
36(1)1,
37(1)77,
38(1)17,
38(1)35,
39(1)15,
39(2)207,
40(2)323,
41(1)33,
41(2)289,
42(1)1,
42(2)123,
42(3)251,
44(3)307,
45(1)1,
45(2)193,
46(2)239,
47(2)121,
47(2)131,
47(3)299,
51(1)129,
52(3)281,
53(1)25,
53(1)z,
54(1)29,
57(2)327,
60(1)83,
60(3)297,
61(2)103,
62(0)3,
62(1)187,
62(3)289,
63(1)43,
63(3)253,
66(3)255,
66(3)289,
68(3)303,
69(1)1
 
- termination,
43(2)123,
46(2)305,
50(3)285,
56(3)345,
58(1)263,
61(2)225,
62(1)187
 
- testing,
35(1)109,
37(2)151,
38(2)323,
41(1)81,
44(1)69,
46(2)175,
47(3)277,
50(3)241,
50(3)285,
53(2)225,
56(2)211,
61(2)225,
64(2)175,
66(2)157,
66(3)299,
69(2)117
 
- verification,
38(2)269,
43(2)277,
50(3)285,
53(1)3,
56(1)59,
56(1)135,
58(1)249,
61(2)225,
66(3)299,
68(3)277,
69(2)117