Sciweavers

1096 search results - page 71 / 220
» Type inference for atomicity
Sort
View
ACTA
2005
92views more  ACTA 2005»
13 years 9 months ago
Type-based information flow analysis for the pi-calculus
We propose a new type system for information flow analysis for the -calculus. As demonstrated by recent studies, information about whether each communication succeeds is important ...
Naoki Kobayashi
BMCBI
2007
102views more  BMCBI 2007»
13 years 9 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...
PODC
2010
ACM
14 years 1 months ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
FLAIRS
2007
13 years 11 months ago
Inference of Edge Replacement Graph Grammars
We describe an algorithm and experiments for inference of edge replacement graph grammars. This method generates candidate recursive graph grammar productions based on isomorphic ...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
TIT
2002
81views more  TIT 2002»
13 years 8 months ago
Multicast topology inference from measured end-to-end loss
Abstract--The use of multicast inference on end-to-end measurement has recently been proposed as a means to infer network internal characteristics such as packet link loss rate and...
Nick G. Duffield, Joseph Horowitz, Francesco Lo Pr...