2026-09-19T03:15:41Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/21384 2023-07-10 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Harandi, Mehdi T. Bhansali, Sanjay 2011-05-07T13:07:06Z 2011-05-07T13:07:06Z 10000-01-01 1991 In this thesis, I propose a domain-based, integrated framework for program synthesis that emphasizes the reuse of software components and past experience in solving problems. A crucial component of the framework is a concept dictionary that contains a description of domain related components. This forms a basis for communicating with a user in a high-level, application-oriented terms; for constructing generic, problem-solving rules, and for reasoning by analogy. The other components of the framework include a library of reusable subroutines, cliches, and derivation histories of previously solved problems, a layered rulebase, a hierarchical planner, and an analogical reasoner based on Carbonell's derivational analogy paradigm. The planner uses the rulebase and the library to decompose a given problem in a top-down manner and synthesize a plan for solving it. The layered structure of the rule-base ensures that efficient plans are preferred over inefficient ones, and the changes needed to synthesize programs for a different domain are minimal. The analogical reasoner complements the role of the planner. It uses a set of heuristics to retrieve a problem from the derivation history library that is analogous to a current problem, and replays the derivation of the retrieved problem to synthesize a program for the current problem. A solved problem is stored back into the derivation history library, and may be used to solve a different problem in a future context. A prototype system, APU, based on the above framework has been implemented for the domain of UNIX programming. We describe a set of experiments designed to test the performance of APU, and provide empirical results demonstrating the feasibility and usefulness of the approach. Made available in DSpace on 2011-05-07T13:07:06Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9136544.pdf: 6890368 bytes, checksum: e87b29a6acbd4fdacf00e587222cf90b (MD5) Previous issue date: 1991 Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:50:25Z Item is restricted indefinitely. Restriction data tranferred 2014-07-01T11:23:02-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission ETDs are only available to UIUC Users without author permission U of I Only AAI9136544 (UMI)AAI9136544 http://hdl.handle.net/2142/21384 eng Copyright 1991 Bhansali, Sanjay Computer Science Domain-based program synthesis using planning and derivational analogy text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.