Üresin & Dubois provide sufficient conditions on iterative algorithms that guarantee convergence to unique fixed points for the associated asynchronous iterations. Proving such sufficient conditions for an iterative algorithm is often dramatically simpler than reasoning directly about an asynchronous implementation.
Jul 4, 2018
Abstract. In this paper we describe an Agda-based formalization of re- sults from Ьresin & Dubois' Parallel Asynchronous Algorithms for Dis- crete Data.
Missing: Üresin | Show results with:Üresin
In this paper we describe an Agda-based formalization of results from "{U}resin & Dubois' ``Parallel Asynchronous Algorithms for Discrete Data.
In this paper we describe an Agda-based formalization of results from Üresin & Dubois' “Parallel Asynchronous Algorithms for Discrete Data.
In this paper we describe an Agda-based formalization of results from Uresin and Dubois' ``Parallel Asynchronous Algorithms for Discrete Data.'' That paper ...
Baras, J.S., Theodorakopoulos, G.: Path problems in networks. · Bove, A., Dybjer, P., Norell, U.: A brief overview of Agda – a functional language with dependent ...
Bibliographic details on An Agda Formalization of Üresin and Dubois' Asynchronous Fixed-Point Theory.
Dec 10, 2019 · This paper makes several contributions to UD's existing theory. The original intention was to formalise the work of UD in the proof assistant ...
In this paper we describe an Agda-based formalization of results from Üresin & Dubois' “Parallel Asynchronous Algorithms for Discrete Data.” That paper ...
[PDF] A Relaxation of Üresin and Dubois' Asynchronous Fixed-Point ...
www.semanticscholar.org › paper
This paper demonstrates several ways in which the assumptions that underlie this theory may be relaxed and expands the set of schedules for which the ...