scientific article; zbMATH DE number 1956591
From MaRDI portal
Publication:4417936
Recommendations
- Computer Aided Verification
- Automatic symbolic compositional verification by learning assumptions
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Automated Assumption Generation for Compositional Verification
Cited in
(65)- An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets
- Computer Aided Verification
- Interpolation-based GR(1) assumptions refinement
- Automated circular assume-guarantee reasoning
- Regression verification for multi-threaded programs
- Abstract contract synthesis and verification in the symbolic \(\mathbb{K}\) framework
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- Learning residual alternating automata
- The Birth of Model Checking
- Compositional analysis of C/C++ programs with veriSoft
- Assume, guarantee or repair
- Verification of asynchronous systems with an unspecified component
- SAT-Based Compositional Verification Using Lazy Learning
- 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
- From invariant checking to invariant inference using randomized search
- Assume-guarantee verification for probabilistic systems
- Learning deterministic probabilistic automata from a model checking perspective
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Synthesizing history and prophecy variables for symbolic model checking
- Generating models of infinite-state communication protocols using regular inference with abstraction
- Active learning of nondeterministic finite state machines
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Learning regular omega languages
- Active learning for deterministic bottom-up nominal tree automata
- Compositional verification and 3-valued abstractions join forces
- Compositional analysis for verification of parameterized systems
- Query learning of derived \(\omega\)-tree languages in polynomial time
- Compositionality Entails Sequentializability
- Grey-Box Checking
- Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
- Learning to verify branching time properties
- Learning register automata: from languages to program structures
- Compositional CSP traces refinement checking
- A weakness measure for GR(1) formulae
- A weakness measure for GR(1) formulae
- AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee
- Regression verification for multi-threaded programs (with extensions to locks and dynamic thread creation)
- Automated Technology for Verification and Analysis
- Modular verification of higher-order functional programs
- scientific article; zbMATH DE number 1754684 (Why is no real title available?)
- Automated program repair using formal verification techniques
- A Minimized Assumption Generation Method for Component-Based Software Verification
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Automated Assumption Generation for Compositional Verification
- Compositional automata learning of synchronous systems
- Learning-based compositional verification for synchronous probabilistic systems
- Learning Minimal Separating DFA’s for Compositional Verification
- Polynomial identification of \(\omega \)-automata
- A verification-driven framework for iterative design of controllers
- Local symmetry and compositional verification
- Transformations for compositional verification of assumption-commitment properties
- Automata learning with automated alphabet abstraction refinement
- Learning assumptions for compositional verification of timed automata
- Compositional reasoning
- Verifying time partitioning in the DEOS scheduling kernel
- Abstraction and learning for infinite-state compositional verification
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417936)
