Seminar Topics & Project Ideas On Computer Science Electronics Electrical Mechanical Engineering Civil MBA Medicine Nursing Science Physics Mathematics Chemistry ppt pdf doc presentation downloads and Abstract

Full Version: A Formal Framework for Automated Round-trip Software Engineering in Static Aspect
You're currently viewing a stripped down version of our content. View the full version with proper formatting.
A Formal Framework for Automated Round-trip Software Engineering in Static Aspect Weaving and Transformations



Abstract

Formal framework is an improved version of an approach to Automated Round-trip software Engineering. ARE is a demanding problem in a wide range of modeling and programming systems. The goal of ARE is automatically assure consistency between different interrelated systems artifacts. It is applicable to a broad class of source level code refactoring systems where actions such as pre processing, static action weaving, automatic rewrites and manual editing are encoded as trees that are statically woven into core. The refactoring process is composed of a series of weaving steps. Its transforms an initial, possibly empty, core into a final source program. As the major contribution we formally show how, given a tree-shaped intermediate representation of a program and an ancillary transposition tree, manual edits in statically woven oven code can consistently be mapped back to their proper source of origin, which is either in the application core or in an element in the asp aspect space. Invasive Interactive parallelization builds around interactive static preprocessing of sequential programs where a number of parallelizing statements.

Existing system

• There is no tree pattern for code mapping.
• Time and space complexity is very high.
• We can’t edit on source program.

Proposed system

• A formal model that uniformly represents generic automated program refactoring, static aspect weaving and manual edit as CST transformation.
• Maintain coordinate mappings for groups of IR nodes, compactly represented in an ancillary transposition tree.
• Reduce the space complexity of the original method from previous to the current weaving steps.
• Reduce the time Complexity.
• We set the notations and give some necessary backgrounds

Hardware Requirements
• SYSTEM : Pentium IV 2.4 GHz
• HARD DISK : 40 GB
• FLOPPY DRIVE : 1.44 MB
• MONITOR : 15 VGA colour
• MOUSE : Logitech.
• RAM : 256 MB

Software Requirements

• Operating system :- Windows XP Professional
• Front End :- Microsoft Visual Studio .Net 2003/2005
• Coding Language :- Visual C# .Net