ICPC 2012 – Author Index |
Contents -
Abstracts -
Authors
Online Calendar - iCal File |
Duszynski, Slawomir |
ICPC '12-POSTERS: "Applying Bioinformatics in ..."
Applying Bioinformatics in the Analysis of Software Variants
Vasil L. Tenev and Slawomir Duszynski (Fraunhofer IESE, Germany) Analysis of software similarity is a lively research topic, particularly in the context of software maintenance and software reuse. There exist several approaches to detecting similar code inside one software system and across many systems. While working on similarity analysis of software variants, we observed many analogies between the approaches for analyzing evolution of software and of biological organisms. Hence, we applied bioinformatics concepts used in genome similarity analysis, such as alignments and phylogenetic trees, to software variants. We present the usefulness of these concepts by applying them to a group of related systems from the BSD Unix family. @InProceedings{ICPC12p258, author = {Vasil L. Tenev and Slawomir Duszynski}, title = {Applying Bioinformatics in the Analysis of Software Variants}, booktitle = {Proc.\ ICPC}, publisher = {IEEE}, pages = {258--259}, doi = {}, year = {2012}, } |
|
Hayashi, Shinpei |
ICPC '12-POSTERS: "Toward Structured Location ..."
Toward Structured Location of Features
Hiroshi Kazato, Shinpei Hayashi, Satoshi Okada, Shunsuke Miyata, Takashi Hoshino, and Motoshi Saeki (NTT, Japan; Tokyo Institute of Technology, Japan) This paper proposes structured location, a semiautomatic technique and its supporting tool both for locating features and exposing their structures in source code, using a combination of dynamic analysis, sequential pattern mining and formal concept analysis. @InProceedings{ICPC12p254, author = {Hiroshi Kazato and Shinpei Hayashi and Satoshi Okada and Shunsuke Miyata and Takashi Hoshino and Motoshi Saeki}, title = {Toward Structured Location of Features}, booktitle = {Proc.\ ICPC}, publisher = {IEEE}, pages = {254--255}, doi = {}, year = {2012}, } |
|
Hoshino, Takashi |
ICPC '12-POSTERS: "Toward Structured Location ..."
Toward Structured Location of Features
Hiroshi Kazato, Shinpei Hayashi, Satoshi Okada, Shunsuke Miyata, Takashi Hoshino, and Motoshi Saeki (NTT, Japan; Tokyo Institute of Technology, Japan) This paper proposes structured location, a semiautomatic technique and its supporting tool both for locating features and exposing their structures in source code, using a combination of dynamic analysis, sequential pattern mining and formal concept analysis. @InProceedings{ICPC12p254, author = {Hiroshi Kazato and Shinpei Hayashi and Satoshi Okada and Shunsuke Miyata and Takashi Hoshino and Motoshi Saeki}, title = {Toward Structured Location of Features}, booktitle = {Proc.\ ICPC}, publisher = {IEEE}, pages = {254--255}, doi = {}, year = {2012}, } |
|
Kazato, Hiroshi |
ICPC '12-POSTERS: "Toward Structured Location ..."
Toward Structured Location of Features
Hiroshi Kazato, Shinpei Hayashi, Satoshi Okada, Shunsuke Miyata, Takashi Hoshino, and Motoshi Saeki (NTT, Japan; Tokyo Institute of Technology, Japan) This paper proposes structured location, a semiautomatic technique and its supporting tool both for locating features and exposing their structures in source code, using a combination of dynamic analysis, sequential pattern mining and formal concept analysis. @InProceedings{ICPC12p254, author = {Hiroshi Kazato and Shinpei Hayashi and Satoshi Okada and Shunsuke Miyata and Takashi Hoshino and Motoshi Saeki}, title = {Toward Structured Location of Features}, booktitle = {Proc.\ ICPC}, publisher = {IEEE}, pages = {254--255}, doi = {}, year = {2012}, } |
|
Lopes, Cristina |
ICPC '12-POSTERS: "Parallel Code Clone Detection ..."
Parallel Code Clone Detection Using MapReduce
Hitesh Sajnani, Joel Ossher, and Cristina Lopes (UC Irvine, USA) Code clone detection is an established topic in software engineering research. Many detection algorithms have been proposed and refined but very few exploit the inherent parallelism present in the problem, making large scale code clone detection difficult. To alleviate this shortcoming, we present a new technique to efficiently perform clone detection using the popular MapReduce paradigm. Preliminary experimental results demonstrates speed-up and scale-up of the proposed approach. @InProceedings{ICPC12p260, author = {Hitesh Sajnani and Joel Ossher and Cristina Lopes}, title = {Parallel Code Clone Detection Using MapReduce}, booktitle = {Proc.\ ICPC}, publisher = {IEEE}, pages = {260--261}, doi = {}, year = {2012}, } |
|
Miyata, Shunsuke |
ICPC '12-POSTERS: "Toward Structured Location ..."
Toward Structured Location of Features
Hiroshi Kazato, Shinpei Hayashi, Satoshi Okada, Shunsuke Miyata, Takashi Hoshino, and Motoshi Saeki (NTT, Japan; Tokyo Institute of Technology, Japan) This paper proposes structured location, a semiautomatic technique and its supporting tool both for locating features and exposing their structures in source code, using a combination of dynamic analysis, sequential pattern mining and formal concept analysis. @InProceedings{ICPC12p254, author = {Hiroshi Kazato and Shinpei Hayashi and Satoshi Okada and Shunsuke Miyata and Takashi Hoshino and Motoshi Saeki}, title = {Toward Structured Location of Features}, booktitle = {Proc.\ ICPC}, publisher = {IEEE}, pages = {254--255}, doi = {}, year = {2012}, } |
|
Okada, Satoshi |
ICPC '12-POSTERS: "Toward Structured Location ..."
Toward Structured Location of Features
Hiroshi Kazato, Shinpei Hayashi, Satoshi Okada, Shunsuke Miyata, Takashi Hoshino, and Motoshi Saeki (NTT, Japan; Tokyo Institute of Technology, Japan) This paper proposes structured location, a semiautomatic technique and its supporting tool both for locating features and exposing their structures in source code, using a combination of dynamic analysis, sequential pattern mining and formal concept analysis. @InProceedings{ICPC12p254, author = {Hiroshi Kazato and Shinpei Hayashi and Satoshi Okada and Shunsuke Miyata and Takashi Hoshino and Motoshi Saeki}, title = {Toward Structured Location of Features}, booktitle = {Proc.\ ICPC}, publisher = {IEEE}, pages = {254--255}, doi = {}, year = {2012}, } |
|
Ossher, Joel |
ICPC '12-POSTERS: "Parallel Code Clone Detection ..."
Parallel Code Clone Detection Using MapReduce
Hitesh Sajnani, Joel Ossher, and Cristina Lopes (UC Irvine, USA) Code clone detection is an established topic in software engineering research. Many detection algorithms have been proposed and refined but very few exploit the inherent parallelism present in the problem, making large scale code clone detection difficult. To alleviate this shortcoming, we present a new technique to efficiently perform clone detection using the popular MapReduce paradigm. Preliminary experimental results demonstrates speed-up and scale-up of the proposed approach. @InProceedings{ICPC12p260, author = {Hitesh Sajnani and Joel Ossher and Cristina Lopes}, title = {Parallel Code Clone Detection Using MapReduce}, booktitle = {Proc.\ ICPC}, publisher = {IEEE}, pages = {260--261}, doi = {}, year = {2012}, } |
|
Saeki, Motoshi |
ICPC '12-POSTERS: "Toward Structured Location ..."
Toward Structured Location of Features
Hiroshi Kazato, Shinpei Hayashi, Satoshi Okada, Shunsuke Miyata, Takashi Hoshino, and Motoshi Saeki (NTT, Japan; Tokyo Institute of Technology, Japan) This paper proposes structured location, a semiautomatic technique and its supporting tool both for locating features and exposing their structures in source code, using a combination of dynamic analysis, sequential pattern mining and formal concept analysis. @InProceedings{ICPC12p254, author = {Hiroshi Kazato and Shinpei Hayashi and Satoshi Okada and Shunsuke Miyata and Takashi Hoshino and Motoshi Saeki}, title = {Toward Structured Location of Features}, booktitle = {Proc.\ ICPC}, publisher = {IEEE}, pages = {254--255}, doi = {}, year = {2012}, } |
|
Sajnani, Hitesh |
ICPC '12-POSTERS: "Parallel Code Clone Detection ..."
Parallel Code Clone Detection Using MapReduce
Hitesh Sajnani, Joel Ossher, and Cristina Lopes (UC Irvine, USA) Code clone detection is an established topic in software engineering research. Many detection algorithms have been proposed and refined but very few exploit the inherent parallelism present in the problem, making large scale code clone detection difficult. To alleviate this shortcoming, we present a new technique to efficiently perform clone detection using the popular MapReduce paradigm. Preliminary experimental results demonstrates speed-up and scale-up of the proposed approach. @InProceedings{ICPC12p260, author = {Hitesh Sajnani and Joel Ossher and Cristina Lopes}, title = {Parallel Code Clone Detection Using MapReduce}, booktitle = {Proc.\ ICPC}, publisher = {IEEE}, pages = {260--261}, doi = {}, year = {2012}, } |
|
Tenev, Vasil L. |
ICPC '12-POSTERS: "Applying Bioinformatics in ..."
Applying Bioinformatics in the Analysis of Software Variants
Vasil L. Tenev and Slawomir Duszynski (Fraunhofer IESE, Germany) Analysis of software similarity is a lively research topic, particularly in the context of software maintenance and software reuse. There exist several approaches to detecting similar code inside one software system and across many systems. While working on similarity analysis of software variants, we observed many analogies between the approaches for analyzing evolution of software and of biological organisms. Hence, we applied bioinformatics concepts used in genome similarity analysis, such as alignments and phylogenetic trees, to software variants. We present the usefulness of these concepts by applying them to a group of related systems from the BSD Unix family. @InProceedings{ICPC12p258, author = {Vasil L. Tenev and Slawomir Duszynski}, title = {Applying Bioinformatics in the Analysis of Software Variants}, booktitle = {Proc.\ ICPC}, publisher = {IEEE}, pages = {258--259}, doi = {}, year = {2012}, } |
|
Zhang, Bo |
ICPC '12-POSTERS: "Extraction and Improvement ..."
Extraction and Improvement of Conditionally Compiled Product Line Code
Bo Zhang (University of Kaiserslautern, Germany) Conditional Compilation (CC) is one of the most widely used variation mechanisms in the development of software product lines (SPLs). However, a problem in SPL maintenance is that conditionally compiled code blocks are often overly scattered, nested, and tangled, which makes the code difficult to understand. Moreover, if variant code is evolved independently of the corresponding variability model, there is a risk that the two may become inconsistent. As a countermeasure, this paper proposes a maintenance process, consisting of variability extraction, error detection, and refactoring, to improve the quality of product line implementation. @InProceedings{ICPC12p256, author = {Bo Zhang}, title = {Extraction and Improvement of Conditionally Compiled Product Line Code}, booktitle = {Proc.\ ICPC}, publisher = {IEEE}, pages = {256--257}, doi = {}, year = {2012}, } |
12 authors
proc time: 0.22