We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Automatic Testing of Program Slicers.
- Authors
Pérez, Sergio; Silva, Josep; Tamarit, Salvador
- Abstract
Program slicing is a technique to extract the part of a program (the slice) that influences or is influenced by a set of variables at a given point (the slicing criterion). Computing minimal slices is undecidable in the general case, and obtaining the minimal slice of a given program is normally computationally prohibitive even for very small programs. Therefore, no matter what program slicer we use, in general, we cannot be sure that our slices are minimal. This is probably the fundamental reason why no benchmark collection of minimal program slices exists. In this work, we present a method to automatically produce quasi-minimal slices. Using our method, we have produced a suite of quasi-minimal slices for Erlang that we have later manually proved they are minimal. We explain the process of constructing the suite, the methodology and tools that were used, and the results obtained. The suite comes with a collection of Erlang benchmarks together with different slicing criteria and the associated minimal slices.
- Subjects
MATHEMATICAL programming; MATHEMATICAL variables; COMPUTATIONAL complexity; MATHEMATICAL proofs; ERLANG (Computer program language)
- Publication
Scientific Programming, 2019, p1
- ISSN
1058-9244
- Publication type
Article
- DOI
10.1155/2019/4108652