Laura Kovács

 

Laura Kovacs

» Full Professor

Laura Kovács is a full professor at the Faculty of Informatics of Vienna University of Technology (TU Vienna). She also holds a part-time position as associate professor at the Department of Computer Science and Engineering of the Chalmers University of Technology. She has a diploma in computer science and math from the West University of Timisoara, Romania and a PhD with highest distinction in computer science from the Research Institute of Symbolic Computation (RISC-Linz) of the Johannes Kepler University Linz, Austria. Prior to her appointment to Vienna, she was an associate professor at Chalmers.

In her research, Laura Kovács deals with the design and development of new theories, technologies, and tools for program analysis, with a particular focus on automated assertion generation, symbolic summation, computer algebra, and automated theorem proving. She is the co-developer of the Vampire theorem prover. In 2014, she received the Wallenberg Academy Fellowship and an ERC Starting Grant.

This page is still under construction. For more details, please visit the homepage of Laura Kovács at Chalmers.

Address:
Laura Kovács
Technische Universität Wien
Institut für Informationssysteme 184/4
Favoritenstraße 9–11
1040 Wien
Austria

Room: HG 03 15 (how to get there)
Phone: +43 (1) 58801 – 184 30
Email: ta.etysrofnull@scavokl
Web: http://forsyte.at/~kovacs/

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