This research project is about reengineering object-oriented applications. Reengineering such applications inherits complex problems related to software maintenance, i.e., program understanding, program analysis, and program transformation and adds to them (1) the complexity introduced by late binding, dynamic typing, and incremental definition specific to object-oriented programming, and (2) t...

The goal of this paper is to demonstrate that inductive progrwn synthesis can be applied to learning macrooperators from planning experience. We define macros as recursive program schemes (RPSs). An RPS represents the complete subgoal structure of a given problem domain with arbitrary complexity (e. g., rocket transportation problem with n objects), that is, it represents domain specific contro...

Implicit Computational Complexity is a line of research where the possibility to inference a valid property for a program implies that the program runs in particular complexity class. Soft type systems are one of the research threads within the field. We present here a soft type system with ML-like polymorphism that enjoys decidable typechecking, type inference and typability problems and gives...

To achieve my goal, I developed a theory of musical features inspired by Ullman's Goldilocks theory for visual features. I implemented a computer program that analyzes instrumental (MIDI) versions of the songs to extract relevant parameters for my model. This program also identifies music pieces based on a melody contour of varying length and complexity. Finally I experimentally verified the hy...

The information content or complexity of an object can be measured by the length of its shortest description. For instance the string ‘01010101010101010101010101010101’ has the short description “16 repetitions of 01”, while ‘11001000011000011101111011101100’ presumably has no simpler description other than writing down the string itself. More formally, the Algorithmic “Kolmogorov” Complexity (...

Research at MSRI was supported in part by the Russian Fond of Fundamental Investigations grant N 96-01-847, by INTAS project 94-921, and by NSF grant DMS-9022140. We describe the theoretical background for a computer program that recognizes all closed orientable three-manifolds up to complexity 8. The program can treat also nonclosed threemanifolds and manifolds of greater complexity, but witho...

We have explored educational methods for algorithmic thinking for novices and implemented a block programming editor and a simple learning management system. In this paper, we propose a program/algorithm complexity metric specified for novice learners. This metric is based on the variable usage in arithmetic and relational formulas in learner’s algorithms. To evaluate the applicability of this ...

On the basis of analyzing the defects that traditional system dependence graph have, a novel method based on ripple effect is proposed to construct coarsegrained system dependence graph. The method perfects object-oriented program semantics and reduces the computation complexity through expanding the signification of coarse-grained and analyzing ripple effect. Objectoriented program semantics a...

We study the problem of finding a point in the relative interior of the optimal face of a linear program. We prove that in the worst case such a point can be obtained in O(n3L) arithmetic operations. This complexity is the same as the complexity for solving a linear program. We also show how to find such a point in practice. We report and discuss computational results obtained for the linear pr...

In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and extend that model of computation to support a formal complexity theory as well. This formalization brings to the foreground the concept of normal complexity me...