The following pages link to On the bisimulation proof method (Q4236205):
Displaying 39 items.
- Algorithms for Kleene algebra with converse (Q299194) (← links)
- Structural congruence for bialgebraic semantics (Q338626) (← links)
- A general account of coinduction up-to (Q523132) (← links)
- Locality and interleaving semantics in calculi for mobile processes (Q672123) (← links)
- Proving language inclusion and equivalence by coinduction (Q899321) (← links)
- Using bisimulation proof techniques for the analysis of distributed abstract machines (Q935472) (← links)
- A process calculus for mobile ad hoc networks (Q967528) (← links)
- On the observational theory of the CPS-calculus (Q968276) (← links)
- (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
- Some congruence properties for \(\pi\)-calculus bisimilarities (Q1129260) (← links)
- Process calculus based upon evaluation to committed form (Q1276241) (← links)
- A fully abstract model for the \(\pi\)-calculus. (Q1400720) (← links)
- A hierarchy of equivalences for asynchronous calculi (Q1772314) (← links)
- Distinguishing and relating higher-order and first-order processes by expressiveness (Q1935453) (← links)
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus (Q1941882) (← links)
- CoCon: a conference management system with formally verified document confidentiality (Q2031419) (← links)
- Corecursion up-to via causal transformations (Q2104483) (← links)
- A symbolic decision procedure for symbolic alternating finite automata (Q2130584) (← links)
- Diacritical companions (Q2133161) (← links)
- Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← links)
- New up-to techniques for weak bisimulation (Q2373744) (← links)
- Linear forwarders (Q2384926) (← links)
- Processes as formal power series: a coinductive approach to denotational semantics (Q2503337) (← links)
- GSOS for probabilistic transition systems (Q2842551) (← links)
- Simulations Up-to and Canonical Preorders (Q2871827) (← links)
- Extracting Proofs from Tabled Proof Search (Q2938048) (← links)
- Companions, Codensity and Causality (Q2988363) (← links)
- Metric Reasoning About $$\lambda $$-Terms: The General Case (Q2988646) (← links)
- A Testing Theory for a Higher-Order Cryptographic Language (Q3000588) (← links)
- SPEC: An Equivalence Checker for Security Protocols (Q3179281) (← links)
- Encoding Asynchronous Interactions Using Open Petri Nets (Q3184668) (← links)
- Up-To Techniques for Behavioural Metrics via Fibrations (Q5009431) (← links)
- Parameterizing higher-order processes on names and processes (Q5108373) (← links)
- Bisimulation and Co-induction: Some Problems (Q5262977) (← links)
- (Q5875344) (← links)
- Coinduction in Flow: The Later Modality in Fibrations (Q5875348) (← links)
- Characteristic formulae for liveness properties of non-terminating CakeML programs (Q5875446) (← links)
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus (Q6041667) (← links)
- Up-to techniques for behavioural metrics via fibrations (Q6190392) (← links)
