A framework for compositional verification of multi-valued systems via abstraction-refinement
From MaRDI portal
Recommendations
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- Compositional verification and 3-valued abstractions join forces
- Compositional Verification and 3-Valued Abstractions Join Forces
- scientific article; zbMATH DE number 3880084
- A compositional approach to the verification of hybrid systems
- Compositional Verification for Component-Based Systems and Application
- Abstraction and composition: a verification method for co-operating systems
- Compositional analysis for verification of parameterized systems
- scientific article; zbMATH DE number 1956590
Cites work
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 1670794 (Why is no real title available?)
- scientific article; zbMATH DE number 1693429 (Why is no real title available?)
- scientific article; zbMATH DE number 5510996 (Why is no real title available?)
- scientific article; zbMATH DE number 3926220 (Why is no real title available?)
- scientific article; zbMATH DE number 3659568 (Why is no real title available?)
- scientific article; zbMATH DE number 1953032 (Why is no real title available?)
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- scientific article; zbMATH DE number 1538049 (Why is no real title available?)
- scientific article; zbMATH DE number 1796131 (Why is no real title available?)
- scientific article; zbMATH DE number 1863177 (Why is no real title available?)
- scientific article; zbMATH DE number 1903350 (Why is no real title available?)
- scientific article; zbMATH DE number 1905120 (Why is no real title available?)
- scientific article; zbMATH DE number 2102712 (Why is no real title available?)
- scientific article; zbMATH DE number 2102715 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- A game-based framework for CTL counterexamples and 3-valued abstraction-refinement.
- A lattice-theoretical fixpoint theorem and its applications
- Algebraic Methodology and Software Technology
- Automata, Languages and Programming
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Automated Technology for Verification and Analysis
- Automated assumption generation for compositional verification
- Automatic symbolic compositional verification by learning assumptions
- Compositional Verification and 3-Valued Abstractions Join Forces
- Computer Aided Verification
- Computer Aided Verification
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Latticed Simulation Relations and Games
- Learning Minimal Separating DFA’s for Compositional Verification
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Multi-valued model checking via classical model checking.
- Optimized L*-Based Assume-Guarantee Reasoning
- Refining Interface Alphabets for Compositional Verification
- SAT-Based Compositional Verification Using Lazy Learning
- Tools and Algorithms for the Construction and Analysis of Systems
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
Cited in
(4)
This page was built for publication: A framework for compositional verification of multi-valued systems via abstraction-refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259065)