Pages that link to "Item:Q4647827"
From MaRDI portal
The following pages link to Automata Learning through Counterexample Guided Abstraction Refinement (Q4647827):
Displaying 14 items.
- Learning register automata: from languages to program structures (Q479461) (← links)
- Improving active Mealy machine learning for protocol conformance testing (Q479471) (← links)
- Active learning for extended finite state machines (Q736459) (← links)
- Generating models of infinite-state communication protocols using regular inference with abstraction (Q2018056) (← links)
- Enhancing Automata Learning by Log-Based Metrics (Q2814131) (← links)
- Improving Symbolic Automata Learning with Concolic Execution (Q5039526) (← links)
- Computer Aided Verification (Q5716594) (← links)
- Computer Aided Verification (Q5900687) (← links)
- A Myhill-Nerode theorem for register automata and symbolic trace languages (Q5918650) (← links)
- Enhancing active model learning with equivalence checking using simulation relations (Q6151756) (← links)
- $$\textsc {Reach}$$ on Register Automata via History Independence (Q6487290) (← links)
- A Context-Free Symbiosis of Runtime Verification and Automata Learning (Q6488340) (← links)
- Reverse Engineering Through Automata Learning (Q6488341) (← links)
- A new approach for active automata learning based on apartness (Q6535565) (← links)
