Cargando…
Improving Symbolic Automata Learning with Concolic Execution
Inferring the input grammar accepted by a program is central for a variety of software engineering problems, including parsers verification, grammar-based fuzzing, communication protocol inference, and documentation. Sound and complete active learning techniques have been developed for several class...
Autores principales: | Clun, Donato, van Heerden, Phillip, Filieri, Antonio, Visser, Willem |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7418143/ http://dx.doi.org/10.1007/978-3-030-45234-6_1 |
Ejemplares similares
-
COASTAL: Combining Concolic and Fuzzing for Java (Competition Contribution)
por: Visser, Willem, et al.
Publicado: (2020) -
Legion: Best-First Concolic Testing (Competition Contribution)
por: Liu, Dongge, et al.
Publicado: (2020) -
Sound and Complete Concolic Testing for Higher-order Functions
por: You, Shu-Hung, et al.
Publicado: (2021) -
Learning Pomset Automata
por: van Heerdt, Gerco, et al.
Publicado: (2021) -
Coupled Relational Symbolic Execution for Differential Privacy
por: Farina, Gian Pietro, et al.
Publicado: (2021)