Abstraction refinement via inductive learning
From MaRDI portal
Recommendations
Cited in
(13)- Learning good prototypes for classification using filtering and abstraction of instances
- Generalised multi-pattern-based verification of programs with linear linked structures
- D^3: data-driven disjunctive abstraction
- Abstraction refinement guided by a learnt probabilistic model
- Counterexample validation and interpolation-based refinement for forest automata
- Verification of heap manipulating programs with ordered data by extended forest automata
- Automata learning with automated alphabet abstraction refinement
- scientific article; zbMATH DE number 4166913 (Why is no real title available?)
- Automata Learning through Counterexample Guided Abstraction Refinement
- Learning minimal abstractions
- An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures
- AI 2005: Advances in Artificial Intelligence
- A framework for the verification of infinite-state graph transformation systems
This page was built for publication: Abstraction refinement via inductive learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716594)