@InProceedings{BeckertEtAl2019,
title = {Using Relational Verification for Program Slicing},
author = {Bernhard Beckert and Thorsten Bormer and
Stephan Gocht and Mihai Herda and
Daniel Lentzsch and Mattias Ulbrich},
editor = {Peter {\"O}lveczky and Gwen Sala{\"u}n},
booktitle = {17th International Conference on Software Engineering and
Formal Methods ({SEFM} 2019)},
series = {Lecture Notes in Computer Science},
volume = {11724},
year = {2019},
venue = {Oslo, Norway},
eventdate = {2019-09-16/2019-09-20},
month = sep,
pages = {353--372},
isbn = {978-3-030-30446-1},
doi = {10.1007/978-3-030-30446-1_19}
}
Using Relational Verification for Program Slicing
| Autor(en): | Bernhard Beckert, Thorsten Bormer, Stephan Gocht, Mihai Herda, Daniel Lentzsch und Mattias Ulbrich |
|---|---|
| In: | 17th International Conference on Software Engineering and Formal Methods (SEFM 2019) |
| Reihe: | Lecture Notes in Computer Science |
| Band: | 11724 |
| Jahr: | 2019 |
| Seiten: | 353-372 |
| DOI: | 10.1007/978-3-030-30446-1_19 |
Abstract
½Program slicing is the process of removing statements from a program such that defined aspects of its behavior are retained. For producing precise slices