Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Modal logics for communicating systems
Theoretical Computer Science
Journal of the ACM (JACM)
Proving properties of dynamic process networks
Information and Computation
Model checking the full modal mu-calculus for infinite sequential processes
Theoretical Computer Science
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Modal and temporal properties of processes
Modal and temporal properties of processes
Local model checking for context-free processes
Nordic Journal of Computing
Toward Parametric Verification of Open Distributed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Compositional Proof Systems for Model Checking Infinite State Processes
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Compositional Verification of CCS Processes
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
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
Proof systems for π-calculus logics
Logic for concurrency and synchronisation
Cyclic proofs of program termination in separation logic
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reducing Behavioural to Structural Properties of Programs with Procedures
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
On the structure of inductive reasoning: circular and tree-shaped proofs in the µ-calculus
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Cyclic proofs for first-order logic with inductive definitions
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Reducing behavioural to structural properties of programs with procedures
Theoretical Computer Science
| Hi-index | 0.00 |
We present a sequent calculus for formally verifying modal 碌-calculus properties of concurrent processes. Building on work by Dam and Gurov, the proof system contains rules for the explicit manipulation of fixed-point approximants. We develop a new syntax for approximants, incorporating, in particular, modalities for approximant modification. We make essential use of this feature to prove our main result: the sequent calculus is complete for establishing arbitrary 碌-calculus properties of context-free processes.