Program Slice Browser

Deng, Yunbo; Kothari, Suresh; Namara, Y.

doi:10.1109/wpc.2001.921713

Cited by 22 publications

(16 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, it has been studied as a driver of program comprehension [Balmas 2002;Deng et al 2001]. Dependence analysis has also been used to control the kinds of maintenance change that can be performed with minimal impact [Gallagher and Lyle 1991;Tonella 2003] as well as to measure the impact of such changes [Black 2001].…”

Section: Related Workmentioning

confidence: 99%

Efficient Identification of Linchpin Vertices in Dependence Clusters

Binkley

Gold

Harman

et al. 2013

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Several authors have found evidence of large dependence clusters in the source code of a diverse range of systems, domains, and programming languages. This raises the question of how we might efficiently locate the fragments of code that give rise to large dependence clusters. We introduce an algorithm for the identification of linchpin vertices, which hold together large dependence clusters, and prove correctness properties for the algorithm's primary innovations. We also report the results of an empirical study concerning the reduction in analysis time that our algorithm yields over its predecessor using a collection of 38 programs containing almost half a million lines of code. Our empirical findings indicate improvements of almost two orders of magnitude, making it possible to process larger programs for which it would have previously been impractical.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient Identification of Linchpin Vertices in Dependence Clusters

Binkley

Gold

Harman

et al. 2013

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

show abstract

“…These fractions are referred to as slices artifacts that preserve exact information about the program's behavior projected onto the relevant segments of the original program. These techniques has been widely studied and applied to numerous applications in software engineering such as debugging (Deng et al, 2000), testing (Lyle and Gallagher, 1998), maintenance (Gallagher and Lyle, 1991) and reuse (Lanubile and Visaggio, 1997). The slicing technique presents an opportunity to formulate an efficient method to extract a part of a design described in an HDL.…”

Section: Jcsmentioning

confidence: 99%

Conditioned Slicing for Efficient Multiway Decision Graphs Model-Checker

Elmansori¹

2013

Journal of Computer Science

View full text Add to dashboard Cite

Integrating formal verification techniques into the hardware design process provides the means to rigorously prove critical properties. However, most automatic verification techniques, such as model checking, are only effectively applicable to designs of limited sizes due to the state explosion problem. The Multiway Decision Graphs (MDG) method is an efficient method to define hardware designs into more abstract environments; however, the MDG model checker (MDG-MC) still suffers from the state explosion problem. Furthermore, all the backward reduction algorithms cannot be used in MDG, due to the presence of abstract state variables. In this study, an efficient extractor for MDG Hardware Descrpiton Languge (MDG-HDL) is introduced based on static (SS-MDG) and conditioned (CS-MDG) program slicing techniques. The techniques can obtain a chaining slice for given signals of interest. The main advantages of these techniques are: It has no MDG-HDL coding style limitation, it is accurate and it is competent in dealing with various MDG-HDL constructions. The main motivation for introducing this approach is to tackle the state explosion problem of MDG-MC that big MDG-HDL may cause. We apply our proposed techniques on different MDG-HDL designs and our analyses have shown that the proposed reduction techniques resulted in significantly improved performance of the MDG-MC. In this study, we present a general idea of program slicing, a discussion of how to slice MDG-HDL programs, implementation of the tool and a brief overview of some applications and experimental results. The underlying method and the tool based on it need to be empirically evaluated when applying to various applications.

show abstract

“…Program slicing is widely used in program comprehension, debugging, testing, maintenance [5] and integration of program version (e.g., [2,3,4]). A program slice of a program P with respect to a slicing criterion <p,V>, for a p a location in P and V a set of variables in P referenced at p, is the set of statements and predicates in P that might affect the value of variables in V at p [5].…”

Section: Constructing Security-based Reduced Control Flow Graph From mentioning

confidence: 99%

“…A program slice of a program P with respect to a slicing criterion <p,V>, for a p a location in P and V a set of variables in P referenced at p, is the set of statements and predicates in P that might affect the value of variables in V at p [5]. In order to make the slicing applicable to large software systems, much research has been done to develop the interprocedural slicing techniques based on the system dependence graph (SDG).Various researchers have put off the way for constructing the system dependence graph (SDG) for a given Java program, this includes [6,7,8].…”

Section: Constructing Security-based Reduced Control Flow Graph From mentioning

confidence: 99%

See 1 more Smart Citation

Security Framework to Verify the Low Level Implementation Codes

Kim

Yang

2005

Computational Science and Its Applications – ICCSA 2005

View full text Add to dashboard Cite

Abstract. With the development of web-application, especially E-commerce, many software designers need to incorporate either low-level security functionalities into their programs. This involves the implementation of security features using Java Cryptography Architecture (JCA), Java Cryptography Extension (JCE) and Java Secure Socket Extension (JSSE) API provided by Sun Corporation [1]. Through our discovery, we find that many functional security related features in software systems are usually implemented by a few methods. The use of these methods results to some necessary structural patterns in reduced control flow graph of the program. In this papers, we present our way to recover the security features by recognizing these methods invocations automatically and transform the reduced control flow graph to state transition diagram through functional abstractions. We believe that it would not only facilitate the comprehension of the security framework implemented in the program, but also make the further verification of the security features possible.

show abstract

Program Slice Browser

Cited by 22 publications

References 22 publications

Efficient Identification of Linchpin Vertices in Dependence Clusters

Efficient Identification of Linchpin Vertices in Dependence Clusters

Conditioned Slicing for Efficient Multiway Decision Graphs Model-Checker

Security Framework to Verify the Low Level Implementation Codes

Contact Info

Product

Resources

About