Improving Symbolic Automata Learning with Concolic Execution

DOI10.1007/978-3-030-45234-6_1OpenAlexW3020208362MaRDI QIDQ5039526

Willem Visser, Phillip van Heerden, Donato Clun, Antonio Filieri

Publication date: 13 October 2022

Published in: Fundamental Approaches to Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-45234-6_1

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Uses Software

• CUTE
• z3
• DART
• Rex
• GitHub

Cites Work

• Unnamed Item
• Learning regular sets from queries and counterexamples
• Automata-based model counting for string constraints
• The power of symbolic automata and transducers
• Queries and concept learning
• Topics in Grammatical Inference
• Qex: Symbolic SQL Query Explorer
• Learning Symbolic Automata
• The learnability of symbolic automata