Pages that link to "Item:Q3611996"
From MaRDI portal
The following pages link to Formalised Inductive Reasoning in the Logic of Bunched Implications (Q3611996):
Displaying 17 items.
- The linked inference principle. I: The formal treatment (Q1189727) (← links)
- Logical foundation of the quintuple implication inference methods (Q1726231) (← links)
- Unifying separation logic and region logic to allow interoperability (Q1798668) (← links)
- Contributed papers. Restriction on cut in cyclic proof system for symbolic heaps (Q2039937) (← links)
- Non-well-founded deduction for induction and coinduction (Q2055840) (← links)
- Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
- Focused proof-search in the logic of bunched implications (Q2233409) (← links)
- Automated mutual induction proof in separation logic (Q2414251) (← links)
- Completeness and expressiveness of pointer program verification by separation logic (Q2417849) (← links)
- Disproving Inductive Entailments in Separation Logic via Base Pair Approximation (Q3455777) (← links)
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (Q5079741) (← links)
- Automated Cyclic Entailment Proofs in Separation Logic (Q5200020) (← links)
- A Complete Cyclic Proof System for Inductive Entailments in First Order Logic (Q5222971) (← links)
- A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions (Q5875940) (← links)
- Automatically verifying temporal properties of pointer programs with cyclic proof (Q5919481) (← 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)
