Entry Mancini:1989:PCP from compj1980.bib
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{Mancini:1989:PCP,
author = "L. V. Mancini and G. P. Pappalardo",
title = "Proving correctness properties of a replicated
synchronous program",
journal = j-COMP-J,
volume = "32",
number = "5",
pages = "437--444",
month = oct,
year = "1989",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/32.5.437",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:27 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/32/5.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_05/",
URL = "http://comjnl.oxfordjournals.org/content/32/5/437.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_05/tiff/437.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_05/tiff/438.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_05/tiff/439.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_05/tiff/440.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_05/tiff/441.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_05/tiff/442.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_05/tiff/443.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_05/tiff/444.tif",
acknowledgement = ack-nhfb,
affiliation = "Dipartimento di Inf., Pisa Univ., Italy",
classcodes = "C4240 (Programming and algorithm theory); C5620
(Computer networks and techniques); C5470 (Performance
evaluation and testing)",
classification = "C4240 (Programming and algorithm theory); C5470
(Performance evaluation and testing); C5620 (Computer
networks and techniques)",
corpsource = "Dipartimento di Inf., Pisa Univ., Italy",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "agreement protocol; Agreement protocol; axiomatic
approach; Axiomatic approach; correctness properties;
Correctness properties; distributed computing;
Distributed computing; distributed processing; fault
tolerant computing; fault-tolerance technique;
Fault-tolerance technique; faulty processors; Faulty
processors; N-modular; N-modular redundancy;
programming theory; redundancy; replicated synchronous
program; Replicated synchronous program; theorem
proving",
thesaurus = "Distributed processing; Fault tolerant computing;
Programming theory; Theorem proving",
}
Related entries
- approach,
23(1)3,
23(1)9,
23(1)28,
23(2)114-1,
23(3)223,
23(3)256,
23(4)317,
24(3)222,
24(4)320,
25(1)12,
25(3)353,
25(4)410,
25(4)442,
25(4)492,
26(3)255,
26(3)283,
26(4)293,
26(4)360,
26(4)383,
27(1)3,
27(1)37,
27(2)171,
27(3)246,
28(1)59,
28(1)89,
28(2)97,
28(2)162,
28(4)353,
29(2)161,
29(2)189,
29(2)189-1,
29(3)222,
29(4)330,
29(5)385,
30(1)8,
30(2)119,
30(2)176,
30(3)258,
30(5)393,
30(5)437,
30(6)507,
31(2)133,
31(2)182,
31(3)243,
31(5)409,
32(2)152,
32(2)162,
32(5)386
- axiomatic,
27(4)340,
29(4)330,
29(5)404,
30(3)239,
31(4)313
- C4240,
31(6)517,
31(6)545,
31(6)553,
31(6)557,
31(6)561,
31(6)567,
32(2)187,
32(5)470,
32(5)474,
32(6)567,
32(6)571
- C5470,
31(5)437
- C5620,
31(5)474,
31(6)496,
32(3)267
- computing,
23(1)85,
23(4)324,
23(4)347,
23(4)353,
24(1)52,
24(1)96,
24(2)162,
24(2)167,
25(1)22,
25(2)188,
25(2)207,
25(2)287,
25(3)338,
25(3)397,
26(2)187,
26(2)187,
26(3)224,
26(4)296,
27(1)8,
27(2)97,
27(3)193,
28(2)117,
28(3)243,
28(5)498,
29(2)161,
29(3)229,
29(4)348,
29(4)373,
30(1)20,
30(2)110,
30(3)193,
30(3)258,
30(3)268,
30(3)277,
30(3)282,
30(4)298,
30(5)413,
30(5)420,
30(5)437,
31(1)12,
31(2)175,
31(2)182,
31(3)201,
31(4)364,
31(6)567,
32(3)281,
32(4)362,
32(4)370,
32(5)385,
32(5)453
- correctness,
23(1)41,
27(3)230,
29(5)423,
29(6)531,
30(2)168,
30(4)376,
31(3)229,
31(4)289,
31(6)503
- evaluation,
23(2)142,
23(2)187-1,
24(3)288,
25(2)183,
25(2)188,
25(2)239,
25(4)493,
26(2)134,
27(1)87,
27(3)201,
28(2)128,
28(2)142,
28(3)223,
28(3)309,
28(3)319,
28(4)409,
28(4)426,
29(4)380,
29(4)380-1,
29(5)390,
29(5)396,
30(3)214,
30(3)228,
30(4)289,
30(4)362,
30(4)376,
30(5)437,
30(6)481,
30(6)519,
31(1)12,
31(3)220,
31(4)304,
31(5)409,
31(5)437,
31(6)565,
32(1)36,
32(2)98,
32(2)142,
32(2)162,
32(5)461
- fault, 25-3-400-d-400,
29(3)269,
30(1)20,
30(4)362,
31(3)201
- faulty,
31(3)201
- performance,
24(2)132,
24(4)343,
24(4)347,
24(4)384-2,
25(1)74,
25(2)169,
25(2)188,
25(2)193,
25(2)227,
25(3)347,
25(4)486,
26(1)93,
26(2)113,
27(1)27,
27(2)143,
27(2)165,
27(3)201,
27(3)238,
27(3)270,
28(2)142,
28(2)179,
28(3)231,
28(3)309,
28(3)319,
28(3)330,
28(4)409,
28(4)426,
28(5)501,
29(1)47,
29(2)118,
29(4)289,
29(5)390,
29(5)396,
29(5)451,
30(4)289,
30(4)362,
30(6)519,
30(6)535,
31(1)12,
31(3)276,
31(4)304,
31(5)409,
31(5)437,
31(5)445,
31(6)490,
31(6)565,
32(1)16,
32(2)142,
32(2)152,
32(3)228,
32(3)252,
32(4)333,
32(5)453
- 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,
31(6)545,
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)445,
32(6)571
- property,
25(4)471,
28(3)298,
28(4)406,
28(4)439,
29(5)404,
30(1)27,
31(1)25,
31(4)325,
31(6)564,
32(2)122,
32(5)445
- protocol,
25(1)22,
27(1)86,
29(4)289,
31(4)289,
31(4)296,
31(5)474,
31(6)496,
32(3)252,
32(3)267,
32(4)362
- proving,
27(3)230,
28(2)105,
28(5)474,
31(1)51,
31(6)510
- redundancy,
31(6)490
- replicated,
28(5)518
- synchronous,
32(4)362
- testing,
25(4)465,
27(3)201,
27(3)238,
27(4)340,
29(4)380,
29(4)380-1,
29(5)416,
30(1)63,
30(3)258,
30(4)378,
31(1)12,
31(1)17,
31(3)201,
31(5)437
- theorem,
27(1)8,
27(3)230,
28(2)105,
28(5)474,
29(3)277,
31(1)17,
31(1)51,
31(6)510
- tolerant,
29(3)269,
30(1)20,
31(3)201,
32(4)323