نتایج جستجو برای: program slicing

تعداد نتایج: 463331  

2008
Daniel Wasserrab Andreas Lochbihler

Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correctness of slicing, which should ideally be proven independent of concrete programming languages and with the help of well-known verifying techniques such as proof assistants. As a first step in this direction, this cont...

2001
Mark Harman Robert M. Hierons Sebastian Danicic John Howroyd Michael R. Laurence Chris Fox

Several approaches to reverse and re-engineering are based upon program slicing. Unfortunately, for large systems, such as those which typically form the subject of reverse engineering activities, the space and time requirements of slicing can be a barrier to successful application. Faced with this problem, several authors have found it helpful to merge Control Flow Graph (CFG) nodes, thereby i...

2007
Sebastian Danicic

Program slicing is a technique for identifying a subprogram from an original program. The subprogram, called a slice, is an executable program which maintains the eeect of the original upon a chosen set of variables at some point within the Control Flow Graph (CFG) of the original. The variable set, CFG node pair is called the slicing criterion. Slices nd applications in debugging, testing, par...

Journal: :Int. J. Adv. Comp. Techn. 2010
Jaakko Korpi Jussi Koskinen

Program slicing is a promising technique for providing automated support for various important software engineering activities. There exists hundreds of scientific studies on the theory of slicing. However, slicing is still not widely applied in software industry. Therefore, there is a need to survey and characterize the conducted research and to analyze what problems hinder progress. This pape...

2009
Christophe Joubert

– Instead of defining both Ctl formulas and least fixed point computation algorithms, program slicing can be described as a μ-calculus formula [11] only. This greatly simplifies the definition of existing classes of program slicing (backward/forward/chopping, static/dynamic/hybrid/conditioned, syntaxpreserving/amorphous) in a unified and concise framework. Due to its capability of defining both...

2008
Anne Mulhern

? x x = 2; if (y == 2) y = 2; effective slice{2,3} in forming correct unions of slices potential dependences must be taken into account only when the potential statement is executed in some other slice effective slicing algorithm a relevant slicing algorithm abstracted over a set, !, of potential statements: effective(P, ", !) effective(P, ", ∅) = full(P, ") effective(P, ", P) = relevant(P, ") ...

Journal: :Softw., Pract. Exper. 2005
Nicolas E. Gold Mark Harman David W. Binkley Robert M. Hierons

Both program slicing and concept assignment have been proposed as source code extraction techniques. Unfortunately, each has a weakness which 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 t...

1999
Matthew B. Dwyer John Hatcliff

Applying nite state veri cation techniques e g model check ing to software requires that program source code be trans lated to a nite state transition system that safely models program behavior Automatically checking such a transition system for a correctness property is typically very costly thus it is necessary to reduce the size of the transition sys tem as much as possible In fact it is oft...

2013
Rupinder Singh Vinay Arora Grady Booch James Rumbaugh Ivar Jacobson Jianjun Zhao J. Wang Wei Dong Zhichang Qi H. Kagdi J. I. Maletic Jung Ho Bae Heung Seok Chae Sagar Sen Naouel Moha Benoit Baudry Jaiprakash T. Lallchandani Philip Samuel Rajib Mall

To understand and test a large software product is very challenging task. One way to ease this is program slicing technique that decomposes the large programs into smaller ones and another is model based slicing that decomposes the large software architecture model into smaller models at the early stage of SDLC (Software Development Life Cycle). This literature analysis presents an overview of ...

1988
THOMAS REPS

A slice of a program with respect to a program point p and variable x consists of all statements of the program that might affect the value of x at point p. Slices can be extracted particularly easily from a program representation called a dependence graph, originally introduced as an intermediate program representation for performing optimizing, vectorizing, and parallelizing transformations. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید