Sciweavers

22 search results - page 1 / 5
» Checking and inferring local non-aliasing
Sort
View
PLDI
2003
ACM
13 years 9 months ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
INFOCOM
2007
IEEE
13 years 10 months ago
Toward Optimal Network Fault Correction via End-to-End Inference
— We consider an end-to-end approach of inferring network faults that manifest in multiple protocol layers, with an optimization goal of minimizing the expected cost of correctin...
Patrick P. C. Lee, Vishal Misra, Dan Rubenstein
CADE
2001
Springer
14 years 4 months ago
Termination and Reduction Checking for Higher-Order Logic Programs
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
Brigitte Pientka
TPDS
2010
142views more  TPDS 2010»
13 years 2 months ago
Toward Optimal Network Fault Correction in Externally Managed Overlay Networks
—We consider an end-to-end approach of inferring probabilistic data-forwarding failures in an externally managed overlay network, where overlay nodes are independently operated b...
Patrick P. C. Lee, Vishal Misra, Dan Rubenstein
BIRTHDAY
2005
Springer
13 years 6 months ago
A Mobility Calculus with Local and Dependent Types
Abstract. We introduce an ambient-based calculus that combines ambient mobility with process mobility, uses group names to collect ambients with homologous features, and exploits c...
Mario Coppo, Federico Cozzi, Mariangiola Dezani-Ci...