Refining Interface Alphabets for Compositional Verification
From MaRDI portal
Publication:5758115
DOI10.1007/978-3-540-71209-1_23zbMath1186.68290OpenAlexW1518363720MaRDI QIDQ5758115
Mihaela Gheorghiu, Dimitra Giannakopoulou, Corina S. Păsăreanu
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_23
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 (9)
Assume, Guarantee or Repair ⋮ Automated circular assume-guarantee reasoning ⋮ Automated program repair using formal verification techniques ⋮ Automated Assume-Guarantee Reasoning by Abstraction Refinement ⋮ Learning register automata: from languages to program structures ⋮ Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning ⋮ 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
Uses Software
This page was built for publication: Refining Interface Alphabets for Compositional Verification
