14 citations · 37 across the 13 of their papers we have counts for
13 papers
Truth Predicate of Inductive Definitions and Logical Complexity of Infinite-Descent Proofs
Sohei Ito, Makoto Tatsuta
Formal reasoning about inductively defined relations and structures is widely recognized not only for its mathematical interest but also for its importance in computer science, and…
A Core Calculus for Type-safe Product Lines of C Programs
Ferruccio Damiani, Daisuke Kimura, Luca Paolini +1
In this paper we: (1) propose Lightweight C (LC), namely a core calculus that formalizes a proper subset of the ANSI C without preprocessor directives; (2) define Colored LC (CLC),…
Encoding Peano Arithmetic in a Minimal Fragment of Separation Logic
Sohei Ito, Makoto Tatsuta
Separation logic is successful for software verification of heap-manipulating programs. Numbers are necessary to be added to separation logic for verification of practical software…
Cut elimination for propositional cyclic proof systems with fixed-point operators
Hiromasa Hori, Koji Nakazawa, Makoto Tatsuta
Infinitary and cyclic proof systems are proof systems for logical formulas with fixed-point operators or inductive definitions. A cyclic proof system is a restriction of the corres…
The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
Yukihiro Oda, James Brotherston, Makoto Tatsuta
A cyclic proof system is a proof system whose proof figure is a tree with cycles. The cut-elimination in a proof system is fundamental. It is conjectured that the cut-elimination i…
Completeness of Cyclic Proofs for Symbolic Heaps
Makoto Tatsuta, Koji Nakazawa, Daisuke Kimura
Separation logic is successful for software verification in both theory and practice. Decision procedure for symbolic heaps is one of the key issues. This paper proposes a cyclic p…