17 citations · 25 across the 8 of their papers we have counts for
5 papers · 1 filter
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…
Reduced Dependency Spaces for Existential Parameterised Boolean Equation Systems
Yutaro Nagae, Masahiko Sakai
A parameterised Boolean equation system (PBES) is a set of equations that defines sets satisfying the equations as the least and/or greatest fixed-points. Thus this system is regar…
An Extension of Proof Graphs for Disjunctive Parameterised Boolean Equation Systems
Yutaro Nagae, Masahiko Sakai, Hiroyuki Seki
A parameterised Boolean equation system (PBES) is a set of equations that defines sets as the least and/or greatest fixed-points that satisfy the equations. This system is regarded…
Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
Unravelings are transformations from a conditional term rewriting system (CTRS, for short) over an original signature into an unconditional term rewriting systems (TRS, for short)…
Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems
Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai +1
Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful meth…