Fujitsu Corporation

Kabushiki Kaisha Toshiba

Aida Engineering, Ltd.

Samsung Electronics Co., Ltd.

Hewlett-packard Development Company, L.p.

Fujitsu Telecom Networks Limited

Fujistu Limited

Fujtsu Limited

Hiroaki Yoshida

Mukul Ranjan Prasad

Tadashi Sakai

Tomio Ono

Mariko Suzuki

Naoshi Sakuma

Fumio Takei

Hiroyuki Fukuda

Noriyasu Aso

Mitsuru Tomono

Ripon K Saha

Toshio Manabe

Masami Tsutsumi

Kensuke Yoshida

Seiji Hibino

Shinji Saito

Masayuki Ishikawa

Genichi Hatakoshi

Indradeep Ghosh

Tomoaki Tanaka

Yoshihiro Tonomoto

Eiji Suzuki

Akira Harada

Katsumi Sugimoto

Kenji Fuke

Masato Matsuzuki

Katsuya Shimatsu

Nawalage Florence Cooray

Keiko Tonai

Maarten H Wiggers

Yasuhiro Wakabayashi

Daisuke Fujii

Yukinari Okawa

Kodai Moritaka

Seiji Nagai

Shinya Nunoue

Yasuhiro Harada

Katsumi Adachi

Masao Kondo

Kenji Suzuki

Johji Nishio

Hideto Sugawara

Kazuhiko Itaya

Yasuo Ohba

Wataru Sotoyama

Hidetoshi Fujimoto

Yukie Nishikawa

Koichi Nitta

Masaaki Onomura

Hiroshi Nagase

Hiroshi Endo

Kazutaka Terashima

John Rennie

Masatoshi Ogawa

Shigeyoshi Umemiya

Kazuaki Karasawa

Kiyoshi Chinzei

Masato Kawashima

Yoshihiro Kokubun

Michihiro Fujii

Takahiro Arioka

Masaru Iida

Hideyuki Matsuda

Naoto Hirao

Kotaro Ohori

Atsushi Kamata

Shino Tokuyo

Yukitoshi Takano

Yoshio Kikuchi

Yoichi Takasu

Yoshikazu Yamamoto

Peter James Parbrook

Takashi Inui

Masaru Kawachi

Yasuhiko Tanaka

Isamu Yanase

Kazuki Honjo

Hiroyuki Okitsu

Amiko Chihara

Hideyuki Shimobuchi

Takuya Ohwa

Yuri Nakao

Osamu Yahata

Masaki Senda

Tetsuya Yokomoto

Shin Hwei Tan

Zhiqiang Zang

Makoto Yoshino

Youichi Takasu

Divya Gopinath

Ayasa So

Cuong Nguyen

Shingo Uchiyama

Yukihide Toda

Soseki Aniya

Katsuyasu Ito

Koichi Hishinuma

Rohan Bavishi

Hirokazu Kawabuchi

Benjamin Mehne

Operations may include obtaining a repair related to correcting an error of source code of a software program, the repair including an edit to make to the source code. The operations may further include determining a change type of the edit. The operations may additionally include identifying an explanation template from a library of explanation templates based on the change type corresponding to the explanation template in the library of explanation templates. In addition, the operations may include generating a change explanation for the edit based on the explanation template. The change explanation may provide a natural language explanation of the changes made by the edit.

Generation of software program repair explanations

A developing device includes a developer roller, a stir-and-transport member, and a layer thickness regulating member. The developer roller may carry developer to a photosensitive body. The stir-and-transport member may supply the developer to the developer roller. The layer thickness regulating member is located adjacent the developer roller to remove excess developer. The layer thickness regulating member includes a guide element to direct the excess developer to the stir-and-transport member.

Developing device

A search device, for each of a plurality of inquiries including a plurality of options, based on a log of answers of a respondent in the past, specifies a matching option corresponding to a trend of answers of the respondent from the plurality of options to be represented to the respondent. The search device, when an answer to the plurality of options is included in the matching option, determines that it is a preference-reached mode that is a mode where the estimating a preference of the user converges. The search device transmits, to the respondent, an inquiry including options, contents of the options included in the inquiry being changed depend on whether it is determined to be a preference-reached mode in the determining.

Computer-readable recording medium, estimation method and estimation device

According to one or more embodiments, operations may include identifying a plurality of source code edits made between a buggy version of first source code of a first software program and a repaired version of the first source code. The operations may also include identifying a plurality of clusters of the source code edits. Each cluster of the plurality of clusters includes one or more source code edits of the plurality of source code edits. The operations may also include identifying a plurality of valid clusters of the plurality of clusters and identifying one or more invalid clusters of the plurality of clusters based on compiling of the first source code. Moreover, the operations may include identifying, as a first repair of the first error, a particular set of one or more valid clusters of the plurality of valid clusters while excluding the one or more invalid clusters from consideration.

Automated software program repair

Operations may include generating a first graphical representation of a buggy version of source code of a software program and generating a second graphical representation of a repaired version of the source code. The buggy version may include an error and the error has been corrected in the repaired version. The operations may also include identifying, as matching nodes, a first node of the first graphical representation and a second node of the second graphical representation that match each other. The operations may additionally include applying a same reduction to the first node and to the second node concurrently to generate a reduced buggy version of the source code and a reduced repaired version of the source code. Further, the operations may include generating a repair example with respect to correcting the error in which the repair example is based on the reduced buggy version and the reduced repaired version.

Generation of software program repair examples

A method may include obtaining a first violation in a first portion of a first software program and obtaining a first proposed patch to remediate the first violation. The method may include identifying a second software program with a second portion that includes a second violation. The method may include simplifying the second portion of the second software program by removing one or more elements in the second portion that are identified as extraneous. The method may include applying the first proposed patch for the first violation to the simplified second portion to generate a repaired simplified second portion. The method may include obtaining an executable repaired simplified second portion from the repaired simplified second portion. The method may include presenting the second violation and the executable repaired simplified second portion as an example of how the first proposed patch would affect the first violation and the first software program.

Generation of explanatory and executable repair examples

According to an aspect of an embodiment, operations may include retrieving a set of repair patterns and a second set of violations of software programs. The operations may further include selecting an unfixed violation from the retrieved second set of violations and a repair pattern from the set of repair patterns. The operations may further include executing a first set of operations for refinement of repair patterns. The first set of operations may include applying the selected repair pattern on the selected unfixed violation, removing the applied repair pattern from the set of repair patterns based on the determination that a repair result corresponds to a violation. The first set of operations may further include reselecting next repair pattern as the selected repair pattern. The operations may further include obtaining a refined set of repair patterns by iteratively executing the first set of operations for the set of repair patterns.

Refinement of repair patterns for static analysis violations in software programs

According to an aspect of an embodiment, operations may include generating a first abstract syntax tree with respect to a first iteration of first source code of a first software program and generating a second abstract syntax tree with respect to a second iteration of the first source code. The operations may also include identifying a first sub-tree of the first abstract syntax tree and identifying a plurality of second sub-trees of the second abstract syntax tree. In addition the operations may include generating a first textual representation of the first sub-tree and generating a plurality of second textual representations with respect to the second sub-trees. Moreover, the operations may include modifying the second abstract syntax tree based on the second sub-trees and obtaining a third iteration of the first source code by regenerating the first source code based on the modified second abstract syntax tree.

Operations may include identifying an edit that corresponds to a fault of a program. The edit may be identified based on a difference between the program and an improved program. The operations may include obtaining an AST that represents the program and includes defect nodes that correspond to a fault location and include an edit node. The operations may include classifying a particular node as a primary node that operates as a starting point for the edit. The operations may include identifying a path from the primary node to the edit node. The operations may include generating a fix pattern based on the path and the edit. The operations may include performing repairs with respect to an identified fault of code. The repairs may be performed using the fix pattern and based on the identified fault of the code being the same type as the fault of the program.

Data-driven synthesis of fix patterns

According to an aspect of an embodiment, operations may include determining a plurality of event correspondences. Each event correspondence may indicate a correspondence between a respective change of a plurality of changes made to first source code of a first software program and a respective event type that occurs with respect to the first software program. The plurality of event correspondences may be determined by performing two or more event type inference operations of a plurality of event type inference operations. The plurality of event type inference operations may include determining a fault introduction event, determining a fault correction event, determining a defect introduction event, determining a defect correction event, and determining a platform migration event.

According to an aspect of an embodiment, a method may include generating an abstract code graph (ACG). The method may include obtaining an abstract syntax tree (AST). The AST may include a first AST node that may represent a first construct at a first level of abstraction and a second AST node that may represent a second construct. The method may further include generating an ACG, based on the AST. The generating of ACG may include generating a first ACG node based on the first AST node and a second ACG node based on the second AST node. The generating of ACG may also include generating, based on the first ACG node, a third ACG node that represents the first construct at a second level of abstraction. The third ACG node may be connected between the first ACG node and the second ACG node based on the AST.

Representing software with an abstract code graph

According to an aspect of an embodiment, a method may identifying a fault location of a fault in a tested software program using a test suite and obtaining a repair candidate for the fault. In addition, the method may include obtaining a repair code pattern of the repair candidate and determining a number of occurrences of the repair code pattern in existing code of multiple existing software programs. Moreover, the method may include prioritizing the repair candidate as a repair of the tested software program based on the number of occurrences of the repair code pattern. The method may also include performing repair operations on the tested software program according to the prioritizing of the repair candidate.

Automated software program repair candidate selection

A method may include obtaining a plurality of synthesized method invocations using a plurality of objects and a plurality of methods of a software program. The method may also include determining a prioritization of the plurality of synthesized method invocations based on one or more of: relationships between one or more characteristics of each of the plurality of synthesized method invocations and a fault location; and relationships between the one or more characteristics and an error report that corresponds to the fault location. The method may also include selecting a synthesized method invocation from the plurality of synthesized method invocations for repair operations with respect to the fault location based on a corresponding prioritization of the selected synthesized method invocation. In addition, the method may include performing repair operations with respect to the fault location and the selected synthesized method invocation.

Method invocation synthesis for software program repair

A method may include identifying a fault location in a software program. The method may further include generating an instrumentation function with respect to the fault location. In addition, the method may include replacing a statement at the fault location with the instrumentation function and performing a first test execution of the software program with the implemented instrumentation function. The method may also include selecting the fault location for implementation of a repair candidate based on output of the instrumentation function in response to the first test execution and implementing the repair candidate at the fault location as a patch based on the selection. Moreover, the method may include performing a second test execution of the software program with respect to the patch, evaluating the patch based on results of the second test execution, and accepting or rejecting the patch based on the evaluation.

In some examples, a method to interactively repair a software program using one or more automatically generated tests with human-provided test oracles may include identifying a fault location in a software program, generating a potential repair at the fault location based on a repair candidate, automatically generating a first test to test the potential repair, and generating a first query for a first test oracle based on the first test. The method may also include obtaining a response to the first query from a human, generating a first human-provided test oracle based on the first query and the obtained response to the first query, augmenting a test suite to include the first automatically generated test with the first human-provided test oracle, and testing the potential repair using the augmented test suite including the first automatically generated test with the first human-provided test oracle.

Interactive software program repair

Growing community of inventors

Cupertino, CA, United States of America

Hiroaki Yoshida