Communicating Concurrent Objects in HiddenCCS

Authors:
Gabriel Ciobanu;Dorel Lucanu
Affiliations:
“A.I.Cuza” University, Faculty of Computer Science, Berthelot 16, 700483 Iaşi, Romania;“A.I.Cuza” University, Faculty of Computer Science, Berthelot 16, 700483 Iaşi, Romania
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 6
Cited 2

The concurrency workbench: a semantics-based tool for the verification of concurrent systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
A hidden agenda

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Circular Coinductive Rewriting

ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering

A specification language for coordinated objects

SAVCBS '05 Proceedings of the 2005 conference on Specification and verification of component-based systems
Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we add value-passing communication to hiddenCCS, a new formalism proposed in [G. Ciobanu, and D. Lucanu. Specification and Verification of Synchronizing Concurrent Objects. In E. Boiten, J. Derrick, and G. Smith (Eds.) IFM 2004, Lecture Notes in Computer Science vol. 2999, pp. 307-327, Springer, 2004] for synchronizing concurrent objects. We use hidden algebra to specify object-oriented systems, and CCS process algebra to describe the coordination aspects. The new specification formalism extends the object specification with synchronization and communication elements associated with methods and attributes of the objects, and use a CCS description of the interaction patterns. The operational semantics of hiddenCCS specifications is based on labeled transition systems which can be specified in rewriting logic. We use Maude as a platform for verification of the communicating concurrent objects specified in hiddenCCS. Triple Modular Redundancy is used as an example of a hiddenCCS specification and its verification in Maude.