Fundamental Approaches to Software Engineering

DOI10.1007/B107062zbMath1119.68366OpenAlexW2479217507MaRDI QIDQ5316435

Martin Leucker, Therese Berg, Bernhard Steffen, Olga Grinchtein, Harald Raffelt, Bengt Jonsson

Publication date: 13 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b107062

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Related Items (11)

Learning of event-recording automata ⋮ Model checking, synthesis, and learning ⋮ Never-stop context-free learning ⋮ Inferring Symbolic Automata ⋮ Learning deterministic one-clock timed automata via mutation testing ⋮ Learning Meets Verification ⋮ Evaluation and Comparison of Inferred Regular Grammars ⋮ Improving active Mealy machine learning for protocol conformance testing ⋮ A Context-Free Symbiosis of Runtime Verification and Automata Learning ⋮ The geometry of electron wave functions ⋮ Efficient active automata learning via mutation testing

This page was built for publication: Fundamental Approaches to Software Engineering