Incremental pattern-based coinduction for process algebra and its isabelle formalization

Authors:
Andrei Popescu;Elsa L. Gunter
Affiliations:
University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign
Venue:
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Year:
2010

Citing 22
Cited 1

Structured operational semantics and bisimulation as a congruence

Information and Computation
Bisimulation can't be traced

Journal of the ACM (JACM)
Communication and concurrency

Communication and concurrency
Bisimilarity of open terms

Information and Computation - Special issue on EXPRESS 1997
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
A mechanized theory of the &pi-calculus in Hol

Nordic Journal of Computing
An Application of Co-inductive Types in Coq: Verification of the Alternating Bit Protocol

TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
The Maude System

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Circular Coinductive Rewriting

ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Elements of stream calculus (an extensive exercise in coinduction)

Elements of stream calculus (an extensive exercise in coinduction)
Generalised coinduction

Mathematical Structures in Computer Science
On the bisimulation proof method

Mathematical Structures in Computer Science
A fully adequate shallow embedding of the π-calculus in IsabelleF;HOL with mechanized syntax analysis

Journal of Functional Programming
SOS formats and meta-theory: 20 years after

Theoretical Computer Science
On Process Equivalence = Equation Solving in CCS

Journal of Automated Reasoning
CIRC: a circular coinductive prover

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Circular coinduction: a proof theoretical foundation

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Weak bisimilarity coalgebraically

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
CIRC: a behavioral verification tool based on circular coinduction

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
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
Iterative circular coinduction for CoCasl in isabelle/HOL

FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering

The power of parameterization in coinductive proof

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a coinductive proof system for bisimilarity in transition systems specifiable in the de Simone SOS format. Our coinduction is incremental, in that it allows building incrementally an a priori unknown bisimulation, and pattern-based, in that it works on equalities of process patterns (i.e., universally quantified equations of process terms containing process variables), thus taking advantage of equational reasoning in a “circular” manner, inside coinductive proof loops. The proof system has been formalized and proved sound in Isabelle/HOL.