1 citations · 2 across the 4 of their papers we have counts for
4 papers · 1 filter
Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting (Full Version)
Naoki Nishida, Kazushi Nishie, Misaki Kojima
Rewriting Induction (RI) is a principle to prove that an equation over terms is an inductive theorem of a rewrite system, i.e., that any ground instance of the equation is a theore…
Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification (Full Version)
Misaki Kojima, Naoki Nishida
An All-Path Reachability predicate over an object set is a pair of a source set and a target set, which are subsets of the object set. APR predicates have been defined for Abstract…
Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)
Naoki Nishida, Misaki Kojima, Yuto Nakamura
Considering patterns as sets of their instances, a difference operator over patterns computes a finite set of two given patterns, which represents the difference between the divide…
On Singleton Self-Loop Removal for Termination of LCTRSs with Bit-Vector Arithmetic
Ayuka Matsumi, Naoki Nishida, Misaki Kojima +1
As for term rewrite systems, the dependency pair (DP, for short) framework with several kinds of DP processors is useful for proving termination of logically constrained term rewri…