Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data
- 1 January 2012
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Compositional shape analysis by means of bi-abductionACM SIGPLAN Notices, 2009
- A combination framework for tracking partition sizesACM SIGPLAN Notices, 2009
- Discovering properties about arrays in simple programsACM SIGPLAN Notices, 2008
- Z3: An Efficient SMT SolverLecture Notes in Computer Science, 2008
- Array Abstractions from ProofsPublished by Springer Science and Business Media LLC ,2007
- Invariant Synthesis for Combined TheoriesLecture Notes in Computer Science, 2007
- The octagon abstract domainHigher-Order and Symbolic Computation, 2006
- Interprocedural Shape Analysis for Cutpoint-Free ProgramsLecture Notes in Computer Science, 2005
- Boolean HeapsLecture Notes in Computer Science, 2005
- Parametric shape analysis via 3-valued logicACM Transactions on Programming Languages and Systems, 2002