Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 172-193
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Learning Universally Quantified Invariants of Linear Data Structures2013
- Lazy Abstraction with Interpolants for Arrays2012
- On inter-procedural analysis of programs with lists and dataACM SIGPLAN Notices, 2011
- Streaming transducers for algorithmic verification of single-pass list-processing programsACM SIGPLAN Notices, 2011
- A parametric segmentation functor for fully automatic and scalable array content analysisACM SIGPLAN Notices, 2011
- SLAyer: Memory Safety for Systems-Level Code2011
- Relational inductive shape analysisACM SIGPLAN Notices, 2008
- Shape Analysis for Composite Data Structures2007
- A Local Shape Analysis Based on Separation Logic2006
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints1977