Predator
From MaRDI portal
Software:19428
swMATH7396MaRDI QIDQ19428FDOQ19428
Author name not available (Why is that?)
Cited In (15)
- Combining Model Checking and Data-Flow Analysis
- Model checking for symbolic-heap separation logic with inductive predicates
- Title not available (Why is that?)
- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic
- Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic
- Deciding Entailments in Inductive Separation Logic with Tree Automata
- An extension of lazy abstraction with interpolation for programs with arrays
- Semantic-directed clumping of disjunctive abstract states
- The Tree Width of Separation Logic with Recursive Definitions
- LCTD: test-guided proofs for C programs on LLVM
- Learning Shape Analysis
- Shape Neutral Analysis of Graph-based Data-structures
- Leveraging compiler intermediate representation for multi- and cross-language verification
- Forest automata for verification of heap manipulation
- System-level state equality detection for the formal dynamic verification of legacy distributed applications
This page was built for software: Predator
