Sciweavers

4126 search results - page 552 / 826
» Set based logic programming
Sort
View
95
Voted
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
16 years 10 days ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz
122
Voted
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
15 years 7 months ago
FSM decomposition by direct circuit manipulation applied to low power design
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...
José C. Monteiro, Arlindo L. Oliveira
DAGSTUHL
2004
15 years 4 months ago
Language Engineering in Practice
ns to define the abstract modelling language that determines the structure of the models that are to be used a two-step meta-modelling approach turned out as most adequate. In the ...
Martin Große-Rhode
INFOCOM
2010
IEEE
15 years 1 months ago
Reliability in Layered Networks with Random Link Failures
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
Kayi Lee, Hyang-Won Lee, Eytan Modiano
151
Voted
CGO
2010
IEEE
15 years 10 months ago
Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code
We present a practical and scalable method for flow- and contextsensitive (FSCS) pointer analysis for C programs. Our method analyzes the pointers in a program level by level in ...
Hongtao Yu, Jingling Xue, Wei Huo, Xiaobing Feng 0...