SAT-Based Compositional Verification Using Lazy Learning

DOI10.1007/978-3-540-73368-3_8zbMath1135.68483OpenAlexW1586728410MaRDI QIDQ5429315

Nishant Sinha, Edmund M. Clarke

Publication date: 29 November 2007

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73368-3_8

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) 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 (7)

Automated Assume-Guarantee Reasoning by Abstraction Refinement ⋮ 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 ⋮ Automatic symbolic compositional verification by learning assumptions ⋮ 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: SAT-Based Compositional Verification Using Lazy Learning