Automated assumption generation for compositional verification

DOI10.1007/s10703-008-0050-0zbMath1147.68050OpenAlexW2013887890MaRDI QIDQ934710

K. L. McMillan, Anubhav Gupta, Zhaohui Fu

Publication date: 30 July 2008

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-008-0050-0

zbMATH Keywords

SATModel checkingDecision treeFormal verificationAssume-guaranteeCompositional verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (7)

Assume, Guarantee or Repair ⋮ Compositional Reasoning ⋮ Automated circular assume-guarantee reasoning ⋮ Automated program repair using formal verification techniques ⋮ Fundamental results for learning deterministic extended finite state machines from queries ⋮ Automated Circular Assume-Guarantee Reasoning ⋮ A framework for compositional verification of multi-valued systems via abstraction-refinement

Uses Software

• Cadence SMV

Cites Work

• Learning regular sets from queries and counterexamples
• Complexity of automaton identification from given data
• State Reduction in Incompletely Specified Finite-State Machines
• SAT-Based Compositional Verification Using Lazy Learning
• Computer Aided Verification
• Optimized L*-Based Assume-Guarantee Reasoning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automated assumption generation for compositional verification