Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communication and concurrency
A domain equation for bisimulation
Information and Computation
Research topics in functional programming
Co-induction in relational semantics
Theoretical Computer Science
Structured operational semantics and bisimulation as a congruence
Information and Computation
A calculus of mobile processes, I
Information and Computation
A co-induction principle for recursively defined domains
Theoretical Computer Science
Journal of the ACM (JACM)
Algebraic theories for name-passing calculi
Information and Computation
Testing equivalence for mobile processes
Information and Computation
Bisimulation equivalence is decidable for all context-free processes
Information and Computation
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Locality and interleaving semantics in calculi for mobile processes
Theoretical Computer Science
A &pgr;-calculus with explicit substitutions
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Algebraic Proofs of Properties of Objects
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Transition System Specifications with Negative Premises (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Initial Algebra and Final Coalgebra Semantics for Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
On message deliverability and non-uniform receptivity
Fundamenta Informaticae
A fully abstract model for the π-calculus
Information and Computation
Mathematical Structures in Computer Science
A coinductive calculus of streams
Mathematical Structures in Computer Science
On bisimulations for the spi calculus
Mathematical Structures in Computer Science
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Mathematical Structures in Computer Science
Processes as formal power series: a coinductive approach to denotational semantics
Theoretical Computer Science
Proof Methods for Corecursive Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
New up-to techniques for weak bisimulation
Theoretical Computer Science
Information and Computation
A duality between proof systems for cyclic term graphs
Mathematical Structures in Computer Science
Simulations Up-to and Canonical Preorders
Electronic Notes in Theoretical Computer Science (ENTCS)
Using bisimulation proof techniques for the analysis of distributed abstract machines
Theoretical Computer Science
(Bi)simulations up-to characterise process semantics
Information and Computation
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
A compositional theory for STM Haskell
Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Encoding Asynchronous Interactions Using Open Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
From Active Names to π-calculus Rewriting Rules
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Observational Theory of the CPS-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A process calculus for Mobile Ad Hoc Networks
Science of Computer Programming
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Complete lattices and up-to techniques
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
On bisimilarity and substitution in presence of replication
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Bisimulation proof methods in a path-based specification language for polynomial coalgebras
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
A testing theory for a higher-order cryptographic language
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Beyond bisimulation: the "up-to" techniques
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Up-to techniques for weak bisimulation
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Weak bisimulation up to elaboration
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
The bisimulation proof method: enhancements and open problems
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Incremental pattern-based coinduction for process algebra and its isabelle formalization
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Bisimulations for untyped imperative objects
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Proof Methods for Corecursive Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
On message deliverability and non-uniform receptivity
Fundamenta Informaticae
The power of parameterization in coinductive proof
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Checking NFA equivalence with bisimulations up to congruence
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Making the java memory model safe
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic bisimulation for a higher-order distributed language with passivation
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Adding coinduction into discrete mathematics
Journal of Computing Sciences in Colleges
Hi-index | 0.00 |
The most popular method for establishing bisimilarities among processes is to exhibit bisimulation relations. By definition, ℛ is a bisimulation relation if ℛ progresses to ℛ itself, i.e., pairs of processes in ℛ can match each other's actions and their derivatives are again in ℛ.We study generalisations of the method aimed at reducing the size of the relations to be exhibited and hence relieving the proof work needed to establish bisimilarity results. We allow a relation ℛ to progress to a different relation ℱ (ℛ), where ℱ is a function on relations. Functions that can be safely used in this way (i.e., such that if ℛ progresses to ℱ (ℛ), then ℛ only includes pairs of bisimilar processes) are sound. We give a simple condition that ensures soundness. We show that the class of sound functions contains non-trivial functions and we study the closure properties of the class with respect to various important function constructors, like composition, union and iteration. These properties allow us to construct sophisticated sound functions – and hence sophisticated proof techniques for bisimilarity – from simpler ones.The usefulness of our proof techniques is supported by various non-trivial examples drawn from the process algebras CCS and π-calculus. They include the proof of the unique solution of equations and the proof of a few properties of the replication operator. Among these, there is a novel result that justifies the adoption of a simple form of prefix-guarded replication as the only form of replication in the π-calculus.