MARC보기
LDR02314nam u200409 4500
001000000418213
00520190215162657
008181129s2018 |||||||||||||||||c||eng d
020 ▼a 9780438076242
035 ▼a (MiAaPQ)AAI10681033
035 ▼a (MiAaPQ)iastate:16992
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 247004
0820 ▼a 004
1001 ▼a Upadhyaya, Ganesha. ▼0 (orcid)0000-0003-0764-2578.
24510 ▼a Collective Program Analysis.
260 ▼a [S.l.]: ▼b Iowa State University., ▼c 2018.
260 1 ▼a Ann Arbor: ▼b ProQuest Dissertations & Theses, ▼c 2018.
300 ▼a 120 p.
500 ▼a Source: Dissertation Abstracts International, Volume: 79-11(E), Section: B.
500 ▼a Adviser: Hridesh Rajan.
5021 ▼a Thesis (Ph.D.)--Iowa State University, 2018.
520 ▼a Encouraged by the success of data-driven software engineering (SE) techniques that have found numerous applications e.g. in defect prediction, specification inference, etc, the demand for mining and analyzing source code repositories at scale ha
520 ▼a First, we describe the general concept of collective program analysis. Given a mining task that is required to be run on thousands of artifacts, the artifacts with similar interactions are clustered together, such that the mining task is require
520 ▼a Given a mining task and an artifact producing an interaction pattern graph soundly and efficiently can be very challenging. We propose a pre-analysis and program compaction technique to achieve this. Given a source code mining task and thousands
520 ▼a Upon producing interaction pattern graphs of thousands of artifacts, they have to be clustered and the mining task results have to be reused between similar artifacts to achieve acceleration. In the final part of this thesis, we fully describes
590 ▼a School code: 0097.
650 4 ▼a Computer science.
690 ▼a 0984
71020 ▼a Iowa State University. ▼b Computer Science.
7730 ▼t Dissertation Abstracts International ▼g 79-11B(E).
773 ▼t Dissertation Abstract International
790 ▼a 0097
791 ▼a Ph.D.
792 ▼a 2018
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T14996717 ▼n KERIS ▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다.
980 ▼a 201812 ▼f 2019
990 ▼a ***1012033