The following pages link to Predator (Q19428):
Displaying 15 items.
- LCTD: test-guided proofs for C programs on LLVM (Q338629) (← links)
- An extension of lazy abstraction with interpolation for programs with arrays (Q479820) (← links)
- Leveraging compiler intermediate representation for multi- and cross-language verification (Q784116) (← links)
- System-level state equality detection for the formal dynamic verification of legacy distributed applications (Q2413022) (← links)
- Forest automata for verification of heap manipulation (Q2441715) (← links)
- Model checking for symbolic-heap separation logic with inductive predicates (Q2828247) (← links)
- Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic (Q2961583) (← links)
- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic (Q2988661) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- Deciding Entailments in Inductive Separation Logic with Tree Automata (Q3457790) (← links)
- Shape Neutral Analysis of Graph-based Data-structures (Q4559807) (← links)
- The Tree Width of Separation Logic with Recursive Definitions (Q4928426) (← links)
- (Q4989410) (← links)
- Learning Shape Analysis (Q5233237) (← links)
- Semantic-directed clumping of disjunctive abstract states (Q5370844) (← links)
