Sciweavers

4352 search results - page 19 / 871
» A Representation Theorem and Applications
Sort
View
DLT
2009
13 years 8 months ago
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
Aleksi Saarela
DSD
2002
IEEE
102views Hardware» more  DSD 2002»
14 years 3 months ago
Formal Verification of a DSP Chip Using an Iterative Approach
In this paper we describe a methodology for the formal verification of a DSP chip using the HOL theorem prover. We used an iterative method to specify both the behavioral and stru...
Ali Habibi, Sofiène Tahar, Adel Ghazel
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
14 years 3 months ago
Adaptive Security of Symbolic Encryption
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
Daniele Micciancio, Saurabh Panjwani
ISTA
2004
13 years 11 months ago
Evidential Paradigm and Intelligent Mathematical Text Processing
Abstract: This paper presents the evidential paradigm of computer-supported mathematical assistance in "doing" mathematics and in reasoning activity. At present, the evid...
Alexander V. Lyaletski, Anatoly E. Doroshenko, And...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 10 months ago
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Bernard Boigelot, Julien Brusten, Véronique...