A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
A compositional protocol verification using relativized bisimulation
Information and Computation
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A Discipline of Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Compositional Theories Based on an Operational Semantics of Contexts
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning
ACM Transactions on Software Engineering and Methodology (TOSEM)
Automated Assume-Guarantee Reasoning by Abstraction Refinement
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Assume-Guarantee Verification of Concurrent Systems
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Context aware specification and verification of distributed systems
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
| Hi-index | 0.00 |
Verification of concurrent systems within the process algebraic approach can be performed by checking that processes enjoy properties described by formulae of a temporal logic. However, to use these approach a complete description of the considered system has to be provided. In a previous work we propose a formal framework based on an assumption-guarantee approach where each system component is not considered in isolation, but in conjunction with assumptions about the context of the component. In the present paper we propose a procedure to refine the set of context assumptions. In each of the refinement steps the environment is partially instantiated with a process algebraic term while formulae satisfaction is preserved.