This document outlines progress to date on the run-time type-checking project funded in part by IBM. The project has been carried out during the last year by Alexey Loginov and Suan Yong, under the supervision of Professors Susan Horwitz and Thomas Reps. The goal of the project is the design and implementation of a debugging tool based on dynamic type checking. The major accomplishment during t...

In this system demonstration we present a tool for the verification of Logic Programs w.r.t. type information specifications. The tool is based on sufficient verification conditions obtained by abstract interpretation. Following the theoretical foundation in [2,4,3], the tool is obtained by transforming a static analyzer on a type domain for Logic Programs designed by Codish and Lagoon [1].

The integration of software tools used in an engineering process is a problem that arises frequently in large-scale engineering projects. Traditional approaches are insufficient for complex engineering tools and processes. The solution must also account for the evolution of the system, as tools and processes change over time. This paper shows a new approach to the problem, describes the support...

Statically-typed languages offer type systems that are less and less comprehensible for programmers as the language grows in complexity. In this paper, we present a type debugger, a tool that enables analysis of type-related problems as well as exploration of the typechecking process in general. We explain our findings on implementing a lightweight instrumentation mechanism for SCALA, as well a...

the diabetes is an autoimmune disease, in which the role of autoantibodies is of a specific importance. the appearance of these autoantibodies can be the first symptom in the serum of type i diabetic patients, which may appear ten years before onset of the disease. the most important autoantibodies include glutamic acid decarboxylase autoantibodies (gad65-ab). this can be used as a good tool fo...

We present the implementation of a type inference algorithm for untyped object-oriented programs with inheritance, assignments, and late binding. The algorithm signiicantly improves our previous one, presented at OOPSLA'91, since it can handle collection classes, such as List, in a useful way. Also, the complexity has been dramatically improved, from exponential time to low polynomial time. The...