TVLA

swMATH9878MaRDI QIDQ21857

No author found.

Related Items (31)

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

This page was built for software: TVLA