Automatic implementation generation for pervasive applications

Pervasive computing promises to put computers in almost every corner of our life. Unfortunately, it also promises to make programmers’ jobs harder since they cannot know what components are available in the run-time environment and as such, cannot statically plan out their programs. To help this situation, we propose goal-oriented programming, which may be more amenable to programming pervasive applications. Goal-oriented programming adds a level of indirection between Goals, high-level intentions such as “make me available for chat,” and Techniques, the code that implements the intentions. Each Technique is a combination of code and prerequisite subgoals, so that a Technique can be itself goal-oriented. By decomposing an application this way, it is possible to automatically build parts of it based on the runtime environment. When an application would like a Goal satisfied, the implementation Planner first finds Techniques that can satisfy the Goal, and then recurses to satisfy the Techniques’ subgoals. After a sufficient number of Techniques are found, the Planner evaluates the Techniques in some user-defined way, and chooses a set to execute. This work focuses on programming framework that isolates the planning aspect of goal-oriented programming from the Goals and Techniques themselves. We provide a reference Planner and evaluate its how well the Planner performs in simulation. Thesis Supervisor: Steve Ward Title: Professor