Misaki Kojima

According to our database, Misaki Kojima authored at least 12 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2026

Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting (Full Version).

Naoki Nishida, Kazushi Nishie, Misaki Kojima

CoRR, February, 2026

Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification (Full Version).

Misaki Kojima, Naoki Nishida

CoRR, February, 2026

2025

Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version).

Naoki Nishida, Misaki Kojima, Yuto Nakamura

CoRR, July, 2025

A nesting-preserving transformation of SIMP programs into logically constrained term rewrite systems.

Naoki Nishida, Misaki Kojima, Ayuka Matsumi

J. Log. Algebraic Methods Program., 2025

Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms.

Naoki Nishida, Misaki Kojima, Takumi Kato

J. Log. Algebraic Methods Program., 2025

Transforming concurrent programs with semaphores into logically constrained term rewrite systems.

Misaki Kojima, Naoki Nishida, Yutaka Matsubara

J. Log. Algebraic Methods Program., 2025

Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems.

Naoki Nishida, Misaki Kojima, Yuto Nakamura

Proceedings of the Frontiers of Combining Systems - 15th International Symposium, 2025

2024

A Sufficient Condition of Logically Constrained Term Rewrite Systems for Decidability of All-path Reachability Problems with Constant Destinations.

Misaki Kojima, Naoki Nishida

J. Inf. Process., 2024

On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems Under Process Fairness.

Misaki Kojima, Naoki Nishida

Proceedings of the Reachability Problems - 18th International Conference, 2024

2023

Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting.

Misaki Kojima, Naoki Nishida

J. Log. Algebraic Methods Program., October, 2023

On Singleton Self-Loop Removal for Termination of LCTRSs with Bit-Vector Arithmetic.

Ayuka Matsumi, Naoki Nishida, Misaki Kojima, Donghoon Shin

CoRR, 2023

From Starvation Freedom to All-Path Reachability Problems in Constrained Rewriting.

Misaki Kojima, Naoki Nishida

Proceedings of the Practical Aspects of Declarative Languages, 2023