Improving Symbolic Automata Learning with Concolic Execution

DOI10.1007/978-3-030-45234-6_1MaRDI QIDQ5039526zbMATH OpenOpenAlexFDO

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

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) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Learning symbolic automata
• The learnability of symbolic automata
• A Context-Free Symbiosis of Runtime Verification and Automata Learning
• Inferring Symbolic Automata
• Automata Learning through Counterexample Guided Abstraction Refinement
• A generic algorithm for learning symbolic automata from membership queries
• Benchmarks for automata learning and conformance testing
• Automata learning with automated alphabet abstraction refinement
• Automatic symbolic compositional verification by learning assumptions

Cites work

• Automata-based model counting for string constraints
• Grammatical inference. Learning automata and grammars.
• Learning regular sets from queries and counterexamples
• Learning symbolic automata
• Qex: symbolic SQL query explorer
• Queries and concept learning
• The learnability of symbolic automata
• The power of symbolic automata and transducers
• Topics in Grammatical Inference

Cited in

(3)

• Sigma*
• Automata Learning through Counterexample Guided Abstraction Refinement
• Harnessing static analysis to help learn pseudo-inverses of string manipulating procedures for automatic test generation

Describes a project that uses

Uses Software

• CUTE
• z3
• DART
• Rex
• GitHub

This page was built for publication: Improving Symbolic Automata Learning with Concolic Execution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039526)