Institute of Information Security and Dependability (KASTEL) – Application-oriented Formal Verification
Institute of Information Security and Dependability (KASTEL) – Application-oriented Formal Verification
Publications

Using Relational Verification for Program Slicing

Reviewed Paper In Proceedings
Author(s):Bernhard Beckert, Thorsten Bormer, Stephan Gocht, Mihai Herda, Daniel Lentzsch, and Mattias Ulbrich
In:17th International Conference on Software Engineering and Formal Methods (SEFM 2019)
Series:Lecture Notes in Computer Science
Volume:11724
Year:2019
Pages: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

BibTeX

@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}
}