—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...
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
Computing equivalence classes for FSMs has several applications to synthesis and verication problems. Symbolic traversal techniques are applicable to medium-small circuits. This ...
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...