Call-mark slicing: an efficient and economical way of reducing slice

Nishimatsu,; Jihira,; Kusumoto,; Inoue,

doi:10.1109/icse.1999.841032

Cited by 17 publications

(45 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nishimatsu et al [29] gather coverage at call sites executed during a particular run and use this to restrict the static program dependence graph.…”

Section: B Call-site Coveragementioning

confidence: 99%

“…Our work focuses more on control than data; in the presence of pointers and arrays, lightweight dynamic data dependence tracing in the style of Takada et al could be a useful addition. Call-mark slicing [29] marks calls that execute during a given run, then uses this to prune possible execution paths, thereby shrinking static slices. The first phase of our interprocedural slice restriction algorithm uses a similar strategy.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Lightweight control-flow instrumentation and postmortem analysis in support of debugging

Ohmann

Liblit

2016

Autom Softw Eng

View full text Add to dashboard Cite

Abstract-Debugging is difficult and costly. As a human programmer looks for a bug, it would be helpful to see a complete trace of events leading to the point of failure. Unfortunately, full tracing is simply too slow to use in deployment, and may even be impractical during testing.We aid post-deployment debugging by giving programmers additional information about program activity shortly before failure. We use latent information in post-failure memory dumps, augmented by low-overhead, tunable run-time tracing. Our results with a realistically-tuned tracing scheme show low enough overhead (0-5%) to be used in production runs. We demonstrate several potential uses of this enhanced information, including a novel postmortem static slice restriction technique and a reduced view of potentially-executed code. Experimental evaluation shows our approach to be very effective, such as shrinking stack-sensitive interprocedural static slices by 49-78% in larger applications.

show abstract

“…Nishimatsu et al [29] gather coverage at call sites executed during a particular run and use this to restrict the static program dependence graph.…”

Section: B Call-site Coveragementioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Lightweight control-flow instrumentation and postmortem analysis in support of debugging

Ohmann

Liblit

2016

Autom Softw Eng

View full text Add to dashboard Cite

show abstract

“…As far as slicing tools are concerned, existing dynamic slicing tools [1,17,24,14] highlight dynamic slices in the source code browser. Typically, it is the programmer's responsibility to analyze the statements / statement instances, and identify the suspicious statement instances for debugging.…”

Section: Related Workmentioning

confidence: 99%

Hierarchical dynamic slicing

Wang

Roychoudhury

2007

Proceedings of the 2007 International Symposium on Software Testing and Analysis

View full text Add to dashboard Cite

Dynamic slicing is a widely used technique for program analysis, debugging, and comprehension. However, the reported slice is often too large to be inspected by the programmer. In this work, we address this deficiency by hierarchically applying dynamic slicing at various levels of granularity. The basic observation is to divide a program execution trace into "phases", with data/control dependencies inside each phase being suppressed. Only the inter-phase dependencies are presented to the programmer. The programmer then zooms into one of these phases which is further divided into subphases and analyzed. We also discuss how our ideas can be used to augment debugging methods other then slicing (such as "fault localization", a recently proposed trace comparison method for software debugging).

show abstract

“…(1) Student Marks Processor (2) A Calendar Program (3) Tax Allowance Calculator As with other work on empirical aspects of slicing [57][58][59][60], the slicing criteria are developed to be realistic criteria for the programs selected, typical of the kinds of query a user of a slicing system might present for the programs under consideration.…”

Section: Effectivenessmentioning

confidence: 99%

ConSUS: a light-weight program conditioner

Danicic

Daoudi

Fox

et al. 2005

Journal of Systems and Software

View full text Add to dashboard Cite

Program conditioning consists of identifying and removing a set of statements which cannot be executed when a condition of interest holds at some point in a program. It has been applied to problems in maintenance, testing, re-use and re-engineering. Program conditioning relies upon both symbolic execution and reasoning about symbolic predicates. Automation of the process therefore requires some form of automated theorem proving. However, the use of a full-power 'heavyweight' theorem prover would impose unrealistic performance constraints. This paper reports on a lightweight approach to theorem proving using the FermaT simplify decision procedure. This is used as a component to ConSUS, a program conditioning system for the Wide Spectrum Language WSL. The paper describes the symbolic execution algorithm used by ConSUS, which prunes as it conditions. The paper also provides empirical evidence that conditioning produces a significant reduction in program size and, although exponential in the worst case, the conditioning system has low degree polynomial behaviour in many cases, thereby making it scalable to unit level applications of program conditioning.

show abstract

Call-mark slicing: an efficient and economical way of reducing slice

Cited by 17 publications

References 0 publications

Lightweight control-flow instrumentation and postmortem analysis in support of debugging

Lightweight control-flow instrumentation and postmortem analysis in support of debugging

Hierarchical dynamic slicing

ConSUS: a light-weight program conditioner

Contact Info

Product

Resources

About