Sciweavers

309 search results - page 57 / 62
» Termination proofs for systems code
Sort
View
TOCS
2002
70views more  TOCS 2002»
13 years 7 months ago
Secure program partitioning
This paper presents secure program partitioning, a language-based technique for protecting confidential data during computation in distributed systems containing mutually untruste...
Steve Zdancewic, Lantian Zheng, Nathaniel Nystrom,...
EUROCRYPT
2010
Springer
14 years 13 days ago
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck W...
TABLEAUX
2000
Springer
13 years 11 months ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks
POPL
2009
ACM
14 years 8 months ago
Automated verification of practical garbage collectors
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
Chris Hawblitzel, Erez Petrank
ICSE
2004
IEEE-ACM
14 years 7 months ago
Verifying DAML+OIL and Beyond in Z/EVES
Semantic Web, the next generation of Web, gives data well-defined and machine-understandable meaning so that they can be processed by remote intelligent agents cooperatively. Onto...
Jin Song Dong, Chew Hung Lee, Yuan-Fang Li, Hai H....