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

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

collaborators

5 papers

cs.CR2026

Type-based information flow analysis for -calculus with a dynamically extensible security lattice

Yukihiro Oda, Eijiro Sumii

We develop a type system for secure information flow where new security levels can be created and inserted into the security lattice dynamically, i.e., even in the middle of an exe…

cs.LO2025

A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics

Yukihiro Oda

Dynamic logic is a modal logic for reasoning about programs. A cyclic proof system is a proof system that allows proofs containing cycles and is an alternative to a proof system co…

cs.LO2025

Cyclic Proofs in Hoare Logic and its Reverse

James Brotherston, Quang Loc Le, Gauri Desai +1

We examine the relationships between axiomatic and cyclic proof systems for the partial and total versions of Hoare logic and those of its dual, known as reverse Hoare logic (or so…

cs.LO2025

Proof systems for partial incorrectness logic (partial reverse Hoare logic)

Yukihiro Oda

Partial incorrectness logic (partial reverse Hoare logic) has recently been introduced as a new Hoare-style logic that over-approximates the weakest pre-conditions of a program and…

cs.LO2021★ 3 cited

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…