Sciweavers

72 search results - page 3 / 15
» Hierarchical Correctness Proofs for Distributed Algorithms
Sort
View
BIBE
2005
IEEE
115views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
GOMIT: A Generic and Adaptive Annotation Algorithm Based on Gene Ontology Term Distributions
We address the issue of providing highly informative annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a set of candidate ...
In-Yee Lee, Jan-Ming Ho, Ming-Syan Chen
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 7 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
PPOPP
2006
ACM
14 years 1 months ago
Proving correctness of highly-concurrent linearisable objects
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Mar...
CL
2012
Springer
11 years 9 months ago
Maintaining distributed logic programs incrementally
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedr...
SAC
2008
ACM
13 years 6 months ago
Preserving coordination properties when transforming concurrent system components
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
Gudmund Grov, Robert F. Pointon, Greg Michaelson, ...