The Experts below are selected from a list of 90 Experts worldwide ranked by ideXlab platform
Masato Takeichi - One of the best experts on this subject based on the ideXlab platform.
-
Swapping arguments and results of recursive functions
Lecture Notes in Computer Science, 2006Co-Authors: Akimasa Morihata, Kazuhiko Kakehi, Masato TakeichiAbstract:Many useful Calculation Rules, such as fusion and tupling, rely on well-structured functions, especially in terms of inputs and outputs. For instance, fusion requires that well-produced outputs should be connected to well-consumed inputs, so that unnecessary intermediate data structures can be eliminated. These Calculation Rules generally fail to work unless functions are well-structured. In this paper, we propose a new Calculation Rule called IO swapping. IO swapping exchanges call-time computations (occurring in the arguments) and return-time computations (occurring in the results) of a function, while guaranteeing that the original and resulting function compute the same value. IO swapping enables us to rearrange inputs and outputs so that the existing Calculation Rules can be applied. We present new systematic derivations of efficient programs for detecting palindromes, and a method of higher-order removal that can be applied to defunctionalize function arguments, as two concrete applications.
-
MPC - Swapping arguments and results of recursive functions
Lecture Notes in Computer Science, 2006Co-Authors: Akimasa Morihata, Kazuhiko Kakehi, Masato TakeichiAbstract:Many useful Calculation Rules, such as fusion and tupling, rely on well-structured functions, especially in terms of inputs and outputs. For instance, fusion requires that well-produced outputs should be connected to well-consumed inputs, so that unnecessary intermediate data structures can be eliminated. These Calculation Rules generally fail to work unless functions are well-structured. In this paper, we propose a new Calculation Rule called IO swapping. IO swapping exchanges call-time computations (occurring in the arguments) and return-time computations (occurring in the results) of a function, while guaranteeing that the original and resulting function compute the same value. IO swapping enables us to rearrange inputs and outputs so that the existing Calculation Rules can be applied. We present new systematic derivations of efficient programs for detecting palindromes, and a method of higher-order removal that can be applied to defunctionalize function arguments, as two concrete applications.
-
SAIG - Generation of efficient programs for solving maximum multi-marking problems
Lecture Notes in Computer Science, 2001Co-Authors: Isao Sasano, Masato TakeichiAbstract:Program generation has seen an important role in a wide range of software development processes, where effective Calculation Rules are critical. In this paper, we propose a more general Calculation Rule for generation of efficient programs for solving maximum marking problems. Easy to use and implement, our new Rule gives a significant extension of the Rule proposed by Sasano et al., allowing multiple kinds of marks as well as more general description of the property of acceptable markings. We illustrate its effectiveness using several interesting problems.
Akimasa Morihata - One of the best experts on this subject based on the ideXlab platform.
-
MPC - Swapping arguments and results of recursive functions
Lecture Notes in Computer Science, 2006Co-Authors: Akimasa Morihata, Kazuhiko Kakehi, Masato TakeichiAbstract:Many useful Calculation Rules, such as fusion and tupling, rely on well-structured functions, especially in terms of inputs and outputs. For instance, fusion requires that well-produced outputs should be connected to well-consumed inputs, so that unnecessary intermediate data structures can be eliminated. These Calculation Rules generally fail to work unless functions are well-structured. In this paper, we propose a new Calculation Rule called IO swapping. IO swapping exchanges call-time computations (occurring in the arguments) and return-time computations (occurring in the results) of a function, while guaranteeing that the original and resulting function compute the same value. IO swapping enables us to rearrange inputs and outputs so that the existing Calculation Rules can be applied. We present new systematic derivations of efficient programs for detecting palindromes, and a method of higher-order removal that can be applied to defunctionalize function arguments, as two concrete applications.
-
Swapping arguments and results of recursive functions
Lecture Notes in Computer Science, 2006Co-Authors: Akimasa Morihata, Kazuhiko Kakehi, Masato TakeichiAbstract:Many useful Calculation Rules, such as fusion and tupling, rely on well-structured functions, especially in terms of inputs and outputs. For instance, fusion requires that well-produced outputs should be connected to well-consumed inputs, so that unnecessary intermediate data structures can be eliminated. These Calculation Rules generally fail to work unless functions are well-structured. In this paper, we propose a new Calculation Rule called IO swapping. IO swapping exchanges call-time computations (occurring in the arguments) and return-time computations (occurring in the results) of a function, while guaranteeing that the original and resulting function compute the same value. IO swapping enables us to rearrange inputs and outputs so that the existing Calculation Rules can be applied. We present new systematic derivations of efficient programs for detecting palindromes, and a method of higher-order removal that can be applied to defunctionalize function arguments, as two concrete applications.
Xiyao Cai - One of the best experts on this subject based on the ideXlab platform.
-
a unified fitness function Calculation Rule for flag conditions to improve evolutionary testing
Automated Software Engineering, 2005Co-Authors: Xiyang Liu, Hehui Liu, Bin Wang, Ping Chen, Xiyao CaiAbstract:Evolutionary testing (ET), automatically generating test data with good quality, is an effective technique based on evolutionary algorithm. However, the presence of flag variables will make it degenerate to random testing in structural testing. Much of previous work has addressed this problem, but all can be characterized as program-specific. In this paper, flag cost function is introduced as the main component of fitness function, whose value changes with the variation of flag problem. Based on this, a unified fitness Calculation Rule for flag conditions is proposed. The experiments on programs with flag problems, once considered as inextricable in previous work, and the Traffic Alert and Collision Avoidance System (TCAS) code showed the effectiveness of our unified approach.
-
ASE - A unified fitness function Calculation Rule for flag conditions to improve evolutionary testing
Proceedings of the 20th IEEE ACM international Conference on Automated software engineering - ASE '05, 2005Co-Authors: Xiyang Liu, Hehui Liu, Bin Wang, Ping Chen, Xiyao CaiAbstract:Evolutionary testing (ET), automatically generating test data with good quality, is an effective technique based on evolutionary algorithm. However, the presence of flag variables will make it degenerate to random testing in structural testing. Much of previous work has addressed this problem, but all can be characterized as program-specific. In this paper, flag cost function is introduced as the main component of fitness function, whose value changes with the variation of flag problem. Based on this, a unified fitness Calculation Rule for flag conditions is proposed. The experiments on programs with flag problems, once considered as inextricable in previous work, and the Traffic Alert and Collision Avoidance System (TCAS) code showed the effectiveness of our unified approach.
Kazuhiko Kakehi - One of the best experts on this subject based on the ideXlab platform.
-
MPC - Swapping arguments and results of recursive functions
Lecture Notes in Computer Science, 2006Co-Authors: Akimasa Morihata, Kazuhiko Kakehi, Masato TakeichiAbstract:Many useful Calculation Rules, such as fusion and tupling, rely on well-structured functions, especially in terms of inputs and outputs. For instance, fusion requires that well-produced outputs should be connected to well-consumed inputs, so that unnecessary intermediate data structures can be eliminated. These Calculation Rules generally fail to work unless functions are well-structured. In this paper, we propose a new Calculation Rule called IO swapping. IO swapping exchanges call-time computations (occurring in the arguments) and return-time computations (occurring in the results) of a function, while guaranteeing that the original and resulting function compute the same value. IO swapping enables us to rearrange inputs and outputs so that the existing Calculation Rules can be applied. We present new systematic derivations of efficient programs for detecting palindromes, and a method of higher-order removal that can be applied to defunctionalize function arguments, as two concrete applications.
-
Swapping arguments and results of recursive functions
Lecture Notes in Computer Science, 2006Co-Authors: Akimasa Morihata, Kazuhiko Kakehi, Masato TakeichiAbstract:Many useful Calculation Rules, such as fusion and tupling, rely on well-structured functions, especially in terms of inputs and outputs. For instance, fusion requires that well-produced outputs should be connected to well-consumed inputs, so that unnecessary intermediate data structures can be eliminated. These Calculation Rules generally fail to work unless functions are well-structured. In this paper, we propose a new Calculation Rule called IO swapping. IO swapping exchanges call-time computations (occurring in the arguments) and return-time computations (occurring in the results) of a function, while guaranteeing that the original and resulting function compute the same value. IO swapping enables us to rearrange inputs and outputs so that the existing Calculation Rules can be applied. We present new systematic derivations of efficient programs for detecting palindromes, and a method of higher-order removal that can be applied to defunctionalize function arguments, as two concrete applications.
Xiyang Liu - One of the best experts on this subject based on the ideXlab platform.
-
a unified fitness function Calculation Rule for flag conditions to improve evolutionary testing
Automated Software Engineering, 2005Co-Authors: Xiyang Liu, Hehui Liu, Bin Wang, Ping Chen, Xiyao CaiAbstract:Evolutionary testing (ET), automatically generating test data with good quality, is an effective technique based on evolutionary algorithm. However, the presence of flag variables will make it degenerate to random testing in structural testing. Much of previous work has addressed this problem, but all can be characterized as program-specific. In this paper, flag cost function is introduced as the main component of fitness function, whose value changes with the variation of flag problem. Based on this, a unified fitness Calculation Rule for flag conditions is proposed. The experiments on programs with flag problems, once considered as inextricable in previous work, and the Traffic Alert and Collision Avoidance System (TCAS) code showed the effectiveness of our unified approach.
-
ASE - A unified fitness function Calculation Rule for flag conditions to improve evolutionary testing
Proceedings of the 20th IEEE ACM international Conference on Automated software engineering - ASE '05, 2005Co-Authors: Xiyang Liu, Hehui Liu, Bin Wang, Ping Chen, Xiyao CaiAbstract:Evolutionary testing (ET), automatically generating test data with good quality, is an effective technique based on evolutionary algorithm. However, the presence of flag variables will make it degenerate to random testing in structural testing. Much of previous work has addressed this problem, but all can be characterized as program-specific. In this paper, flag cost function is introduced as the main component of fitness function, whose value changes with the variation of flag problem. Based on this, a unified fitness Calculation Rule for flag conditions is proposed. The experiments on programs with flag problems, once considered as inextricable in previous work, and the Traffic Alert and Collision Avoidance System (TCAS) code showed the effectiveness of our unified approach.
-
APSEC - Evolutionary testing of unstructured programs in the presence of flag problems
12th Asia-Pacific Software Engineering Conference (APSEC'05), 2005Co-Authors: Xiyang Liu, Hehui Liu, Ning Lei, Bin WangAbstract:Automated test data generation is always a hot topic in software engineering, and evolutionary testing (ET) is an emerging and promising technology for this purpose. However, in structural testing, the presence of flag variables lead evolutionary testing degenerate to random testing. All previous work only focused on the flag problem in structural programs, and no attention has been paid to unstructured programs with flag conditions, although numerous industrial real-world programs are of this kind. In this paper, as a further step of the author's research, a fitness Calculation Rule for flag conditions in unstructured programs is proposed. The experiments on exemplifications recurrent in industrial real-world programs, such as Linux and NS2, show that our new fitness Calculation Rule could effectively guide evolutionary search to successfully find the required test data at low cost, while all previous approaches failed.
