Squeezing streams and composition of self-stabilizing algorithms
From MaRDI portal
Recommendations
Cites work
- A self-stabilizing k-clustering algorithm for weighted graphs
- An application of co-inductive types in Coq: verification of the alternating bit protocol
- An Axiomatization of Linear Temporal Logic in the Calculus of Inductive Constructions
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Coinductive big-step operational semantics
- Competitive self-stabilizing \(k\)-clustering
- Copatterns, programming infinite structures by observations
- Formal Verification of Distributed Algorithms
- Formal verification of mobile robot protocols
- How to write a 21\(^{\text{st}}\) century proof
- scientific article; zbMATH DE number 2036567 (Why is no real title available?)
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Mechanizing coinduction and corecursion in higher-order logic
- Model checking of a mobile robots perpetual exploration algorithm
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- Typed Lambda Calculi and Applications
This page was built for publication: Squeezing streams and composition of self-stabilizing algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190178)