Tower Induction and Up-to Techniques for CCS with Fixed Points

DOI10.1007/978-3-319-57418-9_17zbMath1486.68117OpenAlexW2609910004MaRDI QIDQ5283217

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

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)

Related Items (1)

Diacritical companions

Uses Software

• Coq
• Paco

Cites Work

• Unnamed Item
• A lattice-theoretical fixpoint theorem and its applications
• On the Bourbaki–Witt principle in toposes
• The power of parameterization in coinductive proof
• Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
• Transfinite Constructions in Classical Type Theory
• Complete Lattices and Up-To Techniques
• Monads Need Not Be Endofunctors
• On the bisimulation proof method
• Coinduction All the Way Up
• The Largest Respectful Function
• Weak Bisimulation Up to Elaboration
• Types for Proofs and Programs

This page was built for publication: Tower Induction and Up-to Techniques for CCS with Fixed Points