309 search results - page 48 / 62 » Termination proofs for systems code |
ASIAN
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Language-based information flow analysis is used to statically examine a program for information flows between objects of different security domains, and to verify these ...
CC
2008
Springer
13 years 7 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
VVS
2000
IEEE
14 years 1 days ago
2000
IEEE
This paper describes architecture and implementation of the ULTRAVIS system, a pure software solution for versatile and fast volume rendering. It provides perspective raycasting, ...
CADE
2001
Springer
14 years 8 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
IJNSEC
2008
13 years 7 months ago
2008
One approach to protect distributed systems implemented with mobile code is through program obfuscation. Disguising program intent is a form of information hiding that facilitates...