Tower induction and up-to techniques for CCS with fixed points

DOI10.1007/978-3-319-57418-9_17zbMATH Open1486.68117OpenAlexW2609910004MaRDI QIDQ5283217FDOQ5283217

Authors: Steven Schäfer, Gert Smolka 

Publication date: 21 July 2017

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-57418-9_17

Recommendations

• Coinduction All the Way Up
• A general account of coinduction up-to
• Coinduction up-to in a fibrational setting
• Automata, Languages and Programming
• Beyond Bisimulation: The “up-to” Techniques

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Formalization of mathematics in connection with theorem provers (68V20)

Cites Work

• The power of parameterization in coinductive proof
• A lattice-theoretical fixpoint theorem and its applications
• Title not available (Why is that?)
• Monads need not be endofunctors
• On the bisimulation proof method
• Complete Lattices and Up-To Techniques
• Weak Bisimulation Up to Elaboration
• Transfinite constructions in classical type theory
• Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
• Coinduction All the Way Up
• The largest respectful function
• On the Bourbaki-Witt principle in toposes
• Types for Proofs and Programs

Cited In (1)

• Diacritical companions

Uses Software

• Coq
• Paco

This page was built for publication: Tower induction and up-to techniques for CCS with fixed points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283217)