TVLA

swMATH9878MaRDI QIDQ21857FDOQ21857

Author name not available (Why is that?)

Cited In (31)

• Loop summarization using state and transition invariants
• Heap Decomposition for Concurrent Shape Analysis
• Scalable Shape Analysis for Systems Code
• Verifying Heap-Manipulating Programs in an SMT Framework
• Verify heaps via unified model checking
• Title not available (Why is that?)
• Title not available (Why is that?)
• Local higher-order fixpoint iteration
• Automatic Inference of Access Permissions
• Programming Languages and Systems
• On the almighty wand
• A generic framework for heap and value analyses of object-oriented programming languages
• Reasoning about sequences of memory states
• A Shape Analysis for Non-linear Data Structures
• Semantic-directed clumping of disjunctive abstract states
• Thread Quantification for Concurrent Shape Analysis
• A Reachability Predicate for Analyzing Low-Level Software
• A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
• Title not available (Why is that?)
• Bounded Quantifier Instantiation for Checking Inductive Invariants
• Title not available (Why is that?)
• Shape Analysis for Composite Data Structures
• Title not available (Why is that?)
• Beyond Shapes: Lists with Ordered Data
• A logic of reachable patterns in linked data-structures
• Computer Aided Verification
• Finding Concurrency-Related Bugs Using Random Isolation
• Translating Java for multiple model checkers: The Bandera back-end
• Static Analysis
• Back to the future
• Specialized 3-Valued Logic Shape Analysis Using Structure-Based Refinement and Loose Embedding

This page was built for software: TVLA