Sciweavers

14158 search results - page 2408 / 2832
» Generalized switch-setting problems
Sort
View
EUROCRYPT
2004
Springer
16 years 25 days ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
ICTAC
2004
Springer
16 years 24 days ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
KR
2004
Springer
16 years 24 days ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
OOPSLA
2004
Springer
16 years 24 days ago
Transparent proxies for java futures
A proxy object is a surrogate or placeholder that controls access to another target object. Proxies can be used to support distributed programming, lazy or parallel evaluation, ac...
Polyvios Pratikakis, Jaime Spacco, Michael W. Hick...
SIGADA
2004
Springer
16 years 24 days ago
Enforcing security and safety models with an information flow analysis tool
Existing security models require that information of a given security level be prevented from “leaking” into lower-security information. High-security applications must be dem...
Roderick Chapman, Adrian Hilton
« Prev « First page 2408 / 2832 Last » Next »