35 citations · 65 across the 12 of their papers we have counts for
Showing 2018 · cs.LOShow all
2 papers · 2 filters
cs.LO2018
Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers
Tomohiro Sasano, Naoki Nishida, Masahiko Sakai +1
In the dependency pair framework for proving termination of rewriting systems, polynomial interpretations are used to transform dependency chains into bounded decreasing sequences…
cs.LO2018★ 1 cited
Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction
Shinnosuke Mizutani, Naoki Nishida
A proof tableau of Hoare logic is an annotated program with pre- and post-conditions, which corresponds to an inference tree of Hoare logic. In this paper, we show that a proof tab…