Sciweavers

222 search results - page 28 / 45
» Efficient assertion based verification using TLM
Sort
View
ACNS
2009
Springer
121views Cryptology» more  ACNS 2009»
15 years 3 months ago
Efficient Deniable Authentication for Signatures
Releasing a classical digital signature faces to privacy issues. Indeed, there are cases where the prover needs to authenticate some data without making it possible for any malicio...
Jean Monnerat, Sylvain Pasini, Serge Vaudenay
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
14 years 9 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
CORR
2010
Springer
85views Education» more  CORR 2010»
14 years 12 months ago
A Single-Instance Incremental SAT Formulation of Proof- and Counterexample-Based Abstraction
nd Counterexample-Based Abstraction Niklas Een, Alan Mishchenko EECS Department, University of California Berkeley, USA. Nina Amla Cadence Research Laboratroy Berkeley, USA. This p...
Niklas Eén, Alan Mishchenko, Nina Amla
81
Voted
ICCAD
2006
IEEE
146views Hardware» more  ICCAD 2006»
15 years 6 months ago
Cost-aware synthesis of asynchronous circuits based on partial acknowledgement
Designing asynchronous circuits by reusing existing synchronous tools has become a promising solution to the problem of poor CAD support in asynchronous world. A straightforward w...
Yu Zhou, Danil Sokolov, Alexandre Yakovlev
KR
2000
Springer
15 years 3 months ago
Reasoning with Axioms: Theory and Practice
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
Ian Horrocks, Stephan Tobies