Fides Aarts
Fides Aarts
Verified email at asml.com
Title
Cited by
Cited by
Year
Learning I/O Automata
F Aarts, F Vaandrager
International Conference on Concurrency Theory (CONCUR) 6269, 71-85, 2010
992010
Generating models of infinite-state communication protocols using regular inference with abstraction
F Aarts, B Jonsson, J Uijen
IFIP International Conference on Testing Software and Systems, 188-204, 2010
952010
Inference and abstraction of the biometric passport
F Aarts, J Schmaltz, F Vaandrager
International Symposium On Leveraging Applications of Formal Methods …, 2010
832010
Formal models of bank cards for free
F Aarts, J De Ruiter, E Poll
Software Testing, Verification and Validation Workshops (ICSTW), 2013 IEEE …, 2013
732013
Automata learning through counterexample guided abstraction refinement
F Aarts, F Heidarian, H Kuppens, P Olsen, F Vaandrager
International Symposium on Formal Methods, 10-27, 2012
632012
Generating models of infinite-state communication protocols using regular inference with abstraction
F Aarts, B Jonsson, J Uijen, F Vaandrager
Formal Methods in System Design 46 (1), 1-41, 2015
352015
Learning register automata with fresh value generation
F Aarts, P Fiterau-Brostean, H Kuppens, F Vaandrager
International Colloquium on Theoretical Aspects of Computing, 165-183, 2015
342015
Improving active Mealy machine learning for protocol conformance testing
F Aarts, H Kuppens, J Tretmans, F Vaandrager, S Verwer
Machine learning 96 (1-2), 189-224, 2014
252014
Learning and testing the bounded retransmission protocol
F Aarts, H Kuppens, J Tretmans, F Vaandrager, S Verwer
International Conference on Grammatical Inference, 4-18, 2012
252012
Algorithms for inferring register automata
F Aarts, F Howar, H Kuppens, F Vaandrager
International Symposium On Leveraging Applications of Formal Methods …, 2014
182014
Tomte: bridging the gap between active learning and real-world systems
FD Aarts
[Sl: sn], 2014
182014
A theory of history dependent abstractions for learning interface automata
F Aarts, F Heidarian, F Vaandrager
International Conference on Concurrency Theory, 240-255, 2012
122012
Inference and abstraction of communication protocols
F Aarts
62009
Formal models of banking cards for free
F Aarts, E Poll, J de Ruiter
Unpublished, 2012
42012
Establishing basis for learning algorithms
F Aarts, J Blom, T Bohlin, YF Chen, F Howar, B Jonsson, M Merten, ...
22010
Learning nondeterministic register automata using mappers
F Aarts, P Fiterau-Brostean, H Kuppens, F Vaandrager
Proc. ICTAC, 2015
12015
Timed automata are frequently used to model real-time systems. Their determinization is a key issue for several validation problems. However, not all timed automata can be …
S Ben-David, F Copty, D Fisman, S Ruah, F Aarts, B Jonsson, J Uijen, ...
Formal Methods in System Design 46 (1), 81-104, 2015
2015
Auomatically Learning a Model of the SSH2 Transport Layer
M van Nahmen, E Poll, F Aarts, J de Ruiter
2014
Constructing Formal Models through Automata Learning
F Aarts, F Heidarian, F Vaandrager
A Theory of Abstractions for Learning I/O Automata
F Aarts, F Heidarian, F Vaandrager
The system can't perform the operation now. Try again later.
Articles 1–20