Precise Widening Operators for Proving Termination by Abstract Interpretation
No abstract available.
Related papers
- Efficient Abstract Interpretation via Selective Widening OOPSLA 2025
- More Precise Yet Efficient Type Inference for Logic Programs SAS 2002
- Taming and Dissecting Recursions Through Interprocedural Weak Topological Ordering ECOOP 2025
- Trace-based control-flow analysis PLDI 2021
- Demanded abstract interpretation PLDI 2021
- Succinct Representations for Abstract Interpretation - Combined Analysis Algorithms and Experimental Evaluation SAS 2012
- Accelerated Data-Flow Analysis SAS 2007
- Abstract Interpretation with Infinitesimals - Towards Scalability in Nonstandard Static Analysis VMCAI 2016