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

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

2000
David W. Binkley L. Ross Raszewski Christopher Smith Mark Harman

Amorphous program slicing relaxes the syntactic constraint of traditional slicing and can therefore produce considerably smaller slices. This simplification power can be used to answer questions a software engineer might have about a program by first augmenting the program to make the question explicit and then slicing out an answer. One benefit of this technique is that the answer is in the fo...

Journal: :CoRR 2017
Prasanna Kumar K. Amitabha Sanyal Amey Karkare

Several applications of slicing require a program to be sliced with respect to more than one slicing criterion. Program specialization, parallelization and cohesion measurement are examples of such applications. Œese applications can bene€t from an incremental static slicing method in which a signi€cant extent of the computations for slicing with respect to one criterion could be reused for ano...

2005
Raoul Jetley

ion, by virtue of producing an abstract model similar to the program model, works in a manner that facilitates bottom-up comprehension. It thus forms a perfect foil for slicing by (automatically) providing program models to the analyst at specified levels of abstraction, that can be used to form the hypotheses upon which the slicing criteria are based upon. Further, the abstracted model can be ...

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...

2005
P. K. Mishra

Program slicing is the process of deleting statements in a program that do not affect a given set of variables at a chosen point in the program. In this paper the parallel slicing algorithm is introduced. It is shown how the control flow graph of the program to be sliced is converted into a network of concurrent processes, thereby producing a parallel version of Weiser’s original static slicing...

2003
Martin P. Ward

In this paper we describe an improved formalisation of slicing in WSL transformation theory and apply the result to a particularly challenging slicing problem: the SCAM mug [1]. We present both syntactic and semantic slices of the mug program and give semantic slices for various generalisations of the program. Although there is no algorithm for constructing a minimal syntactic slice, we show th...

2005
Krisztián Pócza Mihály Biczó Zoltán Porkoláb

ABSTRACT Dynamic program slicing methods are very attractive for debugging because many statements can be ignored in the process of localizing a bug. Although language interoperability is a key concept in modern development platforms, current slicing techniques are still restricted to a single language. In this paper a cross-language dynamic program slicing technique is introduced for the .NET ...

Journal: :Informatica (Slovenia) 2006
Durga Prasad Mohapatra Rajib Mall Rajeev Kumar

This paper surveys the existing slicing techniques for object-oriented programs. Many commercial objectoriented programs are concurrent in nature. Concurrency is typically implemented in the form of multithreading or message passing using sockets or both. We therefore review the available techniques in slicing of concurrent object-oriented programs. Another trend that is clearly visible in obje...

2006
Timon ter Braak

Program slicing can be very useful for understanding and debugging aspect-oriented programs. Program slicing is a common technique, but it is not trivial to use in aspectoriented programming. Current implementations of slicing tools lack support for features of popular aspect-oriented languages. This paper proposes a detailed algorithm for the construction of an aspect-oriented system dependenc...

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 ...

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

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