Communicating sequential processes
Communicating sequential processes
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communication and concurrency
Software architecture: perspectives on an emerging discipline
Software architecture: perspectives on an emerging discipline
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Checking safety properties using compositional reachability analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Exploiting ADLs to specify architectural styles induced by middleware infrastructures
Proceedings of the 21st international conference on Software engineering
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Concurrency: state models & Java programs
Concurrency: state models & Java programs
Revised Papers from the Second International Workshop on Engineering Distributed Objects
EDO '00 Revised Papers from the Second International Workshop on Engineering Distributed Objects
Process Algebraic Specification of the New Asynchronous CORBA Messaging Service
ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
Deadlock detection in distribution object systems
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Exploring implicit parallelism in class diagrams
Journal of Systems and Software
| Hi-index | 0.00 |
We demonstrate how the use of synchronization primitives and threading policies in distributed object middleware can lead to deadlocks. We identify that object middleware only has a few built-in synchronization and threading primitives. We suggest to express them as stereotypes in UML models to allow designers to model synchronization and threading of distributed object systems at appropriate levels of abstraction. We define the semantics of these stereotypes by a mapping to a process algebra. This allows us to use model checking techniques that are available for process algebras to detect the presence or absence of deadlocks. We also discuss how the results of these model checks can be related back to the UML diagrams.