181 search results - page 32 / 37 » Programming Language Techniques for Cryptographic Proofs |
184
Voted
POPL
2008
ACM
15 years 10 months ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
ESOP
2001
Springer
15 years 2 months ago
2001
Springer
We check statically whether it is safe for untrusted foreign machine code to be loaded into a trusted host system. (Here “safety” means that the program abides by a memory-acc...
165
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The Windows Vista operating system implements an interesting model of multi-level integrity. We observe that in this model, trusted code must participate in any information-flow a...
72
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...