Sciweavers

1664 search results - page 61 / 333
» Towards Partial Reasoning
Sort
View
JOC
2002
99views more  JOC 2002»
13 years 8 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski
IPL
2010
94views more  IPL 2010»
13 years 7 months ago
Partial model checking via abstract interpretation
model checking via abstract interpretation N. De Francesco, G. Lettieri∗ , L. Martini, G. Vaglini Universit`a di Pisa, Dipartimento di Ingegneria dell’Informazione, sez. Inform...
Nicoletta De Francesco, Giuseppe Lettieri, Luca Ma...
DAGSTUHL
1996
13 years 9 months ago
A Uniform Approach for Compile-Time and Run-Time Specialization
As partial evaluation gets more mature, it is now possible to use this program transformation technique to tackle realistic languages and real-size application programs. However, t...
Charles Consel, Luke Hornof, François No&eu...
CADE
2008
Springer
14 years 8 months ago
Towards Fully Automated Axiom Extraction for Finite-Valued Logics
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
Dalmo Mendonca, João Marcos
ISPD
2009
ACM
108views Hardware» more  ISPD 2009»
14 years 3 months ago
Constraint-driven design: the next step towards analog design automation
The design of analog circuits has historically been a time consuming, manual task. The stringent constraints that must be considered simultaneously make the task particularly diff...
Göran Jerke, Jens Lienig