Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
No abstract available.
DOI 10.1007/978-3-642-02658-4_44
Related papers
- Equivalence checking of static affine programs using widening to handle recurrences TOPLAS 2012
- Compositional recurrence analysis revisited PLDI 2017
- A Pure Demand Operational Semantics with Applications to Program Analysis OOPSLA 2024
- Using Bounded Model Checking to Focus Fixpoint Iterations SAS 2011
- Efficient Synthesis of Tight Polynomial Upper-Bounds for Systems of Conditional Polynomial Recurrences ESOP 2025
- Finding Recurrent Sets with Backward Analysis and Trace Partitioning TACAS 2016
- PolyCheck: dynamic verification of iteration space transformations on affine programs POPL 2016
- Kindly bent to free us ICFP 2020