Using Relational Verification for Program Slicing

DOI10.1007/978-3-030-30446-1_19MaRDI QIDQ6488983

Stephan Gocht, Unnamed Author, Mihai Herda, Mattias Ulbrich, Bernhard Beckert, Unnamed Author

Publication date: 14 March 2024

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• A trajectory-based strict semantics for program slicing
• Dynamic program slicing
• Automating regression verification of pointer programs by predicate abstraction
• Relational verification through Horn clause transformation
• Relational program reasoning using compiler IR
• Assertion-based slicing and slice graphs
• Cut Branches Before Looking for Bugs: Sound Verification on Relaxed Slices
• TRACER: A Symbolic Execution Tool for Verification
• The program dependence graph and its use in optimization
• Using dependence graphs to assist verification and testing of information-flow properties

This page was built for publication: Using Relational Verification for Program Slicing