Control flow normalization for COBOL/CICS legacy systems

We propose a practical incremental approach to perform control flow normalization of COBOL/CICS legacy systems using a software renovation factory. The normalization improves the maintainability of such systems. A consequence of our normalization is that we reengineer the interface so that such systems can be accessed via intranet or Internet. Moreover, the performance of such systems is improved. We applied our approach to a mortgage system written in COBOL and CICS.

[1]  Chris Verhoef,et al.  Generation of components for software renovation factories from context-free grammars , 1997, Proceedings of the Fourth Working Conference on Reverse Engineering.

[2]  Paul Klint,et al.  Core Technologies for System Renovation , 1996, SOFSEM.

[3]  J. Brunekreef,et al.  TransLog, an interactive tool for transformation of logic programs , 1995 .

[4]  M.P.A. Sellink.  Transforming an ASF+SDF Specification into a ToolBus Application , 1996 .

[5]  Eelco Visser.  A Family of Syntax Deenition Formalisms , 1995 .

[6]  Harry M. Sneed.  Program interface reengineering for wrapping , 1997, Proceedings of the Fourth Working Conference on Reverse Engineering.

[7]  Chris Verhoef,et al.  Reengineering COBOL Software Implies Specification of the Underlying Dialects , 1997 .

[8]  James M. Boyle,et al.  TRANSFORMATIONAL COMPONENT FOR PROGRAMMING LANGUAGE GRAMMAR. , 1970 .

[9]  T. B. Dinesh,et al.  Specifying Input and Output of Visual Languages , 1996 .

[10]  Pieter A. Olivier.  Debugging Distributed Applications Using a Coordination Architecture , 1997, COORDINATION.

[11]  Vincent Partington,et al.  Implementation of an Imperative Programming Language with Backtracking , 1997 .

[12]  Arie van Deursen,et al.  Industrial Applications of ASF+SDF , 1996, AMAST.

[13]  Paul Klint,et al.  The syntax definition formalism SDF—reference manual— , 1989, SIGP.

[14]  Alex Sellink,et al.  A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes , 1995, Formal Aspects of Computing.

[15]  Leon Moonen,et al.  A generic architecture for data flow analysis to support reverse engineering , 1997 .

[16]  James M. Boyle,et al.  Using knowledge-based transformations to reverse-engineer COBOL programs , 1996, Proceedings of the 11th Knowledge-Based Software Engineering Conference.

[17]  Chris Verhoef,et al.  Generation of components for software renovation factories from context-free grammars , 2000, Sci. Comput. Program..

[18]  Eelco Visser.  Solving type equations in multi-level specifications (preliminary version) , 1996 .

[19]  Paul Klint,et al.  A meta-environment for generating programming environments , 1989, TSEM.

[20]  Jan A. Bergstra,et al.  Grid protocols based on synchronous communication: specification and correctness , 1995 .

[21]  J. Rekers,et al.  Parser Generation for Interactive Environments , 1992 .

[22]  Matthew S. Hecht,et al.  Flow Analysis of Computer Programs , 1977 .

[23]  S. P. Luttik,et al.  Transformations of Reduction Systems , 1996 .

[24]  Jan A. Bergstra,et al.  Sequential data algebra primitives (revised version of P9602) , 1996 .

[25]  J. J. Brunekreef.  A transformation tool for pure Prolog programs: the algebraic specification , 1996 .

[26]  Eelco Visser,et al.  Generation of formatters for context-free languages , 1996, TSEM.

[27]  Bob Diertens.  Simulation and Animation of Process Algebra Specifications , 1997 .

[28]  Alex Sellink.  On the Conservativity of Leibniz Equality , 1998, Int. J. Found. Comput. Sci..

[29]  Stéphane Kaplan,et al.  Conditional Rewrite Rules , 1984, Theor. Comput. Sci..

[30]  P. I. Manuel,et al.  ANSI Cobol III in SDF + an ASF Definition of a Y2K Tool , 1996 .

[31]  P. Klint,et al.  Reverse engineering and system renovation—an annotated bibliography , 1997, SOEN.

[32]  Victor R. Basili,et al.  A reference architecture for the component factory , 1992, TSEM.

[33]  L.M.F. Moonen,et al.  Data Flow Analysis for Reverse Engineering , 1996 .

[34]  Jan A. Bergstra,et al.  Sequential data algebra primitives , 1996 .

[35]  P. A. Olivier,et al.  Embedded system simulation: testdriving the ToolBus , 1996 .

[36]  Paul Klint,et al.  Re-engineering needs generic programming language technology , 1997, SIGP.

[37]  Jan A. Bergstra,et al.  An Arithmetical Module for Rationals and Reals , 1997 .

[38]  Chris Verhoef,et al.  Current parsing techniques in software renovation considered harmful , 1998, Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242).

[39]  Chris Verhoef,et al.  A General Conservative Extension Theorem in Process Algebra , 1994, PROCOMET.

[40]  Zahira Ammarguellat,et al.  A Control-Flow Normalization Algorithm and Its Complexity , 1992, IEEE Trans. Software Eng..

[41]  Chris Verhoef,et al.  Obtaining a COBOL grammar from legacy code for reengineering purposes , 1997 .

[42]  E. Visser,et al.  Polymorphic Syntax Deenition , 1997 .

[43]  Paul Klint,et al.  Evolutionary software engineering: a component-based approach , 1998, Systems Implementation 2000.