Automated Circular Assume-Guarantee Reasoning
From MaRDI portal
Publication:5206947
DOI10.1007/978-3-319-19249-9_3zbMath1427.68194OpenAlexW641899672MaRDI QIDQ5206947
Sharon Shoham, Karam Abd Elkader, Orna Grumberg, Corina S. Păsăreanu
Publication date: 19 December 2019
Published in: FM 2015: Formal Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19249-9_3
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
Cites Work
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Automated assumption generation for compositional verification
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Learning Minimal Separating DFA’s for Compositional Verification
- Proofs of Networks of Processes
- Computer Aided Verification
- Computer Aided Verification
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Automated Circular Assume-Guarantee Reasoning