Sciweavers

788 search results - page 18 / 158
» Symbolic Equivalence Checking
Sort
View
ET
2010
83views more  ET 2010»
13 years 7 months ago
Experience with Widening Based Equivalence Checking in Realistic Multimedia Systems
—Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. For the class of static affine program...
Sven Verdoolaege, Martin Palkovic, Maurice Bruynoo...
ATS
2010
IEEE
239views Hardware» more  ATS 2010»
13 years 6 months ago
Mining Complex Boolean Expressions for Sequential Equivalence Checking
Neha Goel, Michael S. Hsiao, Naren Ramakrishnan, M...
APLAS
2005
ACM
14 years 2 months ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
EURODAC
1995
IEEE
136views VHDL» more  EURODAC 1995»
14 years 10 days ago
Computing subsets of equivalence classes for large FSMs
Computing equivalence classes for FSMs has several applications to synthesis and veri cation problems. Symbolic traversal techniques are applicable to medium-small circuits. This ...
Gianpiero Cabodi, Stefano Quer, Paolo Camurati
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
14 years 5 months 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