Completeness of cyclic proofs for symbolic heaps with inductive definitions
From MaRDI portal
Publication:6536318
DOI10.1007/978-3-030-34175-6_19zbMath1542.68038MaRDI QIDQ6536318
Daisuke Kimura, Koji Nakazawa, Makoto Tatsuta
Publication date: 19 April 2024
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
This page was built for publication: Completeness of cyclic proofs for symbolic heaps with inductive definitions
