Conservative extension in positive/negative conditional term rewriting with applications to software renovation factories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1577, Issue , 1999, Pages 98-114

  Fokkink, Wan ^a   Verhoef, Chris ^b  

^a SWANSEA UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DATA TYPES; INDUSTRIAL PLANTS; SEMANTICS;

CONDITIONAL TERM REWRITING; CONSERVATIVE EXTENSIONS; MODULAR SPECIFICATIONS; POSITIVE/NEGATIVE; SOFTWARE RENOVATION; STRUCTURAL OPERATIONAL SEMANTICS;

APPLICATION PROGRAMS;

EID: 84947938608     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49020-3_7     Document Type: Conference Paper

References (44)

1. ANSI X3.23–1985. Programming Language – COBOL. American National Standards Institute, Inc, 1985.
2. J.W. Backus. The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM conference. In Proceedings ICIP, pp. 125–131. Unesco, Paris, 1960.
3. J. Baeten and C. Verhoef. A congruence theorem for structured operational semantics with predicates. In Proc. CONCUR’93, LNCS 715, pp. 477–492. Springer, 1993.
4. J. Baeten, J. Bergstra, J.W. Klop, and P. Weijland. Term-rewriting systems with rule priorities. Theoretical Computer Science, 67(2/3):283–301, 1989.
5. J. Bergstra, J. Heering, and P. Klint, editors. Algebraic Specification. ACM Press/Addison Wesley, 1989.
6. J. Bergstra, J. Heering, and P. Klint. Module algebra. Journal of the ACM, 37(2):335–372, 1990.
7. J. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control, 60(1/3), 1984.
8. J. Bergstra and J.W. Klop. Conditional rewrite rules: confluence and termination. Journal of Computer and System Sciences, 32(3):323–362, 1986.
9. R. Bol and J.F. Groote. The meaning of negative premises in transition system specifications. Journal of the ACM, 43(5):863–914, 1996.
10. M. van den Brand, P. Klint, and C. Verhoef. Reverse engineering and system renovation – an annotated bibliography. ACM SEN, 22(1):57–68, 1997.
11. M. van den Brand, A. Sellink, and C. Verhoef. Generation of components for software renovation factories from context-free grammars. In Proc. 4th Working Conference on Reverse Engineering, pp. 144–155, 1997.
12. M. van den Brand, A. Sellink, and C. Verhoef. Obtaining a COBOL grammar from legacy code for reengineering purposes. In Proc. 2nd Workshop on the Theory and Practice of Algebraic Specifications, 1997. Workshops in Computing, Springer, Available at http://www.springer.co.uk/ewic/workshops/.
13. M. van den Brand, A. Sellink, and C. Verhoef. Control flow normalization for COBOL/CICS legacy systems. In Proc. 2nd Euromicro Conference on Software Maintenance and Reengineering, pp. 11–19. IEEE Computer Society Press, 1998.
14. P. D’Argenio and C. Verhoef. A general conservative extension theorem in process algebras with inequalities. Theoretical Computer Science, 177:351–380, 1997.
15. N. Dershowitz, M. Okada, and G. Shivkumar. Confluence of conditional rewrite systems. In Proc. CTRS’87, LNCS 308, pp. 31–44. Springer, 1987.
16. A. van Deursen, P. Klint, and C. Verhoef. Research issues in renovation of legacy software. In this volume, 1999.
17. W. Fokkink and R. van Glabbeek. Ntyft/ntyxt rules reduce to ntree rules. Information and Computation, 126(1):1–10, 1996.
18. W. Fokkink and C. Verhoef. A conservative look at term deduction systems with variable binding. Report 95-28, Eindhoven University of Technology, 1995.
19. W. Fokkink and C. Verhoef. An SOS message: conservative extension for higherorder positive/negative conditional term rewriting. Report P9715, University of Amsterdam, 1997.
20. W. Fokkink and C. Verhoef. A conservative look at operational semantics with variable binding. Information and Computation, 146(1):24–54, 1998.
21. H. Ganzinger and U. Waldmann. Termination proofs of well-moded logic programs via conditional rewrite systems. In Proc. CTRS’92, LNCS 656, pp. 430–437. Springer, 1993.
22. A. van Gelder, K. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991.
23. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. Logic Programming Conference, pp. 1070–1080. MIT Press, 1988.
24. R. van Glabbeek. The meaning of negative premises in transition system specifications II. In Proc. ICALP’96, LNCS 1099, pp. 502–513. Springer, 1996.
25. J. Goguen. Personal Communication, January 1993.
26. B. Gramlich. Sufficient conditions for modular termination of conditional term rewriting systems. In Proc. CTRS’93, LNCS 656, pp. 128–142. Springer, 1993.
27. B. Gramlich. Generalized sufficient conditions for modular termination of rewriting. Applicable Algebra in Engin., Communic. and Comput., 5:131–158, 1994.
28. J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202–260, 1992.
29. P. Hartel. LATOS – a lightweight animation tool for operational semantics. Report DSSE-TR-97-1, University of Southampton, 1997.
30. S. Kaplan. Conditional rewrite rules. TCS, 33(2):175–193, 1984.
31. S. Kaplan. Positive/negative conditional rewriting. In Proc. CTRS’87, LNCS 308, pp. 129–143. Springer, 1987.
32. K. Meinke and J. Tucker. Universal algebra. In Handbook of Logic for Computer Science, Volume I, pp. 189–411. Oxford University Press, 1993.
33. A. Middeldorp. Modular properties of conditional term rewriting systems. Information and Computation, 104(1):110–158, 1993.
34. E. Ohlebusch. On the modularity of termination of term rewriting systems. Theoretical Computer Science, 136(2):333–360, 1994.
35. G. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Aarhus University, 1981.
36. J. van de Pol. Operational semantics of rewriting with priorities. Theoretical Computer Science, 200(1/2):289–312, 1998.
37. T. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, 13(4):445–463, 1990.
38. A. Sellink, H. Sneed, and C. Verhoef. Restructuring of COBOL/CICS legacy systems. In Proceedings 3rd European Conference on Maintenance and Reengineering. IEEE Computer Society Press, 1999.
39. A. Sellink and C. Verhoef. Native patterns. In Proc. 5th Working Conference on Reverse Engineering, pp. 89–103. IEEE Computer Society Press, 1998.
40. Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM, 34(1):128–143, 1987.
41. Y. Toyama. Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters, 25(3):141–143, 1987.
42. Y. Toyama, J.W. Klop, and H. Barendregt. Termination for direct sums of leftlinear complete term rewriting systems. Journal of the ACM, 34(1):128–143, 1987.
43. C. Verhoef. A general conservative extension theorem in process algebra. In Proc. PROCOMET’94, IFIP Transactions A-56, pp. 149–168. Elsevier, 1994.
44. C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing, 2(2):274–302, 1995.