Formal Program running time verification is an important issue in system design required for performance optimization under „first-time-right“ design constraints and for real-time system verification. Simulation based approaches or simple instruction counting are not appropriate and risky for more complex architectures in particular with data dependent execution paths. Formal analysis technique...

Program partitioning is a task of splitting a large, complex software system into functionally independent program modules. It is a key step in program understanding, software maintenance and software reuse. Traditional program partitioning methods are nonlinear. In most cases, the computational efforts needed for partitioning a source program will increase exponentially with the size of the so...

Interpretation Based Program Testing

The Ergo Attribute System was designed to satisfy the requirements for attributes in a languagegeneric program derivation environment. It consists of three components: (1) an abstract data type of attributes that guarantees attribute consistency, (2) a Common Lisp implementation which combines demand-driven and incremental attribute evaluation in a novel way while allowing for attribute persist...

Software agents \live" in changing environments. Perception and actions of agents need to adapt dynamically to new situations. This paper is concerned with meta-agent protocols, an approach to support the modular and portable implementation of various kinds of agent systems. Meta-agent protocols are derived from object-based reeective systems that allow access to the state and structure of a pr...

Justification is to give evidence, in terms of a proof, for the truth value of the result generated by query evaluation of a logic program. In an earlier work we presented algorithms for justifying logic programs. It was based on using tabling for evaluating the program and post-processing the memo tables created during evaluation. Justification built in this fashion does not compromise the per...

viii

Refinement-Based Program Analysis Tools by Manu Sridharan Doctor of Philosophy in Computer Science University of California, Berkeley Professor Rastislav Bodík, Chair Program analysis tools are starting to change how software is developed. Verifiers can now eliminate certain complex bugs in large code bases, and automatic refactoring tools can greatly simplify code cleanup. Nevertheless, writin...