Publikationen von Daniel Neider

Alle Publikationen

[GLMN13b] Pranav Garg, Christof Löding, P. Madhusudan, and Daniel Neider. Learning universally quantified invariants of linear data structures. In Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings, volume 8044 of Lecture Notes in Computer Science, pages 813-829. Springer, 2013.
[ pdf | Abstract ]
[GLMN13a] Pranav Garg, Christof Löding, P. Madhusudan, and Daniel Neider. ICE: A Robust Learning Framework for Synthesizing Invariants. Technical report, RWTH Aachen University and University of Illinois at Urbana-Champaign, 2013.
[ pdf | Abstract ]
[NJ13] Daniel Neider and Nils Jansen. Regular Model Checking Using Solver Technologies and Automata Learning. In Proceedings of the 5th International NASA Formal Methods Symposium (NFM 2013), volume 7871 of Lecture Notes in Computer Science, pages 16-31. Springer, 2013.
[ pdf | Abstract ]
[LN12] Martin Leucker and Daniel Neider. Learning Minimal Deterministic Automata from Inexperienced Teachers. In Proceedings of the 5th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2012), volume 7609 of Lecture Notes in Computer Science, pages 524-538. Springer, 2012.
[ pdf | Abstract ]
[Nei12] Daniel Neider. Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers. In Proceedings of the 10th International Symposium on Automated Technology for Verification and Analysis (ATVA 2012), volume 7561 of Lecture Notes in Computer Science, pages 354-369. Springer, 2012.
[ pdf | Abstract ]
[NRZ12] D. Neider, R. Rabinovich, and M. Zimmermann. Down the Borel Hierarchy: Solving Muller Games via Safety Games. In M. Faella and A. Murano, editors, Proceedings of the Third International Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2012, volume 96 of Electronic Proceedings in Theoretical Computer Science, pages 169-182, 2012.
[ pdf | ps | Abstract ]
[Nei11] Daniel Neider. Small Strategies for Safety Games. In Proceedings of the 9th Symposium on Automated Technology for Verification and Analysis (ATVA 2011), volume 6996 of Lecture Notes in Computer Science, pages 306-320. Springer, 2011.
[ pdf | Abstract ]
[NRZ11] D. Neider, R. Rabinovich, and M. Zimmermann. Solving Muller Games via Safety Games. Technical Report AIB-2011-14, RWTH Aachen, 2011.
[ pdf | ps | Abstract ]
[BKK+10] Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker, Daniel Neider, and David R. Piegdon. libalf: The Automata Learning Framework. In Proceedings of the 22nd International Conference on Computer Aided Verification (CAV 2010), volume 6174 of Lecture Notes in Computer Science, pages 360-364. Springer, 2010.
[ pdf | Abstract ]
[Nei10] Daniel Neider. Reachability Games on Automatic Graphs. In Proceedings of the 15th International Conference on Implementation and Application of Automata (CIAA 2010), volume 6482 of Lecture Notes in Computer Science, pages 222-230. Springer, 2010.
[ pdf | Abstract ]
[NL10] Daniel Neider and Christof Löding. Learning Visibly One-Counter Automata in Polynomial Time. Technical Report AIB-2010-02, RWTH Aachen, January 2010.
[ pdf | ps | Abstract ]
[Nei08] Daniel Neider. Lernverfahren für Automaten über linearisierten XML-Dokumenten. In Informatik Spektrum. Springer, 2008. (c) Springer.
[ pdf | Abstract ]
[Nei07] D. Neider. Learning Automata for Streaming XML Documents. Diploma thesis, RWTH Aachen, 2007.
[ pdf | ps ]