Automated circular assume-guarantee reasoning

DOI10.1007/978-3-319-19249-9_3MaRDI QIDQ5206947zbMATH OpenOpenAlexFDO

Authors Karam Abd Elkader, Orna Grumberg, Sharon Shoham, 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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Automated circular assume-guarantee reasoning
• Automated circular assume-guarantee reasoning with N-way decomposition and alphabet refinement
• scientific article; zbMATH DE number 1754638
• Automated Assumption Generation for Compositional Verification
• Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition

Cites work

• scientific article; zbMATH DE number 1670774 (Why is no real title available?)
• scientific article; zbMATH DE number 3926220 (Why is no real title available?)
• scientific article; zbMATH DE number 1283472 (Why is no real title available?)
• scientific article; zbMATH DE number 1956591 (Why is no real title available?)
• scientific article; zbMATH DE number 1487866 (Why is no real title available?)
• Automated Assume-Guarantee Reasoning by Abstraction Refinement
• Automated assumption generation for compositional verification
• Computer Aided Verification
• Computer Aided Verification
• Learning Minimal Separating DFA’s for Compositional Verification
• Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
• Proofs of Networks of Processes

Cited in

(11)

• Assume, guarantee or repair
• Assume-guarantee verification for probabilistic systems
• scientific article; zbMATH DE number 1956523 (Why is no real title available?)
• Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
• Automated circular assume-guarantee reasoning
• Synthesis of circular compositional program proofs via abduction
• Automated circular assume-guarantee reasoning with N-way decomposition and alphabet refinement
• Automated program repair using formal verification techniques
• Automated Assumption Generation for Compositional Verification
• scientific article; zbMATH DE number 1754638 (Why is no real title available?)
• APML: an architecture proof modeling language

This page was built for publication: Automated circular assume-guarantee reasoning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206947)