Akihisa Yamada

Orcid: 0000-0001-8872-2240

Affiliations:
  • National Institute of Advanced Industrial Science and Technology (AIST), Japan
  • National Institute of Informatics, NII, Japan
  • University of Innsbruck, Austria (former)
  • Nagoya University, Sakabe Lab. (former)


According to our database1, Akihisa Yamada authored at least 50 papers between 2013 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Goal-Aware RSS for Complex Scenarios via Program Logic.
IEEE Trans. Intell. Veh., April, 2023

The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions.
CoRR, 2023

Formalizing Results on Directed Sets.
Arch. Formal Proofs, 2023

Formalizing Results on Directed Sets in Isabelle/HOL (Proof Pearl).
Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

Termination of Term Rewriting: Foundation, Formalization, Implementation, and Competition (Invited Talk).
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022
Fixed Points Theorems for Non-Transitive Relations.
Log. Methods Comput. Sci., 2022

Tuple Interpretations for Termination of Term Rewriting.
J. Autom. Reason., 2022

Term Orderings for Non-reachability of (Conditional) Rewriting.
Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

2021
A Formalization of Weighted Path Orders and Recursive Path Orders.
Arch. Formal Proofs, 2021

Architecture-Guided Test Resource Allocation via Logic.
Proceedings of the Tests and Proofs - 15th International Conference, 2021

Multi-Dimensional Interpretations for Termination of Term Rewriting.
Proceedings of the Automated Deduction - CADE 28, 2021

2020
On probabilistic term rewriting.
Sci. Comput. Program., 2020

Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL.
J. Autom. Reason., 2020

A Verified Implementation of Algebraic Numbers in Isabelle/HOL.
J. Autom. Reason., 2020

A Verified Implementation of the Berlekamp-Zassenhaus Factorization Algorithm.
J. Autom. Reason., 2020

Relational Differential Dynamic Logic.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Certifying the Weighted Path Order (Invited Talk).
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019
Complete Non-Orders and Fixed Points.
Arch. Formal Proofs, 2019

Reachability Analysis for Termination and Confluence of Rewriting.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

The Termination and Complexity Competition.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

TOOLympics 2019: An Overview of Competitions in Formal Methods.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

Scenario Sampling for Cyber Physical Systems using Combinatorial Testing.
Proceedings of the 2019 IEEE International Conference on Software Testing, 2019

Relational differential dynamic logic: poster abstract.
Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, 2019

2018
A verified factorization algorithm for integer polynomials with polynomial complexity.
Arch. Formal Proofs, 2018

A verified LLL algorithm.
Arch. Formal Proofs, 2018

A Formalization of the LLL Basis Reduction Algorithm.
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper).
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

2017
Relative Termination via Dependency Pairs.
J. Autom. Reason., 2017

Subresultants.
Arch. Formal Proofs, 2017

Classification Tree Method with Parameter Shielding.
Proceedings of the Computer Safety, Reliability, and Security, 2017

A formalization of the Berlekamp-Zassenhaus factorization algorithm.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

Certifying Safety and Termination Proofs for Integer Transition Systems.
Proceedings of the Automated Deduction - CADE 26, 2017

2016
AC-KBO revisited.
Theory Pract. Log. Program., 2016

Polynomial Interpolation.
Arch. Formal Proofs, 2016

Polynomial Factorization.
Arch. Formal Proofs, 2016

Perron-Frobenius Theorem for Spectral Radius Analysis.
Arch. Formal Proofs, 2016

The Factorization Algorithm of Berlekamp and Zassenhaus.
Arch. Formal Proofs, 2016

Greedy combinatorial test case generation using unsatisfiable cores.
Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering, 2016

Distance-Integrated Combinatorial Testing.
Proceedings of the 27th IEEE International Symposium on Software Reliability Engineering, 2016

AC Dependency Pairs Revisited.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

Formalizing jordan normal forms in Isabelle/HOL.
Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, 2016

2015
A unified ordering for termination proving.
Sci. Comput. Program., 2015

Matrices, Jordan Normal Forms, and Spectral Radius Theory.
Arch. Formal Proofs, 2015

Algebraic Numbers in Isabelle/HOL.
Arch. Formal Proofs, 2015

Combinatorial Testing for Tree-Structured Test Models with Constraints.
Proceedings of the 2015 IEEE International Conference on Software Quality, 2015

Optimization of Combinatorial Testing by Incremental SAT Solving.
Proceedings of the 8th IEEE International Conference on Software Testing, 2015

Priority Integration for Weighted Combinatorial Testing.
Proceedings of the 39th IEEE Annual Computer Software and Applications Conference, 2015

Reducing Relative Termination to Dependency Pair Problems.
Proceedings of the Automated Deduction - CADE-25, 2015

2014
Nagoya Termination Tool.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013
Unifying the Knuth-Bendix, recursive path and polynomial orders.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013


  Loading...