S. Burson, G. B. Kotik, and L. Z. Markosian. A program transformation approach to automating software reengineering. In Proceedings of the 14th Annual International Computer Software and Applications Conference, pages 314--322. IEEE Computer Society Press, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....generative transformations produce a new data model (e.g. as in the BNF to ASTDef generation) The process of unparsing can also be viewed as a text emitting transformation. Many existing systems permit the declarative form of transformation specification. Notable examples include REFINE [5], and TXL [6] The Intentional Programming environment [18] provides a complete programming environment that supports many operations based on program transformations. However, a system that could be successfully used for implementing generational transformations described in this paper must ....

S. Burson, G. B. Kotik, and L. Z. Markosian. A program transformation approach to automating software reengineering. In Proceedings of the 14th Annual International Computer Software and By the time of publication, a full source code release will be available as well. 11 Applications Conference, pages 314--322. IEEE Computer Society Press, 1990.

....and are unable to perform operations based on syntactic or semantic structure. Many existing full featured program transformation tools operate on program source code represented as annotated syntax trees. Notable examples include ASTLog [Crew 97] TAWK [Griswold 96] A [Ladd 95] REFINE [Burson 90] TXL [Cordy 88] and the Intentional Programming environment [Simonyi 95] Although powerful, tree based notations exhibit significant usability issues even for expert programmers. Because the structure represented by a tree based notation does not reflect the user s model of the program ....

Burson, S. & Kotik, G. & Markosian, L. A Program Transformation Approach to Automating Software Re-Engineering. In Proceedings of the International Computer Software & Application Conference 1190, Chicago, IL, 1990,

....their approach to leave code structured with respect to data and control flow. Moore [Moo95] presents a tool for restructuring the inheritance hierarchy of self programs by maximizing the sharing of features and by refactoring shared expressions into new methods. Burson, Kotik, and Markosian [BSM90] describe an approach to reengineering that is based on the Refine toolset. They combine object oriented databases, program specification and pattern matching capability with programm transformations facilities. Battaglia and Savoia [BS96] refer to the ReverseNICE reengineering toolset which ....

S. Burson, G. Sotik, and L. Markosian. A Program Transformation Approach to Automating Software Re-Engineering. In Proceedings of 9 the International Computer Software & Application Conference 1190, Chicago, lll, 1990.

....for program restructuring. These systems were chosen for inclusion on the basis of the languages they use to express transformations being interesting or influential. One of the more successful products in this area is Reasoning System s Software Refinery, incorporating the Refine language [10, 46]. Refine is a programming language for creating, analyzing and transforming Abstract Syntax Trees of a target language. To use Refine, one specifies the elements of interest of the target language in object oriented form. Some of the object attributes are purely descriptive; others refer to ....

Scott Burson, Gordon B. Kotik, and Lawrence Z. Markosian. A program transformation approach to automating software re-engineering. In International Computer Software & Applications Conference (COMPSAC 90), Chicago, 1990. IEEE Computer Society Press. (cited on page 17) 174

.... the architecture recovery environment proposed by Harris, Reubenstein and Yeh (or HRY) 14, 15] and the one proposed by Fiutem, Merlo, Antoniol and Tornella (or FMAT) 7, 8] These environments are fairly similar in the sense that both are developed on top of the same analyser generator, Refine [3], based on the same source code representation, an Abstract Syntax Tree (AST) and use a library of pattern based recognisers to extract architectural information from the code AST. 2.1. HRY This environment introduces the idea of using recognisers to extract architectural features from source ....

S. Burson, G. B. Kotik, and L. Z. Markosian. A Program Transformation Approach to Automating Software Reengineering. In Proc. 14th COMPSAC, pages 314--322. IEEE, 1990.

....models of software is the Software Bookshelf [13] The system uses the metaphor of a bookshelf, with each source file or high level entity being represented by a book. Relationships between books are described with a tuple attribute language and stored in a relational database. REFINE [2] uses an object oriented database to store a fine grained syntactic representation of source code. Patterns are specified and matched against the database in order to perform program transformations for maintenance purposes. Thus, REFINE is oriented to performing transformations as opposed to ....

Scott Burson, Gordon Kotik, and Law rence Markosian. A program transformation approach to automating software reengineering. In 14th Annual International Computer Software and Applications Conference, pages 314--322. IEEE, October 1990.

....library of transformations is required to capture the many di erent possible code constructions and styles. Examples of program transformation tools include the Maintainer s Assistant [BBY92, WB93] AutoSpec[GC96] Semantic Designs the Design Maintenance System [Bax97] Reasoning Systems Refine[BKM90] which has evolved into the Reasoning5 Code base Management System [Rea99] and Software Migrations FermaT [War99] Similarly to plan recognition tools, program transformation tools are generally con ned to recover program speci cations at the algorithmic and data structure levels, and have ....

Scott Burson, Gordon B. Kotik, and Lawrence Z. Markosian. A Program Transformation Approach to Automating Software Re-engineering. In Proceedings of the 14th Annual International Computer Software and Applications Conference (COMPSAC), pages 314-322. IEEE CS Press, 1990.

....on a variety of internal program representations, to meet specific design objectives such as efficiency of query evaluation or simplicity of the SPA front end. Common program representations used in SPAs include a relational database [4,14] special purpose database [13] object oriented database [2], attribute syntax tree [7,17] dependency graph [12,16] and a hybrid PKB [9,10] Finally, program design information required to support a maintenance process can be studied in isolation from the actual mechanism used to compute this information. Decisions regarding which information should be ....

....program model specifications. Though not all program models can be easily extracted based on source code level specifications, the method described in [15] has advantages of being simple, efficient and tolerant as program model extraction can be done on an incomplete or incorrect program. REFINE [2] and SCA [18] provide powerful query languages that were designed with objectives similar to PQL. The main difference between REFINE, SCA and PQL is in the underlying models of program design information and in the way queries are formulated. REFINE uses an Object Oriented database to store ....

[Article contains additional citation context not shown here]

Burson, S., Kotik, G. and Markosian, L. "A Program Transformation Approach to Automating Software Re-engineering," Proc. COMPSAC'90, pp. 314-322

....that enhance program understanding during maintenance by answering queries about programs. SPAs can store source code information in a database, attribute syntax tree, dependency graphs, etc. Queries are evaluated based on that information. A number of program query languages have been proposed [1, 8, 10]. The design of some static program analyzers has been based on these languages. However, few of these program query languages have a formal foundation. As a result, the interpretations of many program queries tend to be ambiguous, which often lead to an imprecise design of static program ....

....to enable efficient query evaluation. The reference model given by formally specified queries allows the designers to validate each transformation to ensure that the optimisation process does not change the meaning of a query. Generally, efficient evaluation of queries for program query languages [1, 8, 10] is still an open research problem and the main obstacle in wide spread application of static program analyzers for large software systems. A query evaluator applies optimising transformations on case by case basis, for specific classes of queries such as those listed at the beginning of this ....

S. Burson, G. Kotik, and L. Markosian. A program transformation approach to automating software re-engineering. In COMPSAC'90, pages 314--322, 1990.

....call graph extraction is an appropriate problem for all of the approaches discussed, and succinctly reveals the strengths and weaknesses of each. 1] # usr local bin mawk f [2] 3] # initialize regular expressions [4] BEGIN [5] WS = t n] 6] ID = a zA Z0 9 ] 7] IDCC = a zA Z0 9 ] [8] CALL = ID WS ( 9] DEFN = ID WS ( 10] KYWD = for while do switch if typedef [11] KYWDIC = IDCC (KYWD) IDCC # token [12] OUTSIDE = 1 [13] RS= n n # rec. sep. is blank line [14] 15] 16] # When inside a procedure definition [17] OUTSIDE [18] s = 0 [19] while (s = ....

....developing an abstraction of the code. Their approach also makes several adjustments relative to other lexical approaches to make the matching of pro [1] comment [2] 3] type ] fn [4] if kywdq(fn) opq(fn) then fail [5] param ] atype ; 6] 7] cn [8] if kywdq(cn) opq(cn) then fail [9] arg [ 10] writeCall ( fn, cn ) 11] 12] 13] procedure writeCall(fn, cf) 14] static idch [15] initial idch : ucase [16] lcase digits ) 17] 18] realfn : fn (tab(upto(idch) tab(0) 19] realcf : cf ....

[Article contains additional citation context not shown here]

S. Burson, G. B. Kotik, and L. Z. Markosian. A program transformation approach to automating software reengineering. In Proceedings of the Fourteenth Annual International Computer Software and Applications Conference, pages 314--322, 1990.

....adopted by some RE environments where a data repository is used to store the annotated AST representation, and a specific query language is provided as a means of accessing the repository. Analysis tools are left to be defined (as queries written in the provided query language) by the user. Refine [2] and Genoa [6] are examples of such environments, and their framework is shown in figure 4. An AST is a good representation for the process of architecture recovery since it contains all relevant source code constructs. However, ASTs are complex structures that contain a large number of ....

S. Burson, G. B. Kotik, and L. Z. Markosian. A Program Transformation Approach to Automating Software Re-engineering. In Proc. 14th COMPSAC, pages 314--322. IEEE, 1990.

....batch transformers and are therefore restricted to a very small field of application areas, because the EBNFs of the languages to be integrated must not differ a lot. Code to code transformers in re engineering applications that are derived from a formal rule specification language are REFINE [3] and TRANS [5] In application independent rule languages patterns of source and target language and the actions can be described. In REFINE documents stored in a central object oriented database are transformed. In TRANS the emphasis is on the central knowledge base that controls the ....

S. Burson, G. Kotik, L. Markosian: "A Program Transformation Approach to Automating Software Re-engineering", Proc. of the COMPSAC `90, Chicago, Oct. 1990, 314-322.

.... Table 1: Performance of Extracting C Calls Information (Sparc 20 50) in direct support for post processing scanned information into source models. Syntactic Several research efforts have considered the extraction of information from source based on parse tree representations (i.e. Refinery [BKM90], Code Miner [DK93] Scruple [PP92] and Ponder [GA95] These approaches typically use full parsers for particular languages. Our approach differs from these systems in searching only for those source code constructs that the engineer has specified rather than performing a full parse. A benefit ....

S. Burson, G.B. Kotik, and L.Z. Markosian. A Program Transformation Approach to Automating Software Reengineering. In Proceedings of the 14th Annual International Computer Software and Applications Conference, pages 314-- 322, October 1990.

....sections describe the program understanding project s main research results on defect filtering, structural redocumentation, and pattern matching. 3 Defect filtering The IBM team, led by Buss and Henshaw, perform defect filtering [19] using the commercial Software Refinery product (REFINE) [20] to parse the source code of SQL DS into a form suitable for analysis. This work applies the experience of domain experts to create REFINE rules to find certain families of defects in the subject software. These defects include programming language violations (overloaded keywords, poor data ....

S. Burson, G. B. Kotik, and L. Z. Markosian. A program transformation approach to automating software re-engineering. In COMPSAC '90: Proceedings of the 14th Annual International Computer Software and Applications Conference, (Chicago, Illinois; October, 1990), pages 314--322, 1990.

....for traversing and performing actions on the parse trees. Some, including Ladd and Ramming s A tool [Ladd and Ramming 1995] Arnon s Scrimshaw system [Arnon 1993] and Griswold s tawk system [Griswold et al. 1996] support regular expression matches over parse trees. Others, such as Refinery [Burson et al. 1990], TXL [Cordy et al. 1991] Scruple [Paul and Prakash 1992] GENOA [Devanbu 1992] Code Miner [Dunn and Knight 1993] and Ponder [Griswold and Atkinson 1995] take a variety of different approaches for querying and transforming parse trees. Scruple, for instance, provides a language with wildcards ....

Burson, S., Kotik, G., and Markosian, L. 1990. A program transformation approach to automating software re-engineering. In Proceedings of the Fourteenth Annual International Computer Software and Applications Conference. IEEE Computer Society Press, Los Alamitos, CA, 314--322.

No context found.

S. Burson, G. B. Kotik, and L. Z. Markosian. A program transformation approach to automating software reengineering. In Proceedings of the 14th Annual International Computer Software and Applications Conference, pages 314--322. IEEE Computer Society Press, 1990.

No context found.

Scott Burson, Gordon B. Kotik & Lawrence Z. Markosian, "A Program Transformation Approach to Automating Software Re-engineering," 14th Annual International Computer Software and Applications Conference (COMPSAC) (1990).

No context found.

Burson S., Kotik G.B. & Markosoan L.Z. (1993) A program transformation approach to automating software re-engineering. In R.S. Arnold, editor, Software Reengineering, IEEE Computer Society Press, California, p. 275-283.

No context found.

Burson S., Kotik G.B. & Markosoan L.Z. (1993) A program transformation approach to automating software re-engineering. In R.S. Arnold, editor, Software Reengineering, IEEE Computer Society Press, California, p. 275-283. 12 M. Postema, and H.W. Schmidt

No context found.

BURSON, S., KOTIK, G. B., MARKOSIAN, L. Z., A Program Transformation Approach to Automating Software Re-engineering. IEEE, 1990.

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