An SOS Message: Conservative Extension in Higher Order Positive/Negative Conditional Term Rewriting

General theorems in structured operational semantics can be transformed into related results in conditional term rewriting. We apply this approach to obtain a conservative extension theorem for higher-order conditional term rewriting systems with negative conditions. This result is useful, for instance, in modular speciication of abstract data types, and in software renovation factories.

[1]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[2]  Paul Klint,et al.  Core Technologies for System Renovation , 1996, SOFSEM.

[3]  P. I. Manuel,et al.  ANSI Cobol III in SDF + an ASF Definition of a Y2K Tool , 1996 .

[4]  Bernhard Gramlich,et al.  Suucient Conditions for Modular Termination of Conditional Term Rewriting Systems , 1993 .

[5]  Jan A. Bergstra,et al.  Term-Rewriting Systems with Rule Priorities , 1989, Theor. Comput. Sci..

[6]  Eelco Visser.  Solving type equations in multi-level specifications (preliminary version) , 1996 .

[7]  Yoshihito Toyama,et al.  Counterexamples to Termination for the Direct Sum of Term Rewriting Systems , 1987, Inf. Process. Lett..

[8]  Wan Fokkink,et al.  Ntyft/Ntyxt Rules Reduce to Ntree Rules , 1996, Inf. Comput..

[9]  Alex Sellink.  On the Conservativity of Leibniz Equality , 1998, Int. J. Found. Comput. Sci..

[10]  Jan A. Bergstra,et al.  Sequential data algebra primitives (revised version of P9602) , 1996 .

[11]  Chris Verhoef,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises , 1994, Nord. J. Comput..

[12]  Chris Verhoef,et al.  Reengineering COBOL Software Implies Specification of the Underlying Dialects , 1997 .

[13]  Enno Ohlebusch,et al.  On the Modularity of Termination of Term Rewriting Systems , 1994, Theor. Comput. Sci..

[14]  Leon Moonen,et al.  A generic architecture for data flow analysis to support reverse engineering , 1997 .

[15]  P. Klint,et al.  Reverse engineering and system renovation—an annotated bibliography , 1997, SOEN.

[16]  Chris Verhoef,et al.  A General Conservative Extension Theorem in Process Algebra , 1994, PROCOMET.

[17]  Stéphane Kaplan,et al.  Conditional Rewrite Rules , 1984, Theor. Comput. Sci..

[18]  Pieter A. Olivier.  Debugging Distributed Applications Using a Coordination Architecture , 1997, COORDINATION.

[19]  M.P.A. Sellink.  Transforming an ASF+SDF Specification into a ToolBus Application , 1996 .

[20]  P. A. Olivier,et al.  Embedded system simulation: testdriving the ToolBus , 1996 .

[21]  Hendrik Pieter Barendregt,et al.  Termination for direct sums of left-linear complete term rewriting systems , 1995, JACM.

[22]  Editors , 1986, Brain Research Bulletin.

[23]  Rob J. van Glabbeek,et al.  The meaning of negative premises in transition system specifications II , 1996, J. Log. Algebraic Methods Program..

[24]  Paul Klint,et al.  Re-engineering needs generic programming language technology , 1997, SIGP.

[25]  Chris Verhoef,et al.  Control flow normalization for COBOL/CICS legacy systems , 1998, Proceedings of the Second Euromicro Conference on Software Maintenance and Reengineering.

[26]  T. B. Dinesh,et al.  Specifying Input and Output of Visual Languages , 1996 .

[27]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[28]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[29]  Jan A. Bergstra,et al.  Conditional Rewrite Rules: Confluence and Termination , 1986, J. Comput. Syst. Sci..

[30]  T. Broadbent,et al.  Module Algebra , 1970, Nature.

[31]  Wan Fokkink,et al.  A conservative look at term deduction systems with variable binding , 1995 .

[32]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[33]  Aart Middeldorp,et al.  Modular Properties of Conditional Term Rewriting Systems , 1993, Inf. Comput..

[34]  Alex Sellink,et al.  A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes , 1995, Formal Aspects of Computing.

[35]  Eelco Visser.  A Family of Syntax Deenition Formalisms , 1995 .

[36]  J. J. Brunekreef.  A transformation tool for pure Prolog programs: the algebraic specification , 1996 .

[37]  L.M.F. Moonen,et al.  Data Flow Analysis for Reverse Engineering , 1996 .

[38]  Yoshihito Toyama,et al.  On the Church-Rosser property for the direct sum of term rewriting systems , 1984, JACM.

[39]  Eelco Visser,et al.  Scannerless Generalized-LR Parsing , 1997 .

[40]  BolRoland,et al.  The meaning of negative premises in transition system specifications , 1996 .

[41]  E. Visser,et al.  Polymorphic Syntax Deenition , 1997 .

[42]  J. Brunekreef,et al.  TransLog, an interactive tool for transformation of logic programs , 1995 .

[43]  Nachum Dershowitz,et al.  Confluence of Conditional Rewrite Systems , 1988, CTRS.

[44]  Jan A. Bergstra,et al.  Grid protocols based on synchronous communication: specification and correctness , 1995 .

[45]  Chris Verhoef,et al.  Obtaining a COBOL grammar from legacy code for reengineering purposes , 1997 .

[46]  Bob Diertens.  Simulation and Animation of Process Algebra Specifications , 1997 .

[47]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[48]  Stéphane Kaplan.  Positive/Negative Conditional Rewriting , 1988, MFCS.

[50]  Jan A. Bergstra,et al.  Sequential data algebra primitives , 1996 .

[51]  Vincent Partington,et al.  Implementation of an Imperative Programming Language with Backtracking , 1997 .

[52]  Jan A. Bergstra,et al.  An Arithmetical Module for Rationals and Reals , 1997 .