Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data
No abstract available.
Related papers
- Fragment Abstraction for Concurrent Shape Analysis ESOP 2018
- Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists SAS 2013
- Mechanised Hypersafety Proofs about Structured Data PLDI 2024
- On inter-procedural analysis of programs with lists and data PLDI 2011
- Well-founded recursion with copatterns and sized types JFP 2016
- Arithmetizing Shape Analysis CAV 2025
- Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs ESOP 2015
- Structural recursion for querying ordered graphs ICFP 2013