Contributed papers. Restriction on cut in cyclic proof system for symbolic heaps

DOI10.1007/978-3-030-59025-3_6OpenAlexW3085766635MaRDI QIDQ2039937

Koji Nakazawa, Kenji Saotome, Daisuke Kimura

Publication date: 6 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-59025-3_6

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic programming (68N17)

Cites Work

• TACO: a toolkit for AMPL control optimization
• Sequent calculi for induction and infinite descent
• Deciding Entailments in Inductive Separation Logic with Tree Automata
• Formalised Inductive Reasoning in the Logic of Bunched Implications
• The Tree Width of Separation Logic with Recursive Definitions
• Automated Cyclic Entailment Proofs in Separation Logic
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Programming Languages and Systems
• Effective entailment checking for separation logic with inductive definitions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Contributed papers. Restriction on cut in cyclic proof system for symbolic heaps