Johannes Birgmeier

Current Status

I did my master’s thesis at the Forsyte until February 2014, and was employed here as a project assistant until August 2014. I’m leaving TU Vienna this fall and will start grad school at Stanford University. Starting from September 2014, you can reach me at “first letter of first name+first seven letters of last name+at+stanford+dot+edu”.

Research

I started working at the FORSYTE in March 2013.

I’m investigating possiblities to apply IC3-style incremental inductive verification to software state transition systems.

Publication

(singular, as for now ;))

Johannes Birgmeier, Aaron Bradley, Georg Weissenbacher. Counterexample to Induction-Guided Abstraction-Refinement (CTIGAR). Chapter in Computer Aided Verification, volume 8559 of Lecture Notes in Computer Science, pages 829-846, 2014, Springer Berlin Heidelberg. [bibtex]

Contact

Address:
Johannes Birgmeier
Technische Universität Wien
Institut für Informationssysteme 184/4
Favoritenstraße 9–11
1040 Wien
Austria

Room: HA 03 07 (how to get there)
Phone: +43 (1) 58801 –
Email: ta.etysrofnull@iemgrib
Web: http://forsyte.at/~birgmeier/

Photo of Johannes Birgmeier

Latest News

Helmut Veith Stipend 2017

Outstanding female students in the field of computer science who pursue (or plan to pursue) one of the master‘s programs in Computer Science at TU Wien taught in English are invited to apply for the Helmut Veith Stipend

Continue reading

Helmut Veith Stipend

The first recipient of the Helmut Veith Stipend for excellent female master’s students in computer science will be presented on March 14 at the following event: "More female students in computer science. Who cares?" Panel discussion with renowned scientists about diversity in STEM Studies March 14, 5:30pm, TU Wien The Helmut Veith Stipend is dedicated […]

Continue reading

WAIT 2016 in Vienna

The third WAIT workshop on induction is held between 17-18 November at the TU Wien. Details are available on the workshop page.

Continue reading

Two papers at POPL’17

Two papers co-authored by researchers from our group have been accepted for POPL’17: “Coming to Terms with Quantified Reasoning” by Simon Robillard, Andrei Voronkov, and Laura Kovacs; and “A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms” by Igor Konnov, Marijana Lazic, Helmut Veith, and Josef Widder

Continue reading

Full news archive