2687 search results - page 327 / 538 » Formal Analysis of PKCS |
181
click to vote
LICS
2003
IEEE
15 years 12 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
194
click to vote
AC
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Over the last decade there has been a shift from "data-aware" information systems to "process-aware" information systems. To support business processe...
192
click to vote
IJCAI
2003
15 years 8 months ago
2003
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
167
click to vote
AIEDU
2006
15 years 6 months ago
2006
In this article, we discuss the motivation for a novel style of tutorial dialogue system that emphasizes reflection in a simulation based exploratory learning environment called Cy...
196
click to vote
SP
2008
IEEE
15 years 5 months ago
2008
IEEE
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...