Computer Aided Verification
From MaRDI portal
Publication:5716596
DOI10.1007/B138445zbMATH Open1081.68601OpenAlexW2507913385MaRDI QIDQ5716596FDOQ5716596
Wonhong Nam, Parthasarathy 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
Recommendations
- Automatic symbolic compositional verification by learning assumptions
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- scientific article; zbMATH DE number 1956591
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Automated Assumption Generation for Compositional Verification
Formal languages and automata (68Q45) Computational learning theory (68Q32) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (33)
- A learning-based approach to synthesizing invariants for incomplete verification engines
- Title not available (Why is that?)
- The Birth of Model Checking
- Verification of asynchronous systems with an unspecified component
- SAT-Based Compositional Verification Using Lazy Learning
- Optimized L*-Based Assume-Guarantee Reasoning
- Refining Interface Alphabets for Compositional Verification
- Learning Meets Verification
- Automated assumption generation for compositional verification
- Automatic symbolic compositional verification by learning assumptions
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Automatic Synthesis of Assumptions for Compositional Model Checking
- Assume-guarantee verification for probabilistic systems
- Automated formal analysis and verification: an overview
- Verification of evolving software via component substitutability analysis
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Compositional verification and 3-valued abstractions join forces
- Compositionality Entails Sequentializability
- Grey-Box Checking
- Learning Algorithms and Formal Verification (Invited Tutorial)
- Learning to verify branching time properties
- Automated circular assume-guarantee reasoning
- Computer Aided Verification
- Automated Circular Assume-Guarantee Reasoning
- Automated Assumption Generation for Compositional Verification
- A Minimized Assumption Generation Method for Component-Based Software Verification
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Learning Minimal Separating DFA’s for Compositional Verification
- Three optimizations for assume-guarantee reasoning with \(L^{*}\)
- A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
- Learning assumptions for compositional verification of timed automata
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists
Uses Software
This page was built for publication: Computer Aided Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716596)
