A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Tentative steps toward a development method for interfering programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tableau-based model checking in the propositional mu-calculus
Acta Informatica
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Selected papers of the 3rd workshop on Concurrency and compositionality
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Local Model Checking in the Modal Mu-Calculus
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
A Spatial Logic for Concurrency (Part II)
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Compositional Verification of CCS Processes
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Elimination of quantifiers and undecidability in spatial logics for concurrency
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
A semantics for concurrent separation logic
Theoretical Computer Science
Separation Logic Semantics for Communicating Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Property-preserving refinement of concurrent systems
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Verification architectures: compositional reasoning for real-time systems
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Context aware specification and verification of distributed systems
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
| Hi-index | 0.01 |
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification of concurrent systems within the process algebraic approach can be performed by checking that processes enjoy properties described by some temporal logic's formulae. In this paper we present a formal framework that permits verifying properties of concurrent and communicating systems by using an assumption-guarantee approach. Each system component is not considered in isolation, but in conjunction with assumptions about the context of the component. In the paper we introduce a sound and complete proof system that permits verifying whether a process, when it is executed in an environment for which we provide some assumptions, satisfies a given formula. It is also ensured that property satisfaction is preserved whenever the context is partially instantiated (implemented) as a concrete process that verifies the assumptions we have for the environment.