W.J. Fokkink and C. Verhoef. Conservative extension in positive /negative conditional term rewriting with applications to software renovation factories. Technical Report P9802, University of Amsterdam, Programming Research Group, 1998. Available at: http://adam.wins.uva.nl/~x/cade/cade.ps.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... of Amsterdam Programming Research Group Annotated Algebraic Specification of the Syntax and Semantics of the Programming Language Alma 0 Jacob Brunekreef Report P9803 april 1998 University of Amsterdam Department of Computer Science Programming Research Group Annotated Algebraic Specification of the Syntax and Semantics of the Programming Language Alma 0 Jacob Brunekreef Report P9803 april 1998 J.J. Brunekreef Programming Research Group Department of ....

.... Syntax and Semantics of the Programming Language Alma 0 Jacob Brunekreef Report P9803 april 1998 University of Amsterdam Department of Computer Science Programming Research Group Annotated Algebraic Specification of the Syntax and Semantics of the Programming Language Alma 0 Jacob Brunekreef Report P9803 april 1998 J.J. Brunekreef Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7588 e mail: jacob wins.uva.nl Universiteit van Amsterdam, 1998 Annotated algebraic specification of the syntax and ....

[Article contains additional citation context not shown here]

W. Fokkink and C. Verhoef. Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories.

....13] This notion stems from universal algebra [19] and from the theory of abstract data types, as implementations of specifications with positive conditions. In our situation such systems may contain negative conditions, as well. It is not straightforward to give such systems a sound semantics [14, 8]. Such formal treatments do have implications for the every day practice in reengineering: in [8] a theorem is proved stating that combining transformations does not influence the behavior of the individual transformations if certain easy to check syntactic criteria are satisfied for the ....

....implementations of specifications with positive conditions. In our situation such systems may contain negative conditions, as well. It is not straightforward to give such systems a sound semantics [14, 8] Such formal treatments do have implications for the every day practice in reengineering: in [8] a theorem is proved stating that combining transformations does not influence the behavior of the individual transformations if certain easy to check syntactic criteria are satisfied for the individual transformations. This theorem implies that a tool factory can be constructed from 2 ....

[Article contains additional citation context not shown here]

W.J. Fokkink and C. Verhoef. Conservative extension in positive /negative conditional term rewriting with applications to software renovation factories. Technical Report P9802, University of Amsterdam, Programming Research Group, 1998. Available at: http://adam.wins.uva.nl/~x/cade/cade.ps.

....us show how we can solve this problem with the aid of scaffolding. First we scaffold the code by providing the byte size of all the instructions. This answers the first question, and puts the result in the code, ready for human inspection. GO 24 S1 SCAFFOLD [ SIZE [ 8 ] S2 SCAFFOLD [ SIZE [ 16 ] ] S3 SCAFFOLD [ SIZE [ 8 ] S4 SCAFFOLD [ SIZE [ 4 ] The problem of providing the cumulative distance between statements is now reduced to simple addition of numbers. So we use the scaffolding code itself, and we produce the results of this calculation a new type of scaffolding (for the ....

....[3] collects data of the same type. Details on semantics The ASF equations are interpreted by our implementation platform, the ASF SDF Meta Environment [23] as conditional term rewriting systems with positive negative premises. The formal semantics of such systems has been subject of study in [22, 29, 30, 16]. In those papers, the meaning of negative premises in conditional term rewriting is being studied. ASF is a modular specification mechanism. This is illustrated by the import relation between the two modules Data and X. A natural question that arises is whether the defined semantics in the module ....

[Article contains additional citation context not shown here]

W.J. Fokkink and C. Verhoef. Conservative extension in positive /negative conditional term rewriting with applications to software renovation factories. In J.-P. Finance, editor, Proceedings 2nd Conference on Fundamental Approaches to Software Engineering, volume 1577 of LNCS, pages 98--113, Amsterdam, 1999. Springer-Verlag.

....paradigms [29] This research has resulted in the design of the Asf Sdf formalism and its support environment, the Asf Sdf Meta Environment. ASF stands for Algebraic Specification Formalism [6] It is an implementation of conditional term rewriting [36,8] possibly containing negative premises [37,45,46,26]. It also uses a form of prioritized rewriting [3,44] there are default rewrite rules that apply if other rewrite rules do not match. SDF stands for Syntax Definition Formalism [28] In fact, SDF is the part to conveniently define the signature Sigma of a term rewriting system and in ASF this ....

....proofs are number 136. So if one thinks that we might have an unusual viewpoint on the research issues, namely no termination proofs and no confluence proofs, note that this is confirmed by cost estimations from IT industry (this does not necessarily mean that we do not like proofs, see [26] for an example) In the following subsections we propose therefore research issues that encourage the amalgamation of several theoretical directions. The goal is to achieve high level, high quality artefacts that can be reused in a wide range of applications. 6.1 Terms and Term Databases From ....

W.J. Fokkink and C. Verhoef. Conservative extension in positive/negative conditional term rewriting with applications to software renovation factories. 20 Van den Brand, Klint and Verhoef Technical Report P9802, University of Amsterdam, Programming Research Group, 1998. Available at: http://adam.wins.uva.nl/~x/cade/cade.ps.

....being produced like a manufactured product more or less following the assembly line technique. Software factories are a concept that originates from Japan. Most of those factories were founded in the 1970s. For an overview of Japanese software factories we encourage the reader to consult [65] In [41] a formal definition is given for a software renovation factory. 2.1 The Factory Pyramid When software is to be processed by a software renovation factory, this implies that the factory must have detailed knowledge of the languages involved in the system that needs modification, in the same vein ....

W.J. Fokkink and C. Verhoef. Conservative extension in positive /negative conditional term rewriting with applications to software renovation factories. In J.-P. Finance, editor, Proceedings 2nd Conference on Fundamental Approaches to Software Engineering, volume 1577 of LNCS, pages 98--113, Amsterdam, 1999. Springer-Verlag.

....to take note of some metrics that characterize these kinds of projects. In Table 1 we summarized the 5 components. In the second column you find an entity called eqs. This abbreviation stands for equations that are encodings of conditional term rewriting rules possibly containing negative premises [71, 69, 45, 52, 79]. Such term rewriting systems are a very powerful means to succinctly express, e.g. code transformations. These term rewriting systems can be compiled into executables [68, 107, 23, 18, 43, 44] In this example the implementation discussed in [23, 18] was used. The executables that were built are ....

W.J. Fokkink and C. Verhoef. Conservative extension in positive/negative conditional term rewriting with applications to software renovation factories. In J.-P. Finance, editor, Proceedings 2nd Conference on Fundamental Approaches to Software Engineering, volume 1577 of LNCS, pages 98--113, Amsterdam, 1999. Springer-Verlag.

....languages [30] The techniques used are formal: the underlying formal notions are many sorted signatures and positive negative conditional rewriting. Program conversions are, for instance, expressed as rewrite rules. This formalization increases the quality of analyses and conversions [27]. Syntactic analysis is based on generalized LR parsing (GLR) This enables the construction of modular grammars and parsers for languages with large grammars and many dialects (like COBOL) 12] More traditional parsing techniques (e.g. LALR(1) as used in parser generators like Yacc and ....

W.J. Fokkink and C. Verhoef. Conservative extension in positive/negative conditional term rewriting with applications to software renovation factories. In Fundamental Approaches to Software Engineering, LNCS, 1999. To Appear.

....in transition rules. We give two detailed examples to show how our conservativity format can be applied to practical cases. The examples deal with real time ACP [21] and the I calculus [47] A check on the source dependency of transition rules has been incorporated in the tool LATOS [33] In [23] part of the conservative extension format presented in this article has been transposed to positive negative conditional term rewriting systems, and shown to be applicable with respect to software renovation factories. Acknowledgements. We have benefited from technical discussions with Bard ....

.... 31] where binding constructs enable to parametrize over the time or data domain, in process algebra with a recursive operator like the construct [34, 54, 36, 48] in the calculus [40, 41, 47] and in the lazy calculus [46, 35] In the technical report version of this article [22] and in [23] it is shown how the conservativity format can also be applied in the realm of conditional rewriting. Finally, for applications of the conservativity format in the case of operational semantics without many sortedness and binding mechanisms; see e.g. 7] In the next two sections we give detailed ....

Fokkink, W.J., and Verhoef, C. (1998), "Conservative Extension in Positive /Negative Conditional Term Rewriting with Applications to Software Renovation Factories", Report P9802, University of Amsterdam. Available at http://adam.wins.uva.nl/ x.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC