Sciweavers

10715 search results - page 376 / 2143
» Proofs from Tests
Sort
View
170
Voted
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
16 years 3 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
156
Voted
CCS
2009
ACM
16 years 1 months ago
HAIL: a high-availability and integrity layer for cloud storage
We introduce HAIL (High-Availability and Integrity Layer), a distributed cryptographic system that allows a set of servers to prove to a client that a stored file is intact and r...
Kevin D. Bowers, Ari Juels, Alina Oprea
CCS
2009
ACM
16 years 1 months ago
Reactive noninterference
Many programs operate reactively, patiently waiting for user input, subsequently running for a while producing output, and eventually returning to a state where they are ready to ...
Aaron Bohannon, Benjamin C. Pierce, Vilhelm Sj&oum...
180
Voted
IEEEARES
2008
IEEE
16 years 1 months ago
Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
Zhiyao Liang, Rakesh M. Verma
IEEESCC
2006
IEEE
16 years 27 days ago
Secure and Provable Service Support for Human-Intensive Real-Estate Processes
This paper introduces SOAR, a service-oriented architecture for the real-estate industry that embeds trust and security, allows for formal correctness proofs of service interactio...
Emerson Ribeiro de Mello, Savas Parastatidis, Phil...