The concept of program equilibrium, introduced by Howard (Theory and Decision 24(3):203–213, 1988) and further formalised by Tennenholtz (Game Econ Behav 49:363–373, 2004), represents one of the most ingenious and potentially farreaching applications of ideas from computer science in game theory to date. The basic idea is that a player in a game selects a strategy by entering a program, whose b...

Congress has established a national goal of achieving net-zero energy buildings by 2030. 1 Approximately 84% of the life cycle energy use of a building is associated with operating the building rather than the materials and energy used for construction. 2 This program will provide the measurement science to realize energy efficient building operation through integrated cybernetic building syste...

Title of dissertation: SATISFIABILITY-BASED PROGRAM REASONING AND PROGRAM SYNTHESIS Saurabh Srivastava, Doctor of Philosophy, 2010 Dissertation directed by: Professor Jeffrey S. Foster Department of Computer Science Program reasoning consists of the tasks of automatically and statically verifying correctness and inferring properties of programs. Program synthesis is the task of automatically ge...

Many intermediate program representations are used by compilers and other software development tools. In this paper, we propose a novel representation technique that, unlike those commonly used by compilers, has been explicitly designed for facilitating program element matching, a task at the heart of many software mining problems.

At the beginning stage of programming education, comprehending program logics plays a more important role than capturing knowledge of a specific program language. In this paper, the authors describe an outline of a visualization tool that animates the actions of a program by adding simple annotations to the variables defined in a program, and show several ideas to improve the usability of this ...

In this paper, we identify a fragment of second-order logic with restricted quantification that is expressive enough to capture numerous static analysis problems (e.g. safety proving, bug finding, termination and non-termination proving, superoptimisation). We call this fragment the synthesis fragment. Satisfiability of a formula in the synthesis fragment is decidable over finite domains; speci...

INTRODUCTION Receptiveness to change is one of the most important attributes of a programming system. There are obvious advantages associated with being responsive to changes in a system's environment without being required to essentially redesign the system. These environmental changes may take the form of variations in the functions to be performed by the system or in the applications to whic...