Sciweavers

1382 search results - page 4 / 277
» Formal Analysis of Online Algorithms
Sort
View
129
Voted
ICASSP
2010
IEEE
15 years 5 months ago
A general formalism for the analysis of distributed algorithms
The major contribution of this paper is the presentation of a general unifying description of distributed algorithms allowing to map local, node-based, algorithms onto a single gl...
Ondrej Sluciak, Thibault Hilaire, Markus Rupp
151
Voted
SAFECOMP
2007
Springer
15 years 11 months ago
Formal Specification and Analysis of AFDX Redundancy Management Algorithms
Jan Täubrich, Reinhard von Hanxleden
141
Voted
GI
2001
Springer
15 years 9 months ago
Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
Dominique Cansell, Dominique Méry, Stephan ...
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 9 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
135
Voted
ESA
2008
Springer
80views Algorithms» more  ESA 2008»
15 years 6 months ago
Randomized Competitive Analysis for Two-Server Problems
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara