Akihisa Yamada

Akihisa Yamada

Auto-generated profile, based on publicly available information

Akihisa Yamada

National Institute of Advanced Industrial Science and Technology

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 April 2019
Verified
Book Chapter
Open access
PDF file
JGJürgen Giesl
Jürgen Giesl
ARAlbert Rubio
Albert Rubio
CSChristian Sternagel
Christian Sternagel
JWJohannes Waldmann
Johannes Waldmann
AYAkihisa Yamada
Akihisa Yamada
The termination and complexity competition (termCOMP) focuses on automated termination and complexity analysis for various kinds of programming paradigms, including categories for term rewriting, integer transition systems, imperative programming, logic programming, and functional programming. In all categories, the competition also welcomes the participation of tools providing certifiable output. The goal of the competition is to demonstrate the power and advances of the state-of-the-art tools in each of these areas.

1 January 2020 in Science of Computer Programming
Verified
Journal Article
Open access
MAMartin Avanzini
Martin Avanzini
ULUgo Dal Lago
Ugo Dal Lago
AYAkihisa Yamada
Akihisa Yamada

1 January 2014
Verified
Book Chapter
Closed access
PDF file
AYAkihisa Yamada
Akihisa Yamada
KKKeiichirou Kusakari
Keiichirou Kusakari
TSToshiki Sakabe
Toshiki Sakabe

1 April 2015
Verified
Conference Paper
Closed access
AYAkihisa Yamada
Akihisa Yamada
TKTakashi Kitamura
Takashi Kitamura
CACyrille Artho
Cyrille Artho
ECEun-Hye Choi
Eun-Hye Choi
YOYutaka Oiwa
Yutaka Oiwa
ABArmin Biere
Armin Biere
Combinatorial testing aims at reducing the cost of software and system testing by reducing the number of test cases to be executed. We propose an approach for combinatorial testing that generates a set of test cases that is as small as possible, using incremental SAT solving. We present several search-space pruning techniques that further improve our approach. Experiments show a significant improvement of our approach over other SAT-based approaches, and considerable reduction of the number of test cases over other combinatorial testing tools.

4 April 2019
Verified
Book Chapter
Open access
PDF file
Ezio BartocciEzio Bartocci
Ezio Bartocci
DBDirk Beyer
Dirk Beyer
PBPaul E. Black
Paul E. Black
GFGrigory Fedyukovich
Grigory Fedyukovich
HGHubert Garavel
Hubert Garavel
AYAkihisa Yamada
Akihisa Yamada
Evaluation of scientific contributions can be done in many different ways. For the various research communities working on the verification of systems (software, hardware, or the underlying involved mechanisms), it is important to bring together the community and to compare the state of the art, in order to identify progress of and new challenges in the research area. Competitions are a suitable way to do that. The first verification competition was created in 1992 (SAT competition), shortly followed by the CASC competition in 1996. Since the year 2000, the number of dedicated verification competitions is steadily increasing. Many of these events now happen regularly, gathering researchers that would like to understand how well their research prototypes work in practice. Scientific results have to be reproducible, and powerful computers are becoming cheaper and cheaper, thus, these competitions are becoming an important means for advancing research in verification technology. TOOLympics 2019 is an event to celebrate the achievements of the various competitions, and to understand their commonalities and differences. This volume is dedicated to the presentation of the 16 competitions that joined TOOLympics as part of the celebration of the \(25^{ th }\) anniversary of the TACAS conference.

25 August 2016
Verified
Conference Paper
Open access
AYAkihisa Yamada
Akihisa Yamada
ABArmin Biere
Armin Biere
CACyrille Artho
Cyrille Artho
TKTakashi Kitamura
Takashi Kitamura
ECEun-Hye Choi
Eun-Hye Choi
Combinatorial testing aims at covering the interactions of parameters in a system under test, while some combinations may be forbidden by given constraints (forbidden tuples). In this paper, we illustrate that such forbidden tuples correspond to unsatisfiable cores, a widely understood notion in the SAT solving community. Based on this observation, we propose a technique to detect forbidden tuples lazily during a greedy test case generation, which significantly reduces the number of required SAT solving calls. We further reduce the amount of time spent in SAT solving by essentially ignoring constraints while constructing each test case, but then “amending” it to obtain a test case that satisfies the constraints, again using unsatisfiable cores. Finally, to complement a disturbance due to ignoring constraints, we implement an efficient approximative SAT checking function in the SAT solver Lingeling. Through experiments we verify that our approach significantly improves the efficiency of constraint handling in our greedy combinatorial testing algorithm.