The following pages link to Mining specifications (Q5178894):
Displayed 17 items.
- Symbolic automata for representing big code (Q300407) (← links)
- Learning register automata: from languages to program structures (Q479461) (← links)
- Improving active Mealy machine learning for protocol conformance testing (Q479471) (← links)
- Verifying pointer safety for programs with unknown calls (Q604389) (← links)
- Active learning for extended finite state machines (Q736459) (← links)
- Learning deterministic probabilistic automata from a model checking perspective (Q1689574) (← links)
- A state-based model of sensor protocols (Q1758154) (← links)
- Generating models of infinite-state communication protocols using regular inference with abstraction (Q2018056) (← links)
- Concurrent Kleene algebra with observations: from hypotheses to completeness (Q2200836) (← links)
- Unbounded procedure summaries from bounded environments (Q2234080) (← links)
- Learning to verify branching time properties (Q2642669) (← links)
- Chosen-Ciphertext Security from Subset Sum (Q2798769) (← links)
- Inferring Canonical Register Automata (Q2891417) (← links)
- Discriminating Traces with Time (Q3303919) (← links)
- Polynomial Identification of $$\omega $$-Automata (Q5164178) (← links)
- Model Checking Merged Program Traces (Q5179356) (← links)
- Bootstrapping library-based synthesis (Q6164431) (← links)