Sciweavers

4386 search results - page 744 / 878
» A Tamper-Resistant Programming Language System
Sort
View
ICALP
2009
Springer
16 years 3 months ago
Forward Analysis for WSTS, Part II: Complete WSTS
Abstract. We describe a simple, conceptual forward analysis procedure for complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the ...
Alain Finkel, Jean Goubault-Larrecq
ICALP
2009
Springer
15 years 10 months ago
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
Abstract. We introduce a new theoretical model of ad hoc mobile computing in which agents have severely restricted memory, highly unpredictable movement and no initial knowledge of...
Rachid Guerraoui, Eric Ruppert
IFIP
2009
Springer
15 years 9 months ago
HMM-Based Trust Model
Probabilistic trust has been adopted as an approach to taking security sensitive decisions in modern global computing environments. Existing probabilistic trust frameworks either a...
Ehab ElSalamouny, Vladimiro Sassone, Mogens Nielse...
CC
2007
Springer
139views System Software» more  CC 2007»
15 years 9 months ago
Using Prefetching to Improve Reference-Counting Garbage Collectors
Reference counting is a classical garbage collection method. Recently, a series of papers have extended the basic method to drastically reduce its notorious overhead and extend the...
Harel Paz, Erez Petrank
CC
2007
Springer
208views System Software» more  CC 2007»
15 years 9 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger