Source Code Extraction Research Articles

Hydration Activates Dual-Confined Shape-Memory Effects of Cold-Reprogrammable Photonic Crystals.

Shape-memory photonic crystals (SMPCs) transform the nanoscale deformation of copolymers into structural color through an undifferentiated response to stimuli; however, activatable selective responses are extremely rare. Herein, activatable dual confined shape-memory effects (CSMEs) derived from the remodeling of the interchain hydrogen bonds (H-bonds) in cold-programmable SMPCs are revealed. The first level is the water-triggered reconstructionof interchain H-bonds, which can activate/lock the collapsed skeleton, showing shape recovery/retention in response to ethanol vapor. The second level is the pressure-induced reorganization ofinterchain H-bonds that results in the recovered skeleton being locked even when exposed to ethanol vapor or water, while the background porous structure can switch between collapse and recovery. Dual CSMEs result from the Laplace pressure difference and the binding effect of interchain H-bonds in the skeleton according to insights of swelling, in situ deformation tracking, multidimensional infrared spectra, and water wetting/evaporation simulations. The signal interference, source code extraction, and color enhancement of structurally colored patterns can be implemented using CSMEs. This work opens up a new method for fabricating activatable responsive structural color and contributes to the expansion of nanophotonic technology in water printing, erasable watermarks, signal amplifiers, and information coding.

Code Knowledge Acquisition for Knowledge Management Trajectory Framework

Knowledge and its related techniques cater the need of many tools and frameworks for software development, testing and management. Accurate usage of code according to the software requirement is prevalent in this regard, as inappropriate development of code with conceptual misunderstanding might lead to waste of time and effort. This paper describes a new approach to automate code acquisition task. This gives the advantage of using the coding knowledge that is already encoded which in turn reduces developer s task and their knowledge and effort could be utilized for further enhancement of their work. Using the existing coding knowledge eradicate the errors which are introduced at the time of naïve development activity. Furthermore, this technique can be utilized by software development applications. In this paper, a new knowledge execution technique to acquire code knowledge from software application is implemented. Code extraction gathers code segments from projects organize and logs it for future use. Here, Source Code Extraction algorithm is described that captures code.

Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas

Program slicing is an automated source code extraction technique that has been applied to a number of problems including testing, debugging, maintenance, reverse engineering, program comprehension, reuse and program integration. In all these applications the size of the slice is crucial; the smaller the better. It is known that statement minimal slices are not computable, but the question of dataflow minimal slicing has remained open since Weiser posed it in 1979. This paper proves that static slicing algorithms produce dataflow minimal end slices for programs which can be represented as schemas which are free and liberal.

Unifying program slicing and concept assignment for higher‐level executable source code extraction

AbstractProgram slicing and concept assignment have both been proposed as source code extraction techniques. Unfortunately, each has a weakness that prevents wider application. For slicing, the extraction criterion is expressed at a very low level; constructing a slicing criterion requires detailed code knowledge which is often unavailable. The concept assignment extraction criterion is expressed at the domain level. However, unlike a slice, the extracted code is not executable as a separate subprogram in its own right. This paper introduces a unification of slicing and concept assignment which exploits their combined advantages, while overcoming these two individual weaknesses. Our ‘concept slices’ are executable programs extracted using high‐level criteria. The paper introduces four techniques that combine slicing and concept assignment and algorithms for each. These algorithms were implemented in two separate tools used to illustrate the application of the concept slicing algorithms in two very different case studies. The first is a commercially‐written COBOL module from a large financial organization, the second is an open source utility program written in C. Copyright © 2005 John Wiley & Sons, Ltd.

CONSIT: a fully automated conditioned program slicer

AbstractConditioned slicing is a source code extraction technique. The extraction is performed with respect to a slicing criterion which contains a set of variables and conditions of interest. Conditioned slicing removes the parts of the original program which cannot affect the variables at the point of interest, when the conditions are satisfied. This produces a conditioned slice, which preserves the behaviour of the original with respect to the slicing criterion.Conditioned slicing has applications in source code comprehension, reuse, restructuring and testing. Unfortunately, implementation is not straightforward because the full exploitation of conditions requires the combination of symbolic execution, theorem proving and traditional static slicing. Hitherto, this difficultly has hindered development of fully automated conditioning slicing tools.This paper describes the first fully automated conditioned slicing system, CONSIT, detailing the theory that underlies it, its architecture and the way it combines symbolic execution, theorem proving and slicing technologies. The use of CONSIT is illustrated with respect to the applications of testing and comprehension. Copyright © 2003 John Wiley & Sons, Ltd.