activity
20112026
most citedThe failure of cut-elimination in cyclic proof for first-order logic with inductive definitions

3 citations · 4 across the 8 of their papers we have counts for

collaborators
Showing 2025 · cs.LOShow all

1 paper · 2 filters

cs.LO2025

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…