TVLA
From MaRDI portal
Cited in
(40)- SyncGen
- Verify heaps via unified model checking
- SPEED
- Consit
- Local higher-order fixpoint iteration
- GENA
- FixBag
- Loop summarization using state and transition invariants
- CSSV
- A logic of reachable patterns in linked data-structures
- Interprocedural shape analysis for recursive programs
- A generic framework for heap and value analyses of object-oriented programming languages
- VeriCon
- Automatic inference of access permissions
- Back to the future, revisiting precise program verification using SMT solvers
- Bounded quantifier instantiation for checking inductive invariants
- MemCAD
- Verifying Heap-Manipulating Programs in an SMT Framework
- Scalable Shape Analysis for Systems Code
- Thread Quantification for Concurrent Shape Analysis
- Heap Decomposition for Concurrent Shape Analysis
- Finding Concurrency-Related Bugs Using Random Isolation
- Specialized 3-Valued Logic Shape Analysis Using Structure-Based Refinement and Loose Embedding
- Beyond Shapes: Lists with Ordered Data
- Cibai
- On the almighty wand
- Shape analysis through predicate abstraction and model checking
- Finite differencing of logical formulas for static analysis
- A modular, extensible proof method for small-step flow analyses
- A Shape Analysis for Non-linear Data Structures
- scientific article; zbMATH DE number 7455743 (Why is no real title available?)
- Semantic-directed clumping of disjunctive abstract states
- Shape Analysis for Composite Data Structures
- Programming Languages and Systems
- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
- Abstraction refinement via inductive learning
- A Reachability Predicate for Analyzing Low-Level Software
- Static Analysis
- Reasoning about sequences of memory states
- Translating Java for multiple model checkers: The Bandera back-end
This page was built for software: TVLA