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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
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.
-
Infinite State Model Checking by Learning Transitive Relations
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.