788 search results - page 18 / 158 » Symbolic Equivalence Checking |
120
Voted
ET
2010
15 years 12 days ago
2010
—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...
129
Voted
ATS
2010
IEEE
14 years 12 months ago
2010
IEEE
104
click to vote
APLAS
2005
ACM
15 years 7 months ago
2005
ACM
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...
103
click to vote
EURODAC
1995
IEEE
15 years 5 months ago
1995
IEEE
Computing equivalence classes for FSMs has several applications to synthesis and veri cation problems. Symbolic traversal techniques are applicable to medium-small circuits. This ...
ICCAD
2005
IEEE
15 years 10 months ago
2005
IEEE
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...