SAT-Based Compositional Verification Using Lazy Learning

DOI10.1007/978-3-540-73368-3_8MaRDI QIDQ5429315zbMATH OpenOpenAlexFDO

Authors Nishant Sinha, Edmund 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)

Recommendations

• Computer Aided Verification
• Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
• scientific article; zbMATH DE number 1956591
• Three optimizations for assume-guarantee reasoning with \(L^{*}\)
• Automatic symbolic compositional verification by learning assumptions

Cited in

(12)

• A verified SAT solver framework with learn, forget, restart, and incrementality
• A framework for compositional verification of multi-valued systems via abstraction-refinement
• Automated Assume-Guarantee Reasoning by Abstraction Refinement
• Learning Minimal Separating DFA’s for Compositional Verification
• scientific article; zbMATH DE number 7365811 (Why is no real title available?)
• Optimized L*-Based Assume-Guarantee Reasoning
• Learning assumptions for compositional verification of timed automata
• Three optimizations for assume-guarantee reasoning with \(L^{*}\)
• 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

This page was built for publication: SAT-Based Compositional Verification Using Lazy Learning

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