Pages that link to "Item:Q3457790"
From MaRDI portal
The following pages link to Deciding Entailments in Inductive Separation Logic with Tree Automata (Q3457790):
Displaying 25 items.
- Slide (Q40256) (← links)
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- Compositional entailment checking for a fragment of separation logic (Q1688543) (← links)
- Contributed papers. Restriction on cut in cyclic proof system for symbolic heaps (Q2039937) (← links)
- Unifying decidable entailments in separation logic with inductive definitions (Q2055854) (← links)
- Strong-separation logic (Q2233486) (← links)
- Compositional satisfiability solving in separation logic (Q2234106) (← links)
- Inductive theorem proving based on tree grammars (Q2344621) (← links)
- Automated mutual induction proof in separation logic (Q2414251) (← links)
- A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints (Q2817951) (← links)
- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic (Q2988661) (← links)
- Decision Procedure for Separation Logic with Inductive Definitions and Presburger Arithmetic (Q3179308) (← links)
- Deciding validity in a spatial logic for trees (Q3367666) (← links)
- Graph decompositions and tree automata in reasoning with uncertainty (Q4286533) (← links)
- (Q4989410) (← links)
- Decision Procedure for Entailment of Symbolic Heaps with Arrays (Q5055997) (← links)
- (Q5111651) (← links)
- A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions (Q5875940) (← links)
- Program Verification with Separation Logic (Q5883571) (← links)
- A proof procedure for separation logic with inductive definitions and data (Q6053843) (← links)
- An undecidability result for separation logic with theory reasoning (Q6161426) (← links)
- Foundations for entailment checking in quantitative separation logic (Q6166785) (← links)
- Make flows small again: revisiting the flow framework (Q6535380) (← links)
- Completeness of cyclic proofs for symbolic heaps with inductive definitions (Q6536318) (← links)
- Restriction on cut rule in cyclic-proof system for symbolic heaps (Q6633582) (← links)