Abstract program slicing on dependence condition graphs

Halder, Raju; Cortesi, Agostino

doi:10.1016/j.scico.2012.05.007

Cited by 11 publications

(9 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Abstract program slicing [15] is an approach which makes use of the program's semantics, however a different slicing criterion is used. Instead of preserving those instructions that affect the exact values of the criterion variables at the criterion location, this approach preserves the statements that affect a property of the criterion variable.…”

Section: Related Workmentioning

confidence: 99%

Using Relational Verification for Program Slicing

Beckert

Bormer

Gocht

et al. 2019

Software Engineering and Formal Methods

View full text Add to dashboard Cite

Program slicing is the process of removing statements from a program such that defined aspects of its behavior are retained. For producing precise slices, i.e., slices that are minimal in size, the program's semantics must be considered. Existing approaches that go beyond a syntactical analysis and do take the semantics into account are not fully automatic and require auxiliary specifications from the user. In this paper, we adapt relational verification to check whether a slice candidate obtained by removing some instructions from a program is indeed a valid slice. Based on this, we propose a framework for precise and automatic program slicing. As part of this framework, we present three strategies for the generation of slice candidates, and we show how dynamic slicing approaches-that interweave generating and checking slice candidatescan be used for this purpose. The framework can easily be extended with other strategies for generating slice candidates. We discuss the strengths and weaknesses of slicing approaches that use our framework.

show abstract

Section: Related Workmentioning

confidence: 99%

Using Relational Verification for Program Slicing

Beckert

Bormer

Gocht

et al. 2019

Software Engineering and Formal Methods

View full text Add to dashboard Cite

show abstract

“…Dependence graph without calling relation among functions is called as program dependence graph, and that including calling functions of the program with the subjects of total sources is called as system dependence graph [15,16]. Upon analysis of dependence relations on each procedure and combination of these, system dependence graph can be generated.…”

Section: System Dependencementioning

confidence: 99%

Duplicated Code Slicing Technique for System Optimization

2019

IJRTE

View full text Add to dashboard Cite

Abstract: These days, the systems have been bigger upon integrations with multiple functions of hardware and software. To optimize these bigger systems, slicing technique is required to extract the duplicated codes. In this study, system dependent graph was used for slicing of duplicated codes. System dependent graph is generated upon analysis of extracted control relationship from system codes and data dependence. Duplicated control and data relations are extracted upon analysis of generated system dependent graph. Using control and data relations, which is a suggestive slicing technique, duplicated codes can be generated. Slicing technique using system dependent graph can be applied to the extraction of duplicated cross cutting modules in all programming methods regardless of the environment of structure/object-oriented program. By the suggestive method, code blocks duplicated. In the system can be sliced and system code optimization can be contributed by eliminating unnecessary codes from slicing.

show abstract

“…Halder and Cortei present an improved slicing algorithm, based on the work of Mastroeni and Zanardini, which uses semantics‐based data dependencies to disregard some false dependencies to give more precise slices. They claim that a slice on a set of variables V can be formed from the union of the slices on each variable in V .…”

Section: Related Workmentioning

confidence: 99%

The formal semantics of program slicing for nonterminating computations

Ward

Zedan

2016

J Software Evolu Process

View full text Add to dashboard Cite

Since the original development of program slicing in 1979 there have been many attempts to define a suitable semantics, which will precisely define the meaning of a slice. Particular issues include handling termination and nontermination, slicing nonterminating programs, and slicing nondeterministic programs. In this paper we review and critique the main attempts to construct a semantics for slicing and present a new operational semantics, which correctly handles slicing for nonterminating and nondeterministic programs. We also present a modified denotational semantics, which we prove to be equivalent to the operational semantics. This provides programmers with 2 different methods to prove the correctness of a slice or a slicing algorithm and means that the program transformation theory and FermaT transformation system, developed last 25 years of research, and which has proved so successful in analyzing terminating programs, can now be applied to nonterminating interactive programs.

show abstract

Abstract program slicing on dependence condition graphs

Cited by 11 publications

References 23 publications

Using Relational Verification for Program Slicing

Using Relational Verification for Program Slicing

Duplicated Code Slicing Technique for System Optimization

The formal semantics of program slicing for nonterminating computations

Contact Info

Product

Resources

About