Predator

swMATH7396MaRDI QIDQ19428FDOQ19428

Author name not available (Why is that?)

Cited In (15)

• Model checking for symbolic-heap separation logic with inductive predicates
• Title not available (Why is that?)
• Shape neutral analysis of graph-based data-structures
• Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic
• An extension of lazy abstraction with interpolation for programs with arrays
• Semantic-directed clumping of disjunctive abstract states
• LCTD: test-guided proofs for C programs on LLVM
• The tree width of separation logic with recursive definitions
• Leveraging compiler intermediate representation for multi- and cross-language verification
• Combining model checking and data-flow analysis
• Forest automata for verification of heap manipulation
• System-level state equality detection for the formal dynamic verification of legacy distributed applications
• Learning shape analysis
• Deciding entailments in inductive separation logic with tree automata
• Unified reasoning about robustness properties of symbolic-heap separation logic

This page was built for software: Predator