Type Inference for COBOL Systems

Types are a good starting point for various software reengineering tasks. Unfortunately, programs requiring reengineering most desperately are written in languages without an adequate type system (such as COBOL). To solve this problem, we propose a method of automated type inference for these languages. The main ingredients are that if variables are compared using some relational operator their types must be the same; likewise if an expression is assigned to a variable, the type of the expression must be a subtype of that of the variable. We present the formal type system and inference rules for this approach, show their effect on various real life COBOL fragments, describe the implementation of our ideas in a prototype type inference tool for COBOL, and discuss a number of applications.

• Type: Conference
• Year: 1998
• Where: WCRE
• Authors: Arie van Deursen, Leon Moonen
• Keywords: Prototype Type Inference, Software Engineering, Software Reengineering Tasks, Type Inference, WCRE 1998