Pages that link to "Item:Q3189830"

The following pages link to Cyclic proofs of program termination in separation logic (Q3189830):

Displaying 15 items.

• Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper) (Q832157) (← links)
• Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs (Q1798782) (← links)
• Non-well-founded deduction for induction and coinduction (Q2055840) (← links)
• Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
• Soundness and completeness proofs by coinductive methods (Q2362498) (← links)
• Completeness and expressiveness of pointer program verification by separation logic (Q2417849) (← links)
• Inference of Field-Sensitive Reachability and Cyclicity (Q2946745) (← links)
• Cyclic Arithmetic Is Equivalent to Peano Arithmetic (Q2988374) (← links)
• Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System (Q2988375) (← links)
• (Q5020657) (← links)
• Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (Q5079741) (← links)
• Automated Cyclic Entailment Proofs in Separation Logic (Q5200020) (← links)
• (Q5208872) (← links)
• (Q5227521) (← links)
• Automatically verifying temporal properties of pointer programs with cyclic proof (Q5919481) (← links)