The following pages link to (Q4417936):
Displaying 50 items.
- A framework for compositional verification of multi-valued systems via abstraction-refinement (Q259065) (← links)
- Learning regular omega languages (Q329611) (← links)
- Active learning of nondeterministic finite state machines (Q459826) (← links)
- Learning register automata: from languages to program structures (Q479461) (← links)
- From invariant checking to invariant inference using randomized search (Q518404) (← links)
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists (Q746778) (← links)
- Verifying time partitioning in the DEOS scheduling kernel (Q816194) (← links)
- AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee (Q848309) (← links)
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning (Q934706) (← links)
- Automated assumption generation for compositional verification (Q934710) (← links)
- Automatic symbolic compositional verification by learning assumptions (Q934713) (← links)
- Learning deterministic probabilistic automata from a model checking perspective (Q1689574) (← links)
- Verification of asynchronous systems with an unspecified component (Q1731830) (← links)
- Generating models of infinite-state communication protocols using regular inference with abstraction (Q2018056) (← links)
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees (Q2051763) (← links)
- Learning residual alternating automata (Q2105462) (← links)
- Concurrent Kleene algebra with observations: from hypotheses to completeness (Q2200836) (← links)
- Compositional verification and 3-valued abstractions join forces (Q2266991) (← links)
- A verification-driven framework for iterative design of controllers (Q2335947) (← links)
- Compositional analysis for verification of parameterized systems (Q2368952) (← links)
- Compositional analysis of C/C++ programs with veriSoft (Q2502271) (← links)
- Learning to verify branching time properties (Q2642669) (← links)
- Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys (Q2798781) (← links)
- Regression Verification for Multi-threaded Programs (Q2891406) (← links)
- Local Symmetry and Compositional Verification (Q2891426) (← links)
- Modular Verification of Higher-Order Functional Programs (Q2988670) (← links)
- Compositionality Entails Sequentializability (Q3000634) (← links)
- Automata Learning with Automated Alphabet Abstraction Refinement (Q3075487) (← links)
- Compositional Reasoning (Q3176370) (← links)
- A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees (Q3303894) (← links)
- Interpolation-Based GR(1) Assumptions Refinement (Q3303899) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- Automated Assume-Guarantee Reasoning by Abstraction Refinement (Q3512489) (← links)
- Learning Meets Verification (Q3525110) (← links)
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (Q3602799) (← links)
- An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets (Q3612361) (← links)
- Automatic Synthesis of Assumptions for Compositional Model Checking (Q3613064) (← links)
- Grey-Box Checking (Q3613088) (← links)
- Learning Minimal Separating DFA’s for Compositional Verification (Q3617752) (← links)
- Abstract Contract Synthesis and Verification in the Symbolic 𝕂 Framework (Q4988925) (← links)
- Assume, Guarantee or Repair (Q5039510) (← links)
- Polynomial Identification of $$\omega $$-Automata (Q5164178) (← links)
- Compositional CSP Traces Refinement Checking (Q5178982) (← links)
- Automated Circular Assume-Guarantee Reasoning (Q5206947) (← links)
- (Q5232903) (← links)
- A weakness measure for GR(1) formulae (Q5918136) (← links)
- A weakness measure for GR(1) formulae (Q5918262) (← links)
- Regression verification for multi-threaded programs (with extensions to locks and dynamic thread creation) (Q5962972) (← links)
- Compositional automata learning of synchronous systems (Q6535219) (← links)
- Learning assumptions for compositional verification of timed automata (Q6535626) (← links)
