Sciweavers

10890 search results - page 1861 / 2178
» Automatic Complexity Analysis
Sort
View
COMPSAC
1999
IEEE
15 years 11 months ago
Dynamic Software Architecture Slicing
As the complexity of software systems increases, so need for a good mechanism of abstraction. architecture design is an abstraction, hiding an immense amount of details about the ...
Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T....
CSMR
1999
IEEE
15 years 11 months ago
Employing Use-cases and Domain Knowledge for Comprehending Resource Usage
Philips Electronics is a world wide electronics company that develops many products containing embedded software. These products range from shavers with only few hundred bytes of ...
René L. Krikhaar, Maarten Pennings, J. Zonn...
DAC
1999
ACM
15 years 11 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
DATE
1999
IEEE
135views Hardware» more  DATE 1999»
15 years 11 months ago
Combinational Equivalence Checking Using Satisfiability and Recursive Learning
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
João P. Marques Silva, Thomas Glass
DATE
1999
IEEE
147views Hardware» more  DATE 1999»
15 years 11 months ago
Efficient BIST Hardware Insertion with Low Test Application Time for Synthesized Data Paths
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
Nicola Nicolici, Bashir M. Al-Hashimi
« Prev « First page 1861 / 2178 Last » Next »