Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
DOI10.1007/11901914_15zbMATH Open1161.68578OpenAlexW2136248572MaRDI QIDQ3522908FDOQ3522908
Authors: Wonhong Nam, Rajeev Alur 
Publication date: 4 September 2008
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1536&context=cis_papers
Recommendations
Formal languages and automata (68Q45) Computational learning theory (68Q32) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (14)
- Title not available (Why is that?)
- 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
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Verification of evolving software via component substitutability analysis
- 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
- Computer Aided Verification
- Automated circular assume-guarantee reasoning
Uses Software
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)
