Sciweavers

3333 search results - page 283 / 667
» Abstract Proof Search
Sort
View
146
Voted
DAC
1999
ACM
16 years 7 months ago
LISA - Machine Description Language for Cycle-Accurate Models of Programmable DSP Architectures
Abstract { This paper presents the machine description language LISA for the generation of bitand cycle accurate models of DSP processors. Based on a behavioral operation descripti...
Stefan Pees, Andreas Hoffmann, Vojin Zivojnovic, H...
RECOMB
2006
Springer
16 years 7 months ago
Sorting by Translocations Via Reversals Theory
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
Michal Ozery-Flato, Ron Shamir
ICFP
2003
ACM
16 years 6 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish
SOFSEM
2010
Springer
16 years 3 months ago
Finding and Certifying Loops
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
Harald Zankl, Christian Sternagel, Dieter Hofbauer...
TCC
2010
Springer
170views Cryptology» more  TCC 2010»
16 years 3 months ago
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
Vadim Lyubashevsky, Adriana Palacio, Gil Segev