I am a postdoctoral researcher at Uppsala University.
Previously, I completed my PhD at Radboud University Nijmegen before working as a Software Developer in industry for a brief period.
To find out more about me and my background, check my CV.
My work involves developing effective and (preferably) automated techniques for testing stateful systems, particularly network protocol implementations. These techniques have so far been based on model learning or symbolic execution.
My research interests lie in:
Below are some of the notable tools I made significant contributions to (and possibly still am).
I was lecturer for the following courses at Uppsala University:
I assisted with the following courses at Radboud University:
I am currently a official supervisor for PhD students Hooman Asadian and Fredrik Tåkvist. Over the course of my academic career, I supervised the following students towards completion of their Master's/Bachelor's theses:
A listing of all my scientific contributions:
|||Paul Fiterău-Broştean, Bengt Jonsson, Konstantinos Sagonas, and Fredrik Tåkvist. Automata-based automated detection of state machine bugs in protocol implementations. In NDSS, 2023. to appear. [ bib ][ pdf ]|
|||Paul Fiterău-Broştean, Bengt Jonsson, Konstantinos Sagonas, and Fredrik Tåkvist. DTLS-Fuzzer: A DTLS protocol state fuzzer. In 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), pages 456--458. IEEE, 2022. [ bib ][ pdf ]|
|||Hooman Asadian, Paul Fiterău-Broştean, Bengt Jonsson, and Konstantinos Sagonas. Applying symbolic execution to test implementations of a network protocol against its specification. In 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), pages 70--81. IEEE, 2022. [ bib ][ pdf ]|
|||Paul Fiterău-Broştean, Bengt Jonsson, Robert Merget, Joeri de Ruiter, Konstantinos Sagonas, and Juraj Somorovsky. Analysis of DTLS implementations using protocol state fuzzing. In 29th USENIX Security Symposium (USENIX Security 20), 2020. [ bib ][ pdf ][ presentation ]|
|||Paul Fiterău-Broştean. Active Model Learning for the Analysis of Network Protocols. PhD thesis, Radboud University Nijmegen, 2018. [ bib ][ pdf ]|
|||Rick Smetsers, Paul Fiterău-Broştean, and Frits Vaandrager. Model learning as a satisfiability modulo theories problem. In International Conference on Language and Automata Theory and Applications, pages 182--194. Springer, 2018. [ bib ][ pdf ]|
|||Paul Fiterău-Broştean and Falk Howar. Learning-based testing the sliding window behavior of TCP implementations. In Critical Systems: Formal Methods and Automated Verification, pages 185--200. Springer, 2017. [ bib ][ pdf ]|
|||Paul Fiterău-Broştean, Toon Lenaerts, Erik Poll, Joeri de Ruiter, Frits Vaandrager, and Patrick Verleg. Model learning and model checking of SSH implementations. In Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, SPIN 2017, pages 142--151. ACM, 2017. [ bib ][ pdf ]|
|||Paul Fiterău-Broştean, Ramon Janssen, and Frits Vaandrager. Combining model learning and model checking to analyze TCP implementations. In CAV 2016, volume 9780 of LNCS, pages 454--471. Springer, 2016. [ bib ][ pdf ]|
|||Fides Aarts, Paul Fiterău-Broştean, Harco Kuppens, and Frits Vaandrager. Learning register automata with fresh value generation. In ICTAC 2015, volume 9399 of LNCS, pages 165--183. Springer, 2015. [ bib ][ pdf ]|
|||Paul Fiterău-Broştean, Ramon Janssen, and Frits Vaandrager. Learning fragments of the TCP network protocol. In FMICS 2014, volume 8718 of LNCS, pages 78--93. Springer, 2014. [ bib ][ pdf ]|
I can be contacted at "fiteraup+at+yahoo+dot+com", or at my University email address, which currently is "paul+dot+fiterau_brostean+at+it+dot+uu+dot+se". I can also be reached via Skype, noting that my yahoo username is equal to my Skype username.
I love singing, staying informed (thanks BBC), gaming and just going for a walk. Also do running, more for keeping my health in check than for the love of it.
The publications section was generated with the help of bibtex2html 1.99.