performance data down to the procedure and statement level. Paradyn is based on a dynamic notion of performance instrumentation and measurement. Unmodified executable files are placed into execution and then performance instrumentation is inserted into the application program and modified during execution

is conveyed to the anterior cingulate cortex via the mesencephalic dopamine system and that this signal is used by the anterior cingulate cortex to modify performance on the task at hand. They provide support for this proposal using both computational modeling and psychophysiological experimentation. Human

Specification matching is a way to compare two software components based on descriptions of the components' behaviors. In the context of software reuse and library retrieval, it can help determine whether one component can be substituted for another or how one can be modified to fit

INTRODUCTION Reuse of products, processes and experience originating from the system life cycle is seen today as a feasible solution to the problem of developing higher quality systems at a lower cost. In fact, quality improvement is very often achieved by reusing and modifying over and over

Program slicing, introduced by Weiser, is known to help programmers in understanding foreign code and in debugging. We apply program slicing to the maintenance problem by extending the notion of a program slice (that originally required both a variable and line number) to a decomposition slice

Abstract. The main result of this paper is a partial answer to [7, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give some results concerning cardinal characteristics of the σ

Abstract. We introduce more properties of forcing notions which imply that their λ–support iterations are λ–proper, where λ is an inaccessible cardinal. This paper is a direct continuation of Ros̷lanowski and Shelah [6, §A.2]. As an application of our iteration result we show that it is consistent

Starting from the idea of cue abstraction, the notion of imprint forma-tion has been hypothesized as being operational in listening to music. This notion is close to the concept of prototype put forth in the late 1960s in categorization research, that is, a set of prominent properties showing

Generic sets, like random sets, have proved useful in providing a coherent picture of relativized computation. Unfortunately, they are not decidable. Lutz [Lut87, Lut89, Lut90] has studied the notions of resource-bounded measure and category, and has shown that there are decidable sets similar

In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules is used to express preferences. We show how this ordering can be used