Alexander Weinert

Alexander Weinert

About Me

I am a Ph.D. student in the Reactive Systems Group at the Computer Science Department at Saarland University.

Contact

Reactive Systems Group
Saarland University
Building: E 1.1, Room: 1.16.1
Phone: +49 681 302 5661
eMail: weinert at react.uni-saarland.de
Office Hours: Whenever the door is open

Presentations

  • Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
    Dec 13th, 2016, Brussels, Belgium, MFV Seminar. Slides. Handout.
  • Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time.
    Sep 16th, 2016, Catania, Italy, GandALF 2016. Slides. Handout.
  • Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
    Sep 9th, 2016, Brussels, Belgium, Highlights 2016. Slides. Handout.
  • Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
    Aug 31st, 2016, Marseille, France, CSL 2016. Slides. Handout.

Publications

[WZ16] Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
Joint work with Martin Zimmermann, CSL 2016.
[WZ15] Visibly Linear Dynamic Logic.
Joint work with Martin Zimmermann, FSTTCS 2016.
[TWZ15] Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time.
Joint work with Leander Tentrup and Martin Zimmermann, GandALF 2016.
[AWWA15] Automata Tutor and what we learned from building an online teaching tool.
Joint work with Loris D’Antoni, Matthew Weaver, and Rajeev Alur, BEATCS 117, October 2015.
[Wei15b] Analyzing Arithmetic Prolog Programs by Symbolic Execution.
Master Thesis, August 2015.
[Wei15a] Problem Generation for DFA Construction.
Technical Report UCB/EECS-2015-170, June 2015.

Teaching

Summer 2016 Assistant for the advanced lecture Infinite Games
Summer 2013 Tutor for the lecture Formale Systeme, Automaten, Prozesse at the Chair for Logic and Theory of Discrete Systems
Summer 2012 Tutor for the lecture Formale Systeme, Automaten, Prozesse at the Chair for Logic and Theory of Discrete Systems