Entry Francez:1984:LHS from tcs1980.bib
Last update: Thu Sep 27 02:46:46 MDT 2018
Top |
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{Francez:1984:LHS,
author = "N. Francez and D. Lehmann and A. Pnueli",
title = "A linear-history semantics for languages for
distributed programming",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "25--46",
month = jul,
year = "1984",
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/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Technion-Israel Inst. of Technol., Haifa, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "attainable states; communicating sequential processes;
deadlocks; denotational semantics; distributed
programming languages; expectation sets; linear
communication sequences; linear-history semantics;
matching; merging; ordering; parallel processing;
programming theory; semantic domains",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- communicating,
24(2)131,
26(1)105,
29(3)231,
33(1)45,
33(2)279
- deadlock,
13(1)3,
18(2)149
- denotational,
18(2)173,
20(2)95,
20(3)265,
23(2)187,
26(1)53,
27(3)297,
32(1)121,
33(2)279,
34(1)33
- distributed,
13(1)17,
13(1)61,
13(1)109,
24(1)1,
25(3)267,
29(3)231,
30(3)241,
32(1)157,
34(1)215
- domain,
13(1)85,
16(1)93,
23(1)11,
26(1)149,
27(1)109,
27(1)167,
29(1)155,
33(2)195,
33(2)279,
34(1)135,
34(3)275
- Francez, N.,
29(3)231
- Lehmann, D.,
17(2)151,
34(1)215
- linear,
10(2)123,
11(1)1,
11(3)321,
12(3)229,
13(1)109,
14(3)337,
15(1)77,
16(3)307,
16(3)329,
18(2)207,
19(1)39,
19(2)203,
19(3)321,
19(3)337,
22(1)95,
22(1)195,
22(3)285,
22(3)317,
23(1)95,
23(2)171,
23(3)333,
24(2)143,
29(1)1,
32(1)47,
32(3)227,
32(3)339,
33(1)107,
33(1)117,
33(2)261,
34(1)135,
34(1)207
- matching,
12(3)303,
24(2)179
- merging,
14(1)19,
32(1)157
- ordering,
17(3)279,
26(1)149,
29(3)251,
32(3)249
- parallel,
10(2)133,
12(1)39,
21(1)105,
23(2)107,
24(1)53,
26(1)225,
27(1)217,
29(1)167,
30(1)91,
31(1)13,
31(1)83,
32(1)157,
32(3)227,
34(1)33,
34(1)83,
34(1)135
- Pnueli, A.,
13(1)45,
33(1)65,
34(1)215
- process,
10(2)133,
10(2)187,
21(3)315,
24(1)1,
24(2)131,
26(1)105,
26(3)343,
28(1)171,
29(3)231,
30(1)91,
31(1)83,
33(2)279,
34(1)83
- processing,
12(1)39,
13(1)17,
13(1)61,
18(2)173,
23(1)37,
23(2)107,
24(1)1,
24(2)161,
24(3)221,
26(1)83,
29(1)167,
29(3)231,
32(1)157,
32(3)227,
33(2)139,
34(1)33,
34(1)83,
34(1)135,
34(1)215
- semantic,
11(2)181,
11(3)227,
12(1)19,
12(3)229,
13(1)3,
13(1)45,
13(2)193,
13(3)239,
14(3)305,
15(1)1,
15(2)159,
15(2)213,
15(3)223,
17(3)259,
18(1)1,
18(1)41,
18(2)149,
18(2)173,
19(1)69,
19(2)117,
20(2)95,
20(3)265,
22(1)1,
22(1)19,
22(1)127,
23(1)11,
23(2)187,
24(1)73,
24(2)131,
25(2)95,
26(1)53,
26(1)121,
26(1)149,
27(1)225,
27(3)255,
27(3)297,
28(1)45,
29(1)167,
29(3)231,
31(1)49,
31(1)175,
31(3)263,
32(1)121,
33(2)139,
33(2)195,
33(2)279,
34(1)33,
34(1)135,
34(3)289
- sequence,
10(1)107,
11(3)247,
12(3)339,
13(1)45,
14(2)127,
14(3)247,
15(2)213,
16(2)211,
18(3)279,
25(3)311,
26(3)301,
29(3)285,
31(1)125,
31(1)139,
32(3)321
- sequential,
10(1)19,
11(3)247,
12(1)39,
19(2)219,
20(3)265,
23(1)95,
24(2)131,
29(1)87,
32(3)227,
33(2)279,
34(1)135
- set,
10(1)19,
12(2)161,
12(3)325,
13(2)137,
13(3)295,
14(3)317,
14(3)337,
15(1)27,
15(2)181,
16(2)231,
17(1)75,
17(2)151,
18(1)95,
18(3)325,
19(1)29,
19(1)39,
19(3)287,
21(1)1,
21(1)91,
21(3)315,
22(1)19,
22(3)253,
23(1)83,
23(3)333,
24(1)105,
24(3)279,
26(3)243,
28(3)315,
29(1)185,
31(1)1,
31(3)337,
32(1)61,
32(1)173,
32(3)279,
33(2)239,
34(1)17,
34(1)227,
34(3)275,
34(3)337,
34(3)343
- state,
11(2)167,
13(1)45,
14(3)211,
17(1)99,
18(1)33,
23(1)95,
23(2)107,
23(2)155,
24(2)179,
29(1)87