13383 search results - page 291 / 2677 » Abstractions from proofs |
293
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
166
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
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...
152
click to vote
CCS
2009
ACM
16 years 1 months ago
2009
ACM
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...
160
click to vote
CCS
2009
ACM
16 years 1 months ago
2009
ACM
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 ...
173
click to vote
IEEEARES
2008
IEEE
16 years 1 months ago
2008
IEEE
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...