Optimized L*-Based Assume-Guarantee Reasoning

DOI10.1007/978-3-540-71209-1_22zbMath1147.68568OpenAlexW2030511855MaRDI QIDQ5758116

Ofer Strichman, Sagar Chaki

Publication date: 3 September 2007

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71209-1_22

Mathematics Subject Classification ID

Computational learning theory (68Q32) 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 (11)

Assume, Guarantee or Repair ⋮ Abstraction and Abstraction Refinement ⋮ Automated circular assume-guarantee reasoning ⋮ Automated program repair using formal verification techniques ⋮ Automated Assume-Guarantee Reasoning by Abstraction Refinement ⋮ Verification of asynchronous systems with an unspecified component ⋮ Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning ⋮ Automated assumption generation for compositional verification ⋮ Verification of evolving software via component substitutability analysis ⋮ Learning Minimal Separating DFA’s for Compositional Verification ⋮ A framework for compositional verification of multi-valued systems via abstraction-refinement

This page was built for publication: Optimized L*-Based Assume-Guarantee Reasoning