Slicing techniques for verification re-use
From MaRDI portal
Recommendations
- Optimizing slicing of formal specifications by deductive verification
- Slicing behavior tree models for verification
- Formal Verification of Simulation Traces Using Computation Slicing
- Reuse of proofs in software verification
- Algebraic Methodology and Software Technology
- A novel formal approach to program slicing
- A vocabulary of program slicing-based techniques
Cites work
- scientific article; zbMATH DE number 2089401 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 2013587 (Why is no real title available?)
- scientific article; zbMATH DE number 2013588 (Why is no real title available?)
- scientific article; zbMATH DE number 2143088 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 1569128 (Why is no real title available?)
- scientific article; zbMATH DE number 1863159 (Why is no real title available?)
- scientific article; zbMATH DE number 1409638 (Why is no real title available?)
- A calculus of durations
- Formal Methods for Components and Objects
- Inheritance of temporal logic properties.
- Inheritance of workflows: An approach to tackling problems related to change
- Issues in slicing PROMELA and its applications to model checking, protocol understanding, and simulation
- Slicing software for model construction
- Specification and verification of object-oriented programs using supertype abstraction
- Stutter-invariant temporal properties are expressible without the next-time operator
- ZB 2005: Formal Specification and Development in Z and B
Cited in
(5)
This page was built for publication: Slicing techniques for verification re-use
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571210)