A relaxation of Üresin and Dubois' asynchronous fixed-point theory in Agda

DOI10.1007/s10817-019-09536-wzbMath1468.68286OpenAlexW2995930820MaRDI QIDQ2209538

Matthew L. Daggitt, Ran Zmigrod, Timothy G. Griffin

Publication date: 2 November 2020

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-019-09536-w

zbMATH Keywords

iterative algorithmsAgdaformalisationasynchronous algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Formalization of mathematics in connection with theorem provers (68V20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Uses Software

• Agda
• GitHub
• RoutingLib

Cites Work

• Parallel asynchronous iterations of least fixed points
• Formalization and correctness of the PALS architectural pattern for distributed real-time systems
• Some convergence results for asynchronous algorithms
• The semantics and execution of a synchronous block-diagram language.
• On asynchronous iterations
• An Agda formalization of Üresin \& Dubois' asynchronous fixed-point theory
• Self-stabilization with path algebra
• A Brief Overview of Agda – A Functional Language with Dependent Types
• Parallel asynchronous algorithms for discrete data
• Unnamed Item
• Unnamed Item

This page was built for publication: A relaxation of Üresin and Dubois' asynchronous fixed-point theory in Agda