Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition

DOI10.1007/11901914_15zbMath1161.68578OpenAlexW2136248572MaRDI QIDQ3522908

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

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (10)

Unnamed Item ⋮ Concurrent Kleene algebra with observations: from hypotheses to completeness ⋮ Verification of asynchronous systems with an unspecified component ⋮ Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning ⋮ Verification of evolving software via component substitutability analysis ⋮ Automatic symbolic compositional verification by learning assumptions ⋮ Polynomial Identification of $$\omega $$-Automata ⋮ A weakness measure for GR(1) formulae ⋮ A weakness measure for GR(1) formulae ⋮ ASSUME-GUARANTEE REASONING WITH LOCAL SPECIFICATIONS

Uses Software

• NuSMV

This page was built for publication: Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition