Optimizing slicing of formal specifications by deductive verification
From MaRDI portal
Recommendations
- ZB 2005: Formal Specification and Development in Z and B
- Assertion-based slicing and slice graphs
- Slicing communicating automata specifications: Polynomial algorithms for model reduction
- Slicing Concurrent Real-Time System Specifications for Verification
- Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
Cited in
(8)- Slicing communicating automata specifications: Polynomial algorithms for model reduction
- Slicing techniques for verification re-use
- Automatic verification of combined specifications: an overview
- Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
- Slicing Concurrent Real-Time System Specifications for Verification
- Decomposing Integrated Specifications for Verification
- Dependence graph based verification and synthesis of hardware/software co-designs with SAT related formulation
- ZB 2005: Formal Specification and Development in Z and B
This page was built for publication: Optimizing slicing of formal specifications by deductive verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3431403)
