A new acceleration method for array-manipulating loops uses inductive lvalues and lambdas to unify treatment with scalars and enable lemma-on-demand SMT solving.
FAST: acceleration from theory to practice
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
Presents an SMT encoding to automatically prove polyhedral abstractions for Petri nets, complete for flat nets via Presburger reachability.
citing papers explorer
-
Accelerating Loops with Arrays
A new acceleration method for array-manipulating loops uses inductive lvalues and lambdas to unify treatment with scalars and enable lemma-on-demand SMT solving.
-
On the Complexity of Proving Polyhedral Reductions
Presents an SMT encoding to automatically prove polyhedral abstractions for Petri nets, complete for flat nets via Presburger reachability.