서브메뉴
검색
Type-Directed Program Synthesis for Complex APIs
Type-Directed Program Synthesis for Complex APIs
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20250211151512
- ISBN
- 9798383196489
- DDC
- 004
- 저자명
- Guo, Zheng.
- 서명/저자
- Type-Directed Program Synthesis for Complex APIs
- 발행사항
- [Sl] : University of California, San Diego, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 155 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 86-01, Section: A.
- 주기사항
- Advisor: Polikarpova, Nadia.
- 학위논문주기
- Thesis (Ph.D.)--University of California, San Diego, 2024.
- 초록/해제
- 요약As software systems grow sophisticated, complex APIs are widely used to accelerate program development. However, effectively using these APIs can be challenging due to poor documentation that fails to sufficiently explain API behaviors. This issue highlights the necessity for automating the combination of APIs into programs that satisfy given high-level specifications, thereby reducing the burden on engineers.This dissertation proposes to use type-directed program synthesis as a method for automating API navigation. In this process, the synthesizer must systematically search through APIs to construct programs that adhere strictly to the provided specifications. This task presents two primary challenges: the effective representation of these specifications and the efficient propagation of relevant information during search. To overcome these challenges, type-directed synthesis leverages compact, type-represented search spaces that enhance the propagation of type information throughout the search process. Although traditional type systems facilitate compact search space representation, they are often too coarse-grained to express user intent precisely. To address this, a semantic type system is introduced to express more advanced constraints on function signatures, effectively ruling out programs that deviate from conventional human-written code.This dissertation provides a comprehensive analysis of type-directed program synthesis, emphasizing its advantages in handling complex API-driven environments. Through theoretical frameworks and empirical studies, it shows that type-directed synthesis techniques can solve real-world programming tasks within a reasonable time limit. The experimental results demonstrate that the developed synthesis tools significantly improve the feasibility and accuracy of synthesized programs, contributing to more efficient and reliable software development.
- 일반주제명
- Computer science
- 일반주제명
- Computer engineering
- 일반주제명
- Information science
- 키워드
- Type systems
- 키워드
- Software systems
- 기타저자
- University of California, San Diego Computer Science and Engineering
- 기본자료저록
- Dissertations Abstracts International. 86-01A.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008250123s2024 us c eng d■001000017161996
■00520250211151512
■006m o d
■007cr#unu||||||||
■020 ▼a9798383196489
■035 ▼a(MiAaPQ)AAI31299963
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aGuo, Zheng.
■24510▼aType-Directed Program Synthesis for Complex APIs
■260 ▼a[Sl]▼bUniversity of California, San Diego▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a155 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 86-01, Section: A.
■500 ▼aAdvisor: Polikarpova, Nadia.
■5021 ▼aThesis (Ph.D.)--University of California, San Diego, 2024.
■520 ▼aAs software systems grow sophisticated, complex APIs are widely used to accelerate program development. However, effectively using these APIs can be challenging due to poor documentation that fails to sufficiently explain API behaviors. This issue highlights the necessity for automating the combination of APIs into programs that satisfy given high-level specifications, thereby reducing the burden on engineers.This dissertation proposes to use type-directed program synthesis as a method for automating API navigation. In this process, the synthesizer must systematically search through APIs to construct programs that adhere strictly to the provided specifications. This task presents two primary challenges: the effective representation of these specifications and the efficient propagation of relevant information during search. To overcome these challenges, type-directed synthesis leverages compact, type-represented search spaces that enhance the propagation of type information throughout the search process. Although traditional type systems facilitate compact search space representation, they are often too coarse-grained to express user intent precisely. To address this, a semantic type system is introduced to express more advanced constraints on function signatures, effectively ruling out programs that deviate from conventional human-written code.This dissertation provides a comprehensive analysis of type-directed program synthesis, emphasizing its advantages in handling complex API-driven environments. Through theoretical frameworks and empirical studies, it shows that type-directed synthesis techniques can solve real-world programming tasks within a reasonable time limit. The experimental results demonstrate that the developed synthesis tools significantly improve the feasibility and accuracy of synthesized programs, contributing to more efficient and reliable software development.
■590 ▼aSchool code: 0033.
■650 4▼aComputer science
■650 4▼aComputer engineering
■650 4▼aInformation science
■653 ▼aProgram synthesis
■653 ▼aType systems
■653 ▼aSoftware systems
■653 ▼aHuman-written code
■690 ▼a0984
■690 ▼a0464
■690 ▼a0723
■71020▼aUniversity of California, San Diego▼bComputer Science and Engineering.
■7730 ▼tDissertations Abstracts International▼g86-01A.
■790 ▼a0033
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17161996▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
