An Abstract Domain for Analyzing Heap-Manipulating Low-Level Software
Abstract elided by the publisher.
Related papers
- Arithmetizing Shape Analysis CAV 2025
- Abstraction of memory block manipulations by symbolic loop folding ESOP 2025
- A static analyzer for large safety-critical software PLDI 2003
- A Reachability Predicate for Analyzing Low-Level Software TACAS 2007
- Bennet: Randomized Specification Testing for Heap-Manipulating Programs OOPSLA 2025
- A combination framework for tracking partition sizes POPL 2009
- Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists SAS 2013
- Precise reasoning with structured time, structured heaps, and collective operations OOPSLA 2019