2687 search results - page 425 / 538 » Formal Analysis of PKCS |
185
click to vote
JFP
2007
15 years 6 months ago
2007
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
193
click to vote
SAC
2002
ACM
15 years 5 months ago
2002
ACM
Designing realistic multi-agent systems is a complex process, which involves specifying not only the functionality of individual agents, but also the authority relationships and l...
149
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
This paper describes in details the first version of Morphonette, a new French morphological resource and a new radically lexeme-based method of morphological analysis. This resea...
190
click to vote
LATINCRYPT
2010
15 years 4 months ago
2010
the full version of the extended abstract which appears in Latincrypt '10 (august 8-11, 2010, Puebla, Mexico) M. Abdalla and P. Barreto Eds., Springer-Verlag, LNCS 6212, pages...
174
click to vote
SAS
2010
Springer
15 years 4 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...