767 search results - page 148 / 154 » Logic for Mathematical Writing |
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
WOLLIC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Proofs in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We shall follow the same idea by proposing that sentenc...
CCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
HOST
2008
IEEE
14 years 1 months ago
2008
IEEE
—Straightforward implementations of cryptographic algorithms are known to be vulnerable to attacks aimed not at the mathematical structure of the cipher but rather at the weak po...