426 search results - page 61 / 86 » Specification, Abduction, and Proof |
115
click to vote
TCC
2009
Springer
16 years 2 months ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
120
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
111
click to vote
FOSSACS
2008
Springer
15 years 3 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
122
click to vote
ENTCS
2006
15 years 2 months ago
2006
Latency insensitive protocols (LIPs) have been proposed as a viable means to connect synchronous IP blocks via long interconnects in a system-on-chip. The reason why one needs to ...
126
click to vote
SIGSOFT
2006
ACM
16 years 2 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...