Sciweavers

4401 search results - page 594 / 881
» Computing with Default Logic
Sort
View
DAC
2008
ACM
16 years 7 months ago
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung
SIGSOFT
2007
ACM
16 years 7 months ago
Quantitative verification: models techniques and tools
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
Marta Z. Kwiatkowska
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 7 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
RECONFIG
2009
IEEE
172views VLSI» more  RECONFIG 2009»
16 years 1 months ago
Combined SCA and DFA Countermeasures Integrable in a FPGA Design Flow
Abstract—The main challenge when implementing cryptographic algorithms in hardware is to protect them against attacks that target directly the device. Two strategies are customar...
Shivam Bhasin, Jean-Luc Danger, Florent Flament, T...
ADC
2009
Springer
122views Database» more  ADC 2009»
16 years 1 months ago
What is Required in Business Collaboration?
Access control has been studied for sometime, and there are a number of theories and techniques for handling access control for single or centralised systems; however, unique and ...
Daisy Daiqin He, Michael Compton, Kerry Taylor, Ji...