38 citations
- The University of TokyoJP15 papers
- Nagoya UniversityJP12 papers
- National Astronomical Observatory of JapanJP12 papers
- The Graduate University for Advanced Studies, SOKENDAIJP12 papers
- California Institute of TechnologyUS11 papers
- Georgia Institute of TechnologyUS11 papers
- Hiroshima UniversityJP11 papers
- Korea Astronomy and Space Science InstituteKR11 papers
- Massachusetts Institute of TechnologyUS11 papers
- Seoul National UniversityKR11 papers
- Universitat de ValènciaES11 papers
- University of ArizonaUS11 papers
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2025★ 1 cited
Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
Kanta Takahata, Jonas Schöpf, Naoki Nishida +1
Logically constrained term rewriting is a relatively new rewriting formalism that naturally supports built-in data structures, such as integers and bit vectors. In the analysis of…
cs.LO2025
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…