CPA/Tiger is a predicate-abstraction based test input generator for C programs. It is based on the software model checking framework CPAchecker. Find more details in “Information Reuse for Multi-goal Reachability Analyses”.


Dirk Beyer

Dirk Beyer
University of Passau

Michael Tautschnig

Michael Tautschnig
University of London


ESOP’13 Presentation (21. March 2013)


You can find a small tutorial on CPA/Tiger here.


[3] On the Structure and Complexity of Rational Sets of Regular Languages
Andreas Holzer, Christian Schallhart, Michael Tautschnig, Helmut Veith
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India (Anil Seth, Nisheeth K. Vishnoi, eds.), volume 24 of LIPIcs, pages 377-388, 2013, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[2]On the Structure and Complexity of Rational Sets of Regular Languages
Andreas Holzer, Christian Schallhart, Michael Tautschnig, Helmut Veith
CoRR, volume abs/1305.6074, 2013.
[1] Information Reuse for Multi-goal Reachability Analyses
Dirk Beyer, Andreas Holzer, Michael Tautschnig, Helmut Veith
ESOP, pages 472-491, 2013.
[bibtex] [pdf] [doi]


Logo ARiSE Universität Passau Logo TU Wien


Andreas Holzer
Technische Universität Wien
Institut für Informationssysteme 184/4
Favoritenstraße 9–11
1040 Wien

Room: HD 03 13 (how to get there)
Phone: +43 (1) 58801 – 184 67
Email: ta.etysrofnull@rezloh

Latest News

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

Helmut Veith Stipend

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

LogicLounge in memoriam Helmut Veith

Will robots take away your job? In memory of Helmut Veith, this year’s Conference on Computer Aided Verification (CAV), which takes place in Toronto, will feature a LogicLounge on the effect of automation and artificial intelligence on our jobs.

Continue reading

Full news archive