Proceedings of the Fourth Annual Symposium on Logic in computer science
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information systems modelling with TROLL formal methods at work
Information Systems - Special issue: advanced information systems engineering
Logics for specifying concurrent information systems
Logics for databases and information systems
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
Action versus State based Logics for Transition Systems
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
The Need for Compositional Proof Systems: A Survey
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
The TROLL Approach to Conceptual Modeling: Syntax, Semantics and Tools
ER '98 Proceedings of the 17th International Conference on Conceptual Modeling
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Verifying the Correctness of AADL Modules Using Model Checking
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Observers are objects inside or outside a concurrent object system carrying checking conditions about objects in the system (possibly including itself). In a companion paper [EP00], we show how to split and localise checking conditions over the objects involved so that the local conditions can be checked separately, for instance using model checking. As a byproduct of this translation, the necessary communication requirements are generated, taking the form of RPC-like action calls (like in a CORBA environment) among newly introduced communication symbols. In this paper, we give an algorithmic method that matches these communication requirements with the communication pattern created during system specification and development. As a result, correctness of the latter can be proved. In case of failure, the algorithm gives warnings helping to correct the communication specification.