Symbolically Computing Most-Precise Abstract Operations for Shape Analysis
Abstract elided by the publisher.
Related papers
- Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration ESOP 2025
- Abstraction for Shape Analysis with Fast and Precise Transformers CAV 2006
- Shape Analysis for Mobile Ambients POPL 2000
- Relational inductive shape analysis POPL 2008
- Shape analysis with inductive recursion synthesis PLDI 2007
- Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss TOPLAS 2014
- Program analysis via efficient symbolic abstraction OOPSLA 2021
- Fragment Abstraction for Concurrent Shape Analysis ESOP 2018