On the verification of open distributed systems
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
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
Toward Parametric Verification of Open Distributed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
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
Compositional Verification of CCS Processes
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Proof systems for π-calculus logics
Logic for concurrency and synchronisation
A spatial logic for concurrency--II
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Synthesis of Data Views for Communicating Processes
Logic-Based Program Synthesis and Transformation
| Hi-index | 0.01 |
We present a sequent calculus for proving that processes in a process algebra satisfy assertions in Hennessy-Milner logic. The main novelty lies in the use of the operational semantics to derive introduction rules (on the left and right of sequents) for the different operators of the process calculus. This gives a generic proof system applicable to any process algebra with an operational semantics specified in the GSOS format. We identify the desirable property of compositionality with cut-elimination, and we prove that this holds for a class of sequents. Further, we show that the proof system enjoys good completeness and omega- completeness properties relative to its intended model.