Follow
Akihisa Yamada
Akihisa Yamada
Senior researcher, AIST
Verified email at aist.go.jp - Homepage
Title
Cited by
Cited by
Year
The termination and complexity competition
J Giesl, A Rubio, C Sternagel, J Waldmann, A Yamada
International Conference on Tools and Algorithms for the Construction and …, 2019
752019
Optimization of combinatorial testing by incremental SAT solving
A Yamada, T Kitamura, C Artho, EH Choi, Y Oiwa, A Biere
2015 IEEE 8th International Conference on Software Testing, Verification and …, 2015
682015
Greedy combinatorial test case generation using unsatisfiable cores
A Yamada, A Biere, C Artho, T Kitamura, EH Choi
Proceedings of the 31st IEEE/ACM International Conference on Automated …, 2016
652016
Nagoya termination tool
A Yamada, K Kusakari, T Sakabe
International Conference on Rewriting Techniques and Applications, 466-475, 2014
542014
TOOLympics 2019: An overview of competitions in formal methods
E Bartocci, D Beyer, PE Black, G Fedyukovich, H Garavel, A Hartmanns, ...
Tools and Algorithms for the Construction and Analysis of Systems: 25 Years …, 2019
502019
Formalizing Jordan normal forms in Isabelle/HOL
R Thiemann, A Yamada
Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and …, 2016
402016
On probabilistic term rewriting
M Avanzini, U Dal Lago, A Yamada
Science of Computer Programming 185, 102338, 2020
382020
A unified ordering for termination proving
A Yamada, K Kusakari, T Sakabe
Science of Computer Programming 111, 110-134, 2015
342015
On probabilistic term rewriting
M Avanzini, U Dal Lago, A Yamada
International Symposium on Functional and Logic Programming, 132-148, 2018
282018
Matrices, Jordan normal forms, and spectral radius theory
R Thiemann, A Yamada
Archive of Formal Proofs 2015, 2015
24*2015
Algebraic numbers in Isabelle/HOL
R Thiemann, A Yamada
Interactive Theorem Proving: 7th International Conference, ITP 2016, Nancy …, 2016
222016
A formalization of the Berlekamp-Zassenhaus factorization algorithm
J Divasón, S Joosten, R Thiemann, A Yamada
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and …, 2017
202017
Reachability analysis for termination and confluence of rewriting
C Sternagel, A Yamada
Tools and Algorithms for the Construction and Analysis of Systems: 25th …, 2019
192019
AC dependency pairs revisited
A Yamada, C Sternagel, R Thiemann, K Kusakari
25th EACSL Annual Conference on Computer Science Logic (CSL 2016), 8: 1-8: 16, 2016
172016
Combinatorial testing for tree-structured test models with constraints
T Kitamura, A Yamada, G Hatayama, C Artho, EH Choi, NTB Do, Y Oiwa, ...
2015 IEEE International Conference on Software Quality, Reliability and …, 2015
162015
Goal-aware RSS for complex scenarios via program logic
I Hasuo, C Eberhart, J Haydon, J Dubut, R Bohrer, T Kobayashi, ...
IEEE Transactions on Intelligent Vehicles 8 (4), 3040-3072, 2022
142022
Certifying safety and termination proofs for integer transition systems
M Brockschmidt, SJC Joosten, R Thiemann, A Yamada
Automated Deduction–CADE 26: 26th International Conference on Automated …, 2017
132017
Priority integration for weighted combinatorial testing
EH Choi, T Kitamura, C Artho, A Yamada, Y Oiwa
2015 IEEE 39th Annual Computer Software and Applications Conference 2, 242-247, 2015
132015
Efficient certification of complexity proofs: Formalizing the Perron–Frobenius theorem (invited talk paper)
J Divasón, S Joosten, O Kunčar, R Thiemann, A Yamada
Proceedings of the 7th ACM SIGPLAN International Conference on Certified …, 2018
112018
Tuple interpretations for termination of term rewriting
A Yamada
Journal of Automated Reasoning 66 (4), 667-688, 2022
102022
The system can't perform the operation now. Try again later.
Articles 1–20