6978 search results - page 208 / 1396 » On Proofs in System P |
195
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
196
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Despite recent excitement generated by the peer-to-peer (P2P) paradigm and the surprisingly rapid deployment of some P2P applications, there are few quantitative evaluations of P2...
191
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
160
click to vote
FOSSACS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...