Computer Aided Verification
From MaRDI portal
Publication:5716596
DOI10.1007/b138445zbMath1081.68601OpenAlexW2507913385MaRDI QIDQ5716596
Wonhong Nam, P. Madhusudan, Rajeev Alur
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b138445
Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Learning to verify branching time properties ⋮ Automated circular assume-guarantee reasoning ⋮ The Birth of Model Checking ⋮ Automated Assume-Guarantee Reasoning by Abstraction Refinement ⋮ Learning Meets Verification ⋮ Verification of asynchronous systems with an unspecified component ⋮ 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 ⋮ Compositionality Entails Sequentializability ⋮ A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees ⋮ Compositional verification and 3-valued abstractions join forces ⋮ Automatic Synthesis of Assumptions for Compositional Model Checking ⋮ Grey-Box Checking ⋮ Automated Circular Assume-Guarantee Reasoning ⋮ Learning Minimal Separating DFA’s for Compositional Verification ⋮ Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists ⋮ A novel learning algorithm for Büchi automata based on family of DFAs and classification trees ⋮ Automated formal analysis and verification: an overview
Uses Software
