Restructuring of COBOL/CICS Legacy Systems (2008)
Alex Sellink, Harry Sneed, Chris Verhoef
We provide a strategy to restructure transaction processing systems. Such systems are core assets of most modern business operations, so their enhancement is crucial. Before large-scale renovation of...
Generation of Components for Software Renovation Factories from Context-free Grammars (2008)
We present an approach for the generation of components for a software renovation factory. These components are generated from a context-free grammar definition that recognizes the code that has to...
Towards Automated Modification of Legacy Assets (2007)
In this paper we argue that there is a necessity for automating modifications to legacy assets. We propose a five layered process for the introduction and employment of tool support that enables...
Formalising LPOs and Invariants in Coq (2007)
In the setting of ¯CRL, the notions of `linear process operator (LPO)' and `invariant' are implemented in Coq, which is a a proof development tool based on type theory. As a first...
Obtaining a COBOL Grammar from Legacy Code for Reengineering Purposes (2007)
We argue that maintenance and reengineering tools need to have a thorough knowledge of the language that the code is written in. More specifically, for the family of COBOL languages we present a...
A Two-phase Process for Software Architecture Improvement Ren'e Krikhaar (2007)
Alex Sellink, Marc Stroucken, Chris Verhoef
Software architecture is important for large systems in which it is the main means for, among other things, controlling complexity. Current ideas on software architectures were not available more...
Control Flow Normalization for COBOL/CICS Legacy Systems (2007)
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...
Generation of Components for Software Renovation Factories from Context-free Grammars (2007)
We present an approach for the generation of components for a software renovation factory. These components are generated from a context-free grammar definition that recognizes the code that has to...
Example Verifications Using Alphabet Axioms (2007)
Abstract. This paper is a paper supplementary to [KS98]. It illustrates by means of examples the use of alphabet axioms as presented in [KS98]. Furthermore a brief overview of CRL [GP94] and its...
Scaffolding for Software Renovation (2000)
We discuss an approach that explores the use of scaffolding of source code to facilitate its renovation. We show that scaffolding is a useful paradigm for software renovation. We designed syntax and...
An Architecture for Automated Software Maintenance (1999)
We developed an assembly line to implement certain specific changes in a stockbroking system written in COBOL with embedded SQL. The changes were proposed by the maintenance team of the system. Using...
Restructuring of COBOL/CICS Legacy Systems (1999)
Alex Sellink, Harry Sneed, Chris Verhoef
We provide a strategy to restructure transaction processing systems. Such systems are core assets of most modern business operations, so their enhancement is crucial. Before large-scale renovation of...
Generation of software renovation factories from compilers (1999)
When a compiler is designed carefully, it is possible to extract its grammar. We reengineer the extracted grammar to one that is geared towards reengineering. From this reengineering grammar we...
We generate a native pattern language from a context-free grammar. So if we have the underlying grammar of code that needs to be analyzed, or renovated the pattern language comes for free. We use...
Development, Assessment, and Reengineering of Language Descriptions (1998)
We discuss tools that aid in the development, the assessment and the reengineering of language descriptions. The assessment tools give an indication as to what is wrong with an existing language...
We generate a native pattern language from a context-free grammar. So if we have the underlying grammar of code that needs to be analyzed, or renovated the pattern language comes for free. We use...
Development, Assessment, and Reengineering of Language Descriptions (1998)
We discuss tools that aid in the development, the assessment and the reengineering of language descriptions. Languages description is understood as the syntactical description of a language here. We...
Current parsing techniques in software renovation considered harmful (1998)
We evaluate the parsing technology used by people working in the reengineering industry. We discuss parser generators and complete systems like Yacc, TXL, TAMPR, REFINE, CobolTransformer, COSMOS, and...
Current parsing techniques in software renovation considered harmful (1998)
Abstract We evaluate the parsing technology used by people working in the reengineering industry. We discuss parser generators and complete systems like Yacc, TXL, TAMPR, REFINE, CobolTransformer,...
Reflections on the evolution of COBOL (1997)
Newbie language designer error #17: Overgeneralizing from experience with natural languages. English makes a terrible programming language. We are interested in the evolution of COBOL software...
Validating year 2000 compliance (1997)
A. Van Deursen, P. Klint, A. Sellink, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Validating year 2000 compliance (1997)
A. Van Deursen, P. Klint, A. Sellink, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Reengineering COBOL software implies specification of the underlying dialects (1997)
Working-storage Section, Hdrisornmjrqrrujjj Pic, Alex Sellink, Alex Sellink, Chris Verhoef, ...
We argue that maintenance and reengineering tools need to have a thorough knowledge of the language that the code is written in. More specifically, for the family of COBOL languages we present a...
Alex Sellink, Alex Sellink, Henri Korver, Henri Korver, Henri Korver, ...
In the process-algebraic verification of systems with three or more components put in parallel, alphabet axioms are considered to be useful. These are rules that exploit the information about the...
Generation of Components for Software Renovation Factories from Context-free Grammars (1997)
Alex Sellink, Alex Sellink, Chris Verhoef, Chris Verhoef, ...
Syntax Tree Transform Parse Unparse Code Generation of Components for Software Renovation Factories from Context-free Grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June...
Control Flow Normalization for COBOL/CICS Legacy Systems (1997)
Alex Sellink, Alex Sellink, Chris Verhoef, Chris Verhoef, ...
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...
An Arithmetical Module for Rationals and Reals (1997)
Alex Sellink, Alex Sellink, Jan Bergstra
This paper is a sequel to our earlier paper [BS96]. We continue our project to develop a family of data type specifications starting from elementary principles and in a setting of four-valued logic....
Validating Year 2000 Compliance (1997)
Arie Van Deursen, Paul Klint, Alex Sellink
Validating year 2000 compliance involves the assessment of the correctness and quality of a year 2000 conversion. This entails inspecting both the quality of the conversion process followed, and of...
Validating year 2000 compliance (1997)
A. Van Deursen, P. Klint, A. Sellink, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Sequential Data Algebra Primitives (1996)
this paper is to develop a family of data type specifications and a particular method for writing such specifications based on the four valued logic of [BBR95]. The method is an informal one cast in...
Sequential Data Algebra Primitives (1996)
this paper is to develop a family of data type specifications and a particular method for writing such specifications based on the four valued logic of [BBR95]. The method is an informal one cast in...
Sequential Data Algebra Primitives (1996)
this paper is to develop a family of data type specifications and a particular method for writing such specifications based on the four-valued logic of [BBR95]. The method is an informal one cast in...
On Automating Process Algebra Proofs (1996)
In [10] Groote and Springintveld incorporated several model-oriented techniques -- such as invariants, matching criteria, state mappings -- in the process-algebraic framework of ¯CRL for structuring...