EasyChair Smart SlideUser guide
Author: Naoki Nishida

This page shows all presentations of this author published in EasyChair Smart Slide.

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

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

Misaki Kojima and Naoki Nishida

On Transforming Imperative Programs into Logically Constrained Term Rewrite Systems via Injective Functions from Configurations to Terms

On Transforming Imperative Programs into Logically Constrained Term Rewrite Systems via Injective Functions from Configurations to Terms

Naoki Nishida, Misaki Kojima and Takumi Kato

On Transforming Rewriting-Induction Proofs for Logical-Connective-Free Sequents into Cyclic Proofs

On Transforming Rewriting-Induction Proofs for Logical-Connective-Free Sequents into Cyclic Proofs

Shujun Zhang and Naoki Nishida

On Reducing Non-Occurrence of Specified Runtime Errors to All-Path Reachability Problems of Constrained Rewriting

On Reducing Non-Occurrence of Specified Runtime Errors to All-Path Reachability Problems of Constrained Rewriting

Misaki Kojima and Naoki Nishida

Inversion and Determinization in Term Rewriting

Inversion and Determinization in Term Rewriting

Naoki Nishida

Loop Detection by Logically Constrained Term Rewriting

Loop Detection by Logically Constrained Term Rewriting

Naoki Nishida and Sarah Winkler

Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems

Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems

Naoki Nishida and Yuya Maeda

On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems

On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems

Yoshiaki Kanazawa and Naoki Nishida

On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions

On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions

Naoki Nishida and Yuya Maeda

Convergence of Simultaneously and Sequentially Unraveled TRSs for Normal Conditional TRSs

Convergence of Simultaneously and Sequentially Unraveled TRSs for Normal Conditional TRSs

Naoki Nishida, Yuta Tsuruta and Yoshiaki Kanazawa

Confluence Competition 2018

Confluence Competition 2018

Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani and Harald Zankl

Presentations in this collection: 11
Copyright © 2002 – 2026 EasyChair