A fully abstract may testing semantics for concurrent objects

被引：13

作者：

Jeffrey, A ^{[1
]}

Rathke, J ^{[1
]}

机构：

[1] De Paul Univ, CTI, Chicago, IL 60614 USA

来源：

17TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS | 2002年

关键词：

D O I：

10.1109/LICS.2002.1029820

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This paper provides a fully abstract semantics for a variant of the concurrent object calculus. We define may testing for concurrent object components and then characterise it using a trace semantics inspired by UML interaction diagrams. The main result of this paper is to show that the trace semantics is fully abstract for may testing. This is the first such result for a concurrent object language.

引用

页码：101 / 112

页数：12

共 50 条

[41] TESTING EQUIVALENCES AND FULLY ABSTRACT MODELS FOR PROBABILISTIC PROCESSES
CHRISTOFF, I
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 458 : 126 - 140
[42] There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Computer Science Department, Uppsala University, Box 311, S-751 05 Uppsala, Sweden
[J]. Inf. Process. Lett., 6 (289-293):
[43] A FULLY ABSTRACT SEMANTICS AND A PROOF SYSTEM FOR AN ALGOL-LIKE LANGUAGE WITH SHARING
BROOKES, SD
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 239 : 59 - 100
[44] Better Late Than Never A Fully-Abstract Semantics for Classical Processes
Kokke, Wen
Montesi, Fabrizio
Peressotti, Marco
[J]. PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2019, 3
[45] There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Nystrom, SO
[J]. INFORMATION PROCESSING LETTERS, 1996, 60 (06) : 289 - 293
[46] First steps towards fully abstract semantics for object-oriented languages
[J]. Yelland, P.M., 1600, (32):
[47] A fully abstract semantics for a higher-order functional language with nondeterministic computation
Jeffrey, A
[J]. THEORETICAL COMPUTER SCIENCE, 1999, 228 (1-2) : 105 - 150
[48] A fully abstract denotational semantics for the calculus of higher-order communicating systems
Thomsen, B
Abramsky, S
[J]. THEORETICAL COMPUTER SCIENCE, 2001, 254 (1-2) : 557 - 589
[49] FULLY ABSTRACT MODELS FOR COMMUNICATING PROCESSES WITH RESPECT TO WEAK LINEAR SEMANTICS WITH DIVERGENCE
HORITA, E
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1992, E75D (01) : 64 - 77
[50] Testing concurrent objects with application-specific schedulers
Schlatte, Rudolf
Aichernig, Bernhard
de Boer, Frank
Griesmayer, Andreas
Johnsen, Einar Broch
[J]. THEORETICAL ASPECTS OF COMPUTING - ICTAC 2008, PROCEEDINGS, 2008, 5160 : 319 - +

← 1 2 3 4 5 →