Abstract
We transpose a conservative extension theorem from structural operational semantics to conditional term rewriting. The result is useful for the development of software renovation factories, and for modular specification of abstract data types.
Chapter PDF
References
ANSI X3.23–1985. Programming Language – COBOL. American National Standards Institute, Inc. (1985)
Backus, J.W.: The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM conference. In: Proceedings ICIP, Unesco, Paris pp. 125–131. (1960)
Baeten, J., Verhoef, C.: A congruence theorem for structured operational semantics with predicates. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 477–492. Springer, Heidelberg (1993)
Baeten, J., Bergstra, J., Klop, J.W., Weijland, P.: Term-rewriting systems with rule priorities. Theoretical Computer Science 67(2/3), 283–301 (1989)
Bergstra, J., Heering, J., Klint, P. (eds.): Algebraic Specification. ACM Press/Addison Wesley (1989)
Bergstra, J., Heering, J., Klint, P.: Module algebra. Journal of the ACM 37(2), 335–372 (1990)
Bergstra, J., Klop, J.W.: Process algebra for synchronous communication. Information and Control 60(1/3) (1984)
Bergstra, J., Klop, J.W.: Conditional rewrite rules: confluence and termination. Journal of Computer and System Sciences 32(3), 323–362 (1986)
Bol, R., Groote, J.F.: The meaning of negative premises in transition system specifications. Journal of the ACM 43(5), 863–914 (1996)
van den Brand, M., Klint, P., Verhoef, C.: Reverse engineering and system renovation – an annotated bibliography. ACM SEN 22(1), 57–68 (1997)
van den Brand, M., Sellink, A., Verhoef, C.: Generation of components for software renovation factories from context-free grammars. In: Proc. 4th Working Conference on Reverse Engineering, pp. 144–155 (1997)
van den Brand, M., Sellink, A., Verhoef, C.: Obtaining a COBOL grammar from legacy code for reengineering purposes. In: Proc. 2nd Workshop on the Theory and Practice of Algebraic Specifications Workshops in Computing. Springer, Heidelberg (1997), http://www.springer.co.uk/ewic/workshops/
van den Brand, M., Sellink, A., Verhoef, C.: 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, Los Alamitos (1998)
D’Argenio, P., Verhoef, C.: A general conservative extension theorem in process algebras with inequalities. Theoretical Computer Science 177, 351–380 (1997)
Dershowitz, N., Okada, M., Shivkumar, G.: Confluence of conditional rewrite systems. In: Kaplan, S., Jouannaud, J.-P. (eds.) CTRS 1987. LNCS, vol. 308, pp. 31–44. Springer, Heidelberg (1988)
van Deursen, A., Klint, P., Verhoef, C.: Research issues in the renovation of legacy systems. In: Finance, J.-P. (ed.) FASE 1999. LNCS, vol. 1577, pp. 1–23. Springer, Heidelberg (1999)
Fokkink, W., van Glabbeek, R.: Ntyft/ntyxt rules reduce to ntree rules. Information and Computation 126(1), 1–10 (1996)
Fokkink, W., Verhoef, C.: A conservative look at term deduction systems with variable binding. Report 95-28, Eindhoven University of Technology (1995)
Fokkink, W., Verhoef, C.: An SOS message: conservative extension for higherorder positive/negative conditional term rewriting. Report P9715, University of Amsterdam (1997)
Fokkink, W., Verhoef, C.: A conservative look at operational semantics with variable binding. Information and Computation 146(1), 24–54 (1998)
Ganzinger, H., Waldmann, U.: Termination proofs of well-moded logic programs via conditional rewrite systems. In: Rusinowitch, M., Remy, J.-L. (eds.) CTRS 1992. LNCS, vol. 656, pp. 430–437. Springer, Heidelberg (1993)
van Gelder, A., Ross, K., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. Logic Programming Conference, pp. 1070–1080. MIT Press, Cambridge (1988)
van Glabbeek, R.: The meaning of negative premises in transition system specifications II. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 502–513. Springer, Heidelberg (1996)
Goguen, J.: Personal Communication. (January 1993)
Gramlich, B.: Sufficient conditions for modular termination of conditional term rewriting systems. In: Rusinowitch, M., Remy, J.-L. (eds.) CTRS 1993. LNCS, vol. 656, pp. 128–142. Springer, Heidelberg (1993)
Gramlich, B.: Generalized sufficient conditions for modular termination of rewriting. Applicable Algebra in Engin., Communic. and Comput. 5, 131–158 (1994)
Groote, J.F., Vaandrager, F.: Structured operational semantics and bisimulation as a congruence. Information and Computation 100(2), 202–260 (1992)
Hartel, P.: LATOS – a lightweight animation tool for operational semantics. Report DSSE-TR-97-1, University of Southampton (1997)
Kaplan, S.: Conditional rewrite rules. TCS 33(2), 175–193 (1984)
Kaplan, S.: Positive/negative conditional rewriting. In: Kaplan, S., Jouannaud, J.-P. (eds.) CTRS 1987. LNCS, vol. 308, pp. 129–143. Springer, Heidelberg (1987)
Meinke, K., Tucker, J.: Universal algebra. In: Handbook of Logic for Computer Science, vol. I, pp. 189–411. Oxford University Press, Oxford (1993)
Middeldorp, A.: Modular properties of conditional term rewriting systems. Information and Computation 104(1), 110–158 (1993)
Ohlebusch, E.: On the modularity of termination of term rewriting systems. Theoretical Computer Science 136(2), 333–360 (1994)
Plotkin, G.: A structural approach to operational semantics. Report DAIMI FN-19, Aarhus University (1981)
van de Pol, J.: Operational semantics of rewriting with priorities. Theoretical Computer Science 200(1/2), 289–312 (1998)
Przymusinski, T.: The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae 13(4), 445–463 (1990)
Sellink, A., Sneed, H., Verhoef, C.: Restructuring of COBOL/CICS legacy systems. In: Proceedings 3rd European Conference on Maintenance and Reengineering. IEEE Computer Society Press, Los Alamitos (1999)
Sellink, A., Verhoef, C.: Native patterns. In: Proc. 5th Working Conference on Reverse Engineering, pp. 89–103. IEEE Computer Society Press, Los Alamitos (1998)
Toyama, Y.: On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM 34(1), 128–143 (1987)
Toyama, Y.: Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters 25(3), 141–143 (1987)
Toyama, Y., Klop, J.W., Barendregt, H.: Termination for direct sums of left linear complete term rewriting systems. Journal of the ACM 34(1), 128–143 (1987)
Verhoef, C.: A general conservative extension theorem in process algebra. In: Proc. PROCOMET 1994, IFIP Transactions A-56, pp. 149–168. Elsevier, Amsterdam (1994)
Verhoef, C.: A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing 2(2), 274–302 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fokkink, W., Verhoef, C. (1999). Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories. In: Finance, JP. (eds) Fundamental Approaches to Software Engineering. FASE 1999. Lecture Notes in Computer Science, vol 1577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49020-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-49020-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65718-7
Online ISBN: 978-3-540-49020-3
eBook Packages: Springer Book Archive