5 citations · 6 across the 4 of their papers we have counts for
4 papers
Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version)
Takahito Aoto, Naoki Nishida, Jonas Schöpf
Logically constrained term rewrite systems (LCTRSs) are a rewriting formalism that naturally supports built-in data structures, including integers and bit-vectors. The recent frame…
Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms (Full Version)
Kanta Takahata, Jonas Schöpf, Naoki Nishida +1
Logically constrained term rewriting is a rewriting framework that supports built-in data structures such as integers and bit vectors. Recently, constrained terms play a key role i…
Automated Analysis of Logically Constrained Rewrite Systems using crest
Jonas Schöpf, Aart Middeldorp
We present crest, a tool for automatically proving (non-)confluence and termination of logically constrained rewrite systems. We compare crest to other tools for logically constrai…
Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)
Takahito Aoto, Naoki Nishida, Jonas Schöpf
Logically constrained term rewriting is a relatively new formalism where rules are equipped with constraints over some arbitrary theory. Although there are many recent advances wit…