Application of compiler technology to the year 2000 problem

Software - Practice and Experience

Volumn 29, Issue 4, 1999, Pages 359-377

  Nanda, Mangala Gowri ^a   Bhaduri, Purandar ^a   Oberoi, Sundeep ^a   Sanyal, Amitabha ^b  

^a Tata Infotech Limited   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CENTURY YEAR PROBLEM; COBOL (PROGRAMMING LANGUAGE); DATA FLOW ANALYSIS; PROGRAM DIAGNOSTICS; REENGINEERING;

LEGACY PROGRAMS; PARSING;

PROGRAM COMPILERS;

EID: 0032681017     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-024X(19990410)29:4<359::AID-SPE232>3.0.CO;2-H     Document Type: Article

References (23)

1. J. M. Hart and A. Pizzarello, 'Identifying date-sensitive items - The essential step', The Year 2000 Journal, (March/April 1997).
2. W. M. Ulrich and I. S. Hayes, 'Year/2000 tool selection criterion', The Year 2000 Journal, (March/April 1997).
3. J. M. Hart and A. Pizzarello, 'A scalable, automated process for year 2000 system correction', Proceedings of the 18th International Conference on Software Engineering, March 1996, pp. 475-484.
4. A. V. Aho, R. Sethi and J. D. Ullman, Compilers: Principles, Techniques and Tools, Addison-Wesley, 1986.
5. M. D. Lips, 'Field expansion, procedural workaround and bridging', The Year 2000 Journal, (July/August 1997).
6. M. D. Lips, 'Field expansion, procedural workaround and bridging - ii', The Year 2000 Journal, (September/October 1997).
7. R. B. Howard, 'The case for windowing: Techniques that buy 60 years', The Year 2000 Journal, (March/April 1998).
8. M. P. Harden, 'Expansion vs. windowing', The Year 2000 Journal, (November/December 1997).
9. J. M. Hart, 'Automated system correction: A critical step in year/2000 renovation', The Year 2000 Journal, (May/June 1998).
10. Unisys Corporation, A Series COBOL ANSI-74 Programming Reference Manual, 1985.
11. M. Kaplan and J. D. Ullman, 'A general scheme for the automatic inference of variable types', J. ACM, 27(1), 128-145 (September/October 1980).
12. J. P. Banning, 'An efficient way to find the side effects of procedure calls and aliases of variables', Conference Record of the 6th Annual ACM Symposium on Principles of Programming Languages (POPL '79), 1979, pp. 29-41.
13. H. Agrawal, R. A. DeMillo and E. H. Spafford, 'Dynamic slicing in the presence of unconstrained pointers', Proceedings of the Fourth Symposium on Testing, Analysis and Verification (TAV4). ACM/IEEE-CS, October 1991.
14. D. Binkley, 'Slicing in the presence of parameter aliasing', Proceedings of Software Engineering Research Forum, Orlando, FL, November 1993, pp. 261-268.
15. L. Moonen, 'Data flow analysis for reverse engineering', Technical Report 9613, University of Amsterdam, Programming research group, September 1996.
16. M. Sharir and A. Pnueli, 'Two approaches to interprocedural data flow analysis', in S. Muchnick and N. Jones (eds), Program Flow Analysis: Theory and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1981, pp. 189-234.
17. S. Horwitz, T. Reps and D. Binkley, 'Interprocedural slicing using dependence graphs', Proceedings of the 1988 ACM SIGPLAN Conference on Programming Language Design and Implementation, June 1988, pp. 35-46.
18. S. Horwitz, T. Reps and D. Binkley, 'Interprocedural slicing using dependence graphs', ACM Trans. Programming Languages and Systems, 12(1), 26-60 (January 1990).
19. D. Callahan, 'The program summary graph and flow-sensitive interprocedural data flow analysis', Proceedings of the 1988 ACM SIGPLAN Conference on Programming Language Design and Implementation, June 1988, pp. 47-56.
20. T. J. Marlowe and B. G. Ryder, 'Properties of data flow frameworks', Acta Informatica, 28, 121-163 ( 1990).
21. P. Cousot and R. Cousot, 'Systematic design of program analysis framework', Conference Record of the 6th Annual ACM Symposium on Principles of Programming Languages (POPL '79), San Antonio, TX, 1979, pp. 269-282.
22. P. Cousot and R. Cousot, 'Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints', Conference Record of the 4th ACM Symposium on Principles of Programming Languages, ACMSIGPLAN, January 1977, pp. 238-252.
23. Reasoning/2000 for COBOL, URL http://www.reasoning.com/r2000.html