Sciweavers

27 search results - page 3 / 6
» Type-Constrained Generics for Z
Sort
View
TPHOL
2006
IEEE
14 years 1 months ago
Minlog
We extract on the computer a number of moduli of uniform continuity for the first few elements of a sequence of closed terms t of G¨odel’s T of type (N→N)→(N→N). The gen...
Helmut Schwichtenberg
SAT
2005
Springer
134views Hardware» more  SAT 2005»
14 years 28 days ago
A Clause-Based Heuristic for SAT Solvers
We propose a new decision heuristic for DPLL-based propositional SAT solvers. Its essence is that both the initial and the conflict clauses are arranged in a list and the next deci...
Nachum Dershowitz, Ziyad Hanna, Alexander Nadel
FASE
2003
Springer
14 years 20 days ago
Integration of Formal Datatypes within State Diagrams
In this paper, we present a generic approach to integrate datatypes expressed using formal specification languages within state diagrams. Our main motivations are (i) to be able t...
Christian Attiogbé, Pascal Poizat, Gwen Sal...
CPP
2011
98views more  CPP 2011»
12 years 7 months ago
Automatically Verifying Typing Constraints for a Data Processing Language
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
Michael Backes, Catalin Hritcu, Thorsten Tarrach
SCN
2008
Springer
13 years 7 months ago
Two Generic Constructions of Probabilistic Cryptosystems and Their Applications
In this paper, we build, in a generic way, two asymmetric cryptosystems with a careful study of their security. We present first an additively homomorphic scheme which generalizes,...
Guilhem Castagnos