Sciweavers

72 search results - page 1 / 15
» Hierarchical Correctness Proofs for Distributed Algorithms
Sort
View
PODC
1987
ACM
13 years 11 months ago
Hierarchical Correctness Proofs for Distributed Algorithms
Abstract: We introduce the input-output automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular...
Nancy A. Lynch, Mark R. Tuttle
ICDCS
1998
IEEE
13 years 11 months ago
A Protocol and Correctness Proofs for Real-Time High-Performance Broadcast Networks
Novel real-time applications require highperformance real-time distributed systems, and therefore high-performance real-time networks. We examine a Hard Real-Time Distributed Mult...
Jean-François Hermant, Gérard Le Lan...
FMSD
2002
114views more  FMSD 2002»
13 years 7 months ago
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
Ruben Gamboa
IPPS
1998
IEEE
13 years 11 months ago
Mechanically Verifying the Correctness of the Fast Fourier Transform in ACL2
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...
Ruben Gamboa
VLDB
1989
ACM
44views Database» more  VLDB 1989»
13 years 11 months ago
Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi se...
Weimin Du, Ahmed K. Elmagarmid