The following pages link to Akihisa Yamada (Q1648878):
Displayed 22 items.
- On probabilistic term rewriting (Q1648879) (← links)
- A formalization of the LLL basis reduction algorithm (Q1791154) (← links)
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm (Q1984794) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- Architecture-guided test resource allocation via logic (Q2117254) (← links)
- Formalizing the LLL basis reduction algorithm and the LLL factorization algorithm in Isabelle/HOL (Q2209537) (← links)
- A verified implementation of algebraic numbers in Isabelle/HOL (Q2303244) (← links)
- Relative termination via dependency pairs (Q2360875) (← links)
- Certifying safety and termination proofs for integer transition systems (Q2405269) (← links)
- Algebraic Numbers in Isabelle/HOL (Q2829274) (← links)
- Reducing Relative Termination to Dependency Pair Problems (Q3454090) (← links)
- AC-KBO revisited (Q4593023) (← links)
- (Q5028488) (← links)
- Relational Differential Dynamic Logic (Q5039509) (← links)
- AC-KBO Revisited (Q5170721) (← links)
- Nagoya Termination Tool (Q5170837) (← links)
- Relational differential dynamic logic (Q5239265) (← links)
- AC Dependency Pairs Revisited (Q5278394) (← links)
- (Q5875442) (← links)
- Reachability Analysis for Termination and Confluence of Rewriting (Q6091333) (← links)