Sciweavers

251 search results - page 21 / 51
» Lattice-Valued Binary Decision Diagrams
Sort
View
ISCAS
2002
IEEE
125views Hardware» more  ISCAS 2002»
14 years 10 days ago
Switching activity estimation of finite state machines for low power synthesis
A technique for computing the switching activity of synchronous Finite State Machine (FSM) implementations including the influence of temporal correlation among the next state si...
Mikael Kerttu, Per Lindgren, Mitchell A. Thornton,...
QEST
2010
IEEE
13 years 5 months ago
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
Ralf Wimmer, Bettina Braitling, Bernd Becker, Erns...
DAC
2003
ACM
14 years 8 months ago
Symbolic representation with ordered function templates
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
Amit Goel, Gagan Hasteer, Randal E. Bryant
DAC
2005
ACM
14 years 8 months ago
Towards scalable flow and context sensitive pointer analysis
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
Jianwen Zhu
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 2 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur