Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Modal logics for communicating systems
Theoretical Computer Science
Local model checking in the modal mu-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Proving properties of dynamic process networks
Information and Computation
Communication and Concurrency
Reasoning about Higher-Order Processes
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Toward Parametric Verification of Open Distributed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Toward a Modal Theory of Types for the pi-Calculus
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Compositional Verification of Secure Applet Interactions
FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Assume-Guarantee Verification of Concurrent Systems
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
State space representation for verification of open systems
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |
We present a proof system for verifying CCS processes in the modal µ-calculus. Its novelty lies in the generality of the proof judgements allowing parametric and compositional reasoning in this complex setting. This is achieved, in part, by the use of explicit fixed point ordinal approximations, and in part by a complete separation, following an approach by Simpson, of rules concerning the logic from the rules encoding the operational semantics of the process language.