Restructuring of COBOL/CICS legacy systems

Sellink, A.; Sneed, Harry M.; Verhoef, C.

doi:10.1109/csmr.1999.756684

Cited by 28 publications

(30 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is the case indeed, since R 0 is deterministic, and each rewrite rule in R 1 contains a fresh function symbol from g_1-g_3 at the left-hand side of its conclusion. Such uniformization techniques are common practice in software renovation factories; see [13,38] for a factory approach where an elimination assembly line for an important class of legacy systems is implemented.…”

Section: Definition 10 a Software Renovation Factory Is A Set Of Sofmentioning

confidence: 99%

“…Our theorem has also been applied in [38], where incrementally an algorithm was developed for eliminating very difficult GO TO statements from COBOL/CICS programs from a Swiss Bank. The use of the theorem was that already developed patterns for eliminating GO TOs could safely be extended with new patterns without distroying the original functionality.…”

Section: Definition 10 a Software Renovation Factory Is A Set Of Sofmentioning

confidence: 99%

See 1 more Smart Citation

Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories

Fokkink

Verhoef

1999

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

Section: Definition 10 a Software Renovation Factory Is A Set Of Sofmentioning

confidence: 99%

Section: Definition 10 a Software Renovation Factory Is A Set Of Sofmentioning

confidence: 99%

Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories

Fokkink

Verhoef

1999

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…Most of the long-ago built information systems share one property; they are business-critical. Without them organizations cannot survive, yet their haphazard decades-long evolution makes them difficult objects in their own right [8,88,111]. Successful maintenance of these systems requires proper mitigation of risks entrenched inside technology.…”

Section: Management Informationmentioning

confidence: 99%

Recovering management information from source code

Kwiatkowski¹,

Verhoef²

2013

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

a b s t r a c t IT has become a production means for many organizations and an important element of business strategy. Even though its effective management is a must, reality shows that this area still remains in its infancy. IT management relies profoundly on relevant information which enables risk mitigation or cost control. However, the needed information is either missing or its gathering boils down to daunting tasks. We propose an approach to recovery of management information from the essence of IT; the software's source code. In this paper we show how to employ source code analysis techniques and recover management information. In our approach we exploit the potential of the concealed data which resides in the source code statements, source comments, and also compiler listings. We show how to depart from the raw sources, extract data, organize it, and eventually utilize so that the bit level data provides IT executives with support at the portfolio level. Our approach is pragmatic as we rely on real management questions, best practices in software engineering, and also IT market specifics. We enable, for instance, an assessment of the IT-portfolio market value, support for carrying out what-if scenarios, or identification and evaluation of the hidden risks for IT-portfolio maintainability. The study is based on a real-life ITportfolio which supports business functions of an organization operating in the financial sector. The IT-portfolio comprises Cobol applications run on a mainframe with the total number of lines of code amounting to over 18 million. The approach we propose is suited for facilitation within a large organization. It provides for a fact-based support for strategic decision making at the portfolio level.

show abstract

“…There is some borderline where proper parsing becomes mandatory. For example, goto elimination for Cobol [SSV02] involves a non-trivial fragment of the language syntax, and hence a lexical approach is impractical. However, in the view of the up-front investment for parsers, it is still common to employ a lexical or a mixed approach in practice.…”

Section: In Need Of Tolerancementioning

confidence: 99%

Deriving tolerant grammars from a base-line grammar

Klusener

Lämmel

International Conference on Software Maintenance, 2003. ICSM 2003. Proceedings.

View full text Add to dashboard Cite

C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a Software ENgineeringDeriving tolerant grammars from a base-line grammar Deriving tolerant grammars from a base-line grammar ABSTRACT A grammar-based approach to tool development in re-and reverse engineering promises precise structure awareness, but it is problematic in two respects. Firstly, it is a considerable upfront investment to obtain a grammar for a relevant language or cocktail of languages. Existing work on grammar recovery addresses this concern to some extent. Secondly, it is often not feasible to insist on a precise grammar, e.g., when different dialects need to be covered. This calls for tolerant grammars. In this paper, we provide a well-engineered approach to the derivation of tolerant grammars, which is based on previous work on error recovery, fuzzy parsing, and island grammars. The technology of this paper has been used in a complex Cobol restructuring project on several millions of lines of code in different Cobol dialects. Our approach is founded on an approximation relation between a tolerant grammar and a base-line grammar which serves as a point of reference. Thereby, we avoid false positives and false negatives when parsing constructs of interest in a tolerant mode. Our approach accomplishes the effective derivation of a tolerant grammar from the syntactical structure that is relevant for a certain re-or reverse engineering tool. To this end, the productions for the constructs of interest are reused from the base-line grammar together with further productions that are needed for completion. ACM Computing Classification

show abstract

Restructuring of COBOL/CICS legacy systems

Cited by 28 publications

References 14 publications

Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories

Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories

Recovering management information from source code

Deriving tolerant grammars from a base-line grammar

Contact Info

Product

Resources

About