Sciweavers

1410 search results - page 172 / 282
» Proving theorems by reuse
Sort
View
LICS
2000
IEEE
15 years 10 months ago
Complete Axioms for Categorical Fixed-Point Operators
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We p...
Alex K. Simpson, Gordon D. Plotkin
CRYPTO
2000
Springer
145views Cryptology» more  CRYPTO 2000»
15 years 10 months ago
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
Palash Sarkar, Subhamoy Maitra
CAISE
1999
Springer
15 years 10 months ago
Modeling Dynamic Domains with ConGolog
In this paper, we describe the process specification language ConGolog and show how it can be used to model business processes for requirements analysis. In ConGolog, the effects...
Yves Lespérance, Todd G. Kelley, John Mylop...
TPHOL
1999
IEEE
15 years 10 months ago
Inductive Datatypes in HOL - Lessons Learned in Formal-Logic Engineering
Abstract. Isabelle/HOL has recently acquired new versions of definitional packages for inductive datatypes and primitive recursive functions. In contrast to its predecessors and mo...
Stefan Berghofer, Markus Wenzel
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
15 years 10 months ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux