By Steven G. Woods

The nice problem of opposite engineering is recuperating layout info from legacy code: the concept that restoration challenge. This monograph describes our examine attempt in attacking this challenge. It discusses our idea of the way a constraint-based method of application plan reputation can successfully extract layout recommendations from resource code, and it information experiments in proposal restoration that aid our claims of scalability. Importantly, we current our types and experiments in enough aspect in order to be simply replicated. This ebook is meant for researchers or software program builders interested in opposite engineering or reengineering legacy platforms. in spite of the fact that, it may possibly additionally curiosity these researchers who're utilizing plan acceptance recommendations or constraint-based reasoning. we predict the reader to have an inexpensive machine technological know-how heritage (i.e., familiarity with the fundamentals of programming and set of rules analysis), yet we don't require familiarity with the fields of opposite engineering or synthetic intelligence (AI). To this finish, we conscientiously clarify all of the AI suggestions we use. This ebook is designed as a reference for complex undergraduate or graduate seminar classes in software program engineering, opposite engineering, or reengineering. it might additionally function a supplementary textbook for software program engineering-related classes, comparable to these on application realizing or layout restoration, for AI-related classes, akin to these on plan popularity or constraint delight, and for classes that conceal either subject matters, reminiscent of these on AI functions to software program engineering. association The ebook includes 8 chapters.

Show description

Read or Download Constraint-Based Design Recovery for Software Reengineering: Theory and Experiments PDF

Similar design books

Optimum Design of Structures: With Special Reference to Alternative Loads Using Geometric Programming

This e-book provides the built-in process of research and optimum layout of constructions. This procedure, that's simpler than the so-called nested technique, has the trouble of producing a wide optimization challenge. to beat this challenge a technique of decomposition by way of multilevel is constructed.

Surface Plasmon Resonance Sensors: A Materials Guide to Design and Optimization

This e-book addresses the real actual phenomenon of floor Plasmon Resonance or floor Plasmon Polaritons in skinny steel motion pictures, a phenomenon that's exploited within the layout of a big number of physico-chemical optical sensors. during this therapy, an important fabrics elements for layout and optimization of SPR sensors are investigated and defined intimately.

Multifunctional Polymeric Nanocomposites Based on Cellulosic Reinforcements

Multifunctional Polymeric Nanocomposites in accordance with Cellulosic Reinforcements introduces the leading edge functions of polymeric fabrics in line with nanocellulose, and covers extraction equipment, functionalization methods, and meeting tips on how to let those purposes. The ebook offers the cutting-edge of this novel nano-filler and the way it allows new purposes in lots of diverse sectors, past current items.

Additional resources for Constraint-Based Design Recovery for Software Reengineering: Theory and Experiments

Example text

Signal ? Read ? Test compares ? Signal & ? Stop-Constant ? Test does not perform input ? Process does not perform input ? Process does not define? Signal ? 12. The "Read-Process-Loop" STIMP. 2. Exact graph matching. Each STIMP from the plan library is compared against each of the sub-HMODELs, starting from the top of the decomposition "tree". The comparison algorithm has these steps: 1. Match entries in the control-flow graph part of a sub-HMODEL against the STIMP using depth-first search. This results in zero or more bindings between subHMODEL entries and the STIMP control-flow entries (initial candidate instances of the STIMP).

Each grammar rule involving I and meeting known constraints involving I and P) and where I is in the "immediately needed" set, make a new item extending P with I and add it to the agenda. If I is partial, then for each complete item C in the chart that extends I where I is in the "immediately needed" set of C, make a new item extending I with C. , evaluate constraints not evaluated during the extending process, combine share-equivalent ftowgraphs, and so on). 9. GRASPR's chart-parsing plan recognition algorithm.

This leaves another important open question . Does there exist a unifying framework for describing these approaches that supports empirical and analytical comparisons of their behavior? 3 PROGRAM UNDERSTANDING AND CONSTRAINT SATISFACTION While previous program understanding approaches differ in many ways, they all depend on constraints. This suggests applying techniques for solving constraint satisfaction problems (CSPs) to program understanding.

Download PDF sample

Rated 4.77 of 5 – based on 36 votes