Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
From MaRDI portal
Publication:3522908
Recommendations
Cited in
(14)- Computer Aided Verification
- Automated circular assume-guarantee reasoning
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- Verification of asynchronous systems with an unspecified component
- Automatic symbolic compositional verification by learning assumptions
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Verification of evolving software via component substitutability analysis
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Query learning of derived \(\omega\)-tree languages in polynomial time
- A weakness measure for GR(1) formulae
- A weakness measure for GR(1) formulae
- Automated circular assume-guarantee reasoning with N-way decomposition and alphabet refinement
- Polynomial identification of \(\omega \)-automata
- Assume-guarantee reasoning with local specifications
This page was built for publication: Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522908)