Nagoya University · Faculty of Informatics / Graduate School of Informatics

Research keywordslogically constrained term rewrite systems・all-path reachability・concurrent programs・imperative program transformation・confluence proving・starvation freedom・semaphore models・termination analysis・bit-vector arithmetic・program verification

This is a public-data preview. Personalized fit, contact angles, and saved workflows require sign-in.

• A nesting-preserving transformation of SIMP programs into logically constrained term rewrite systems2025 · 20250300 144 巻 頁： 1 - 15 2025年3月
• Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms2025 · Journal of Logical and Algebraic Methods in Programming 145 巻 頁： 1 - 18 2025年5月
• On Transforming Prioritized Multithreaded Programs into Logically Constrained Term Rewrite Systems2025 · Informal Proceedings of the 11th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2025) 頁： 39 - 51 2025年7月
• Transforming concurrent programs with semaphores into logically constrained term rewrite systems2025 · Journal of Logical and Algebraic Methods in Programming 143 巻 頁： 1 - 23 2025年2月

• Official profile