Sciweavers

1036 search results - page 75 / 208
» Design methods as discourse on practice
Sort
View
DAC
2010
ACM
14 years 1 months ago
An efficient algorithm to verify generalized false paths
Timing exception verification has become a center of interest as incorrect constraints can lead to chip failures. Proving that a false path is valid or not is a difficult problem ...
Olivier Coudert
CSMR
2005
IEEE
14 years 2 months ago
Discovering Unanticipated Dependency Schemas in Class Hierarchies
Object-oriented applications are difficult to extend and maintain, due to the presence of implicit dependencies in the inheritance hierarchy. Although these dependencies often co...
Gabriela Arévalo, Stéphane Ducasse, ...
DAC
1994
ACM
14 years 1 months ago
A Modular Partitioning Approach for Asynchronous Circuit Synthesis
Asynchronous circuits are crucial in designing low power and high performance digital systems. In this paper, we present an ecient modular partitioning approach for asynchronous c...
Ruchir Puri, Jun Gu
DAC
2005
ACM
14 years 10 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
FQAS
2004
Springer
122views Database» more  FQAS 2004»
14 years 24 days ago
Simplification of Integrity Constraints with Aggregates and Arithmetic Built-Ins
In the context of relational as well as deductive databases, correct and efficient integrity checking is a crucial issue, as, without any guarantee of data consistency, the answers...
Davide Martinenghi