A fully abstract may testing semantics for concurrent objects
Proceedings - Symposium on Logic in Computer Science - Trang 101-112
Tóm tắt
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.
Từ khóa
#Testing #Calculus #Unified modeling language #Yarn #Production facilities #Safety #Robustness #Visualization #Jacobian matrices #Standards developmentTài liệu tham khảo
10.1016/0890-5401(92)90008-4
10.1109/LICS.1993.287570
10.1016/0304-3975(77)90053-6
pitts, 1993, Observable properties of higher order functions that dynamically create local names, or: What's new?, Proc MFCS 93, 122
milner, 1999, Communicating and Mobile Systems
10.1016/0304-3975(77)90044-5
10.1109/LICS.2000.855780
10.1145/73560.73577
10.1006/inco.2000.2917
10.1109/LICS.1999.782586
10.1016/S1571-0661(04)00309-3
honda, 1992, On asynchronous communication semantics, Lecture Notes in Computer Science, 612, 10.1007/3-540-55613-3_2
morris, 1968, Lambda calculus models of programming languages
10.1109/32.859531
milner, 1992, Barbed bisimulation, Lecture Notes in Computer Science, 623, 10.1007/3-540-55719-9_114
10.1006/inco.2000.2930
abadi, 1996, A Theory of Objects, 10.1007/978-1-4419-8598-9
hennessy, 1996, A fully abstract denotational semantics for the ?-calculus
gordon, 1998, A concurrent object calculus: Reduction and typing, Proc High Level Concurrent Languages
fiore, 1996, A fully-abstract model for the ?-calculus, Proc IEEE Conf Logic in Computer Science
10.1017/S0956796898003165
booch, 1999, The Unified Modeling Language User Guide
hennessy, 1988, Algebraic Theory of Processes
10.1145/237721.237807