Conditioned slicing supports partition testing

Hierons, Robert M.; Harman, Mark; Fox, Chris; Ouarbya, Lahcen; Daoudi, Mohammed

doi:10.1002/stvr.232

Cited by 40 publications

(13 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, many authors continued to develop new application areas for static slicing, such as reverse engineering [Canfora et al 1994b;Simpson et al 1993], program comprehension [De Lucia et al 1996, testing [Binkley 1998;Gupta et al 1992;Harman and Danicic 1995;Hierons et al 2002Hierons et al , 1999, and software metrics [Bieman and Ott 1994;Lakhotia 1993;Ott and Thuss 1993]. Following Weiser's initial work, many authors also developed techniques for slicing, but not until comparatively recently have sufficiently mature program slicing tools been able to handle large programs written using the entirety (rather than merely a subset) of a popular programming language.…”

Section: Implications Of the Findingsmentioning

confidence: 99%

“…Slicing has been applied to reverse engineering [Canfora et al 1994b;Simpson et al 1993], program comprehension , software maintenance [Canfora et al 1994a;Gallagher 1992;Gallagher and Lyle 1991], debugging [Agrawal et al 1993;Kamkar 1993;Lyle and Weiser 1987;Weiser and Lyle 1985], testing [Binkley 1997[Binkley , 1998Gupta et al 1992;Harman and Danicic 1995;Hierons et al 1999Hierons et al , 2002, component reuse [Beck and Eichmann 1993;Cimitile et al 1995a], program integration Horwitz et al 1989], and software metrics [Bieman and Ott 1994;Lakhotia 1993;Ott and Thuss 1993]. There are several surveys of slicing techniques, applications and variations [Binkley and Gallagher 1996;Binkley and Harman 2004;De Lucia et al 2001;Tip 1995].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An empirical study of static program slice size

Binkley

Gold

Harman

2007

ACM Trans. Softw. Eng. Methodol.

Self Cite

View full text Add to dashboard Cite

This article presents results from a study of all slices from 43 programs, ranging up to 136,000 lines of code in size. The study investigates the effect of five aspects that affect slice size. Three slicing algorithms are used to study two algorithmic aspects: calling-context treatment and slice granularity. The remaining three aspects affect the upstream dependencies considered by the slicer. These include collapsing structure fields, removal of dead code, and the influence of points-to analysis.The results show that for the most precise slicer, the average slice contains just under one-third of the program. Furthermore, ignoring calling context causes a 50% increase in slice size, and while (coarse-grained) function-level slices are 33% larger than corresponding statement-level slices, they may be useful predictors of the (finer-grained) statement-level slice size. Finally, upstream analyses have an order of magnitude less influence on slice size.

show abstract

Section: Implications Of the Findingsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An empirical study of static program slice size

Binkley

Gold

Harman

2007

ACM Trans. Softw. Eng. Methodol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Many approaches validate given input partitions and their boundaries [6,9]. However, they provide no means to also derive them from models.…”

Section: Related Workmentioning

confidence: 99%

Quality of Automatically Generated Test Cases based on OCL Expressions

Weißleder

Schlingloff

2008

2008 International Conference on Software Testing, Verification, and Validation

View full text Add to dashboard Cite

In this paper, we deal with coverage criteria for boundary testing. We focus on the automatic generation of boundary tests based on OCL expressions and evaluate the quality of these tests with established coverage criteria like MC/DC. We define and apply new coverage criteria, evaluate their efficiency via mutation testing, and substantiate all explanations by an example, part of a model of an elevator control.

show abstract

“…Conditioning and conditioned slicing are typically applied to programs at the unit level, for example, as a support for detailed understanding [38], as a unit level testing aid [9] or as a unit level reuse and code extraction tool [20,19,17]. For these applications, quadratic performance is acceptable and the technique therefore appears to scale well, at least at the unit level.…”

Section: Scalabilitymentioning

confidence: 99%

“…The way in which slicing produces an executable sub-program, based upon some criterion of interest, gives rise to many applications. For example, slicing has been applied to, among others, debugging [4,5], testing [6][7][8][9], program comprehension [10,11], program decomposition [12] and integration [13,14], software metrics [15,16] and re-engineering and reverse engineering [17][18][19][20].…”

Section: Introductionmentioning

confidence: 99%

ConSUS: a light-weight program conditioner

Danicic

Daoudi

Fox

et al. 2005

Journal of Systems and Software

Self Cite

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

Conditioned slicing supports partition testing

Cited by 40 publications

References 6 publications

An empirical study of static program slice size

An empirical study of static program slice size

Quality of Automatically Generated Test Cases based on OCL Expressions

ConSUS: a light-weight program conditioner

Contact Info

Product

Resources

About