Sciweavers

1226 search results - page 127 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
DSD
2002
IEEE
102views Hardware» more  DSD 2002»
15 years 8 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
RSP
1999
IEEE
15 years 7 months ago
System Design Validation Using Formal Models
Formal methods are a nice idea, but the size and complexity of real systems means that they are impractical. We propose that a reasonable alternative to attempting to specify and ...
Peter Henderson, Robert John Walters
CRYPTO
1989
Springer
163views Cryptology» more  CRYPTO 1989»
15 years 7 months ago
Undeniable Signatures
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
David Chaum, Hans Van Antwerpen
ASM
2008
ASM
15 years 5 months ago
A Concept-Driven Construction of the Mondex Protocol Using Three Refinements
Abstract. The Mondex case study concerns the formal development and verification of an electronic purse protocol. Several groups have worked on its specification and mechanical ver...
Gerhard Schellhorn, Richard Banach
CORR
2007
Springer
75views Education» more  CORR 2007»
15 years 3 months ago
On Undetected Error Probability of Binary Matrix Ensembles
Abstract— In this paper, analysis on undetected error probability of ensembles of m × n binary matricies is presented. Two ensembles are considered: One is an ensemble of dense ...
Tadashi Wadayama