SEMSLICE: Exploiting relational verification for automatic program slicing

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present SemSlice, a tool which automatically produces very precise slices for C routines. 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 close to the minimal number of statements, the program’s semantics must be considered. SemSlice is based on automatic relational regression verification, which SemSlice uses to select valid slices from a set of candidate slices. We present several approaches for producing candidates for precise slices. Evaluation shows that regression verification (based on coupling invariant inference) is a powerful tool for semantics-aware slicing: precise slices for typical slicing challenges can be found automatically and fast.

Cite

CITATION STYLE

APA

Beckert, B., Bormer, T., Gocht, S., Herda, M., Lentzsch, D., & Ulbrich, M. (2017). SEMSLICE: Exploiting relational verification for automatic program slicing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10510 LNCS, pp. 312–319). Springer Verlag. https://doi.org/10.1007/978-3-319-66845-1_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free