Laura Kovács

Laura Kovacs

Address:
Laura Kovács
Technische Universität Wien
Institut für Logic and Computation 192/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/

I am a full professor in computer science at the TU Wien, leading the automated program reasoning (APRe) group of the Formal Methods in Systems Engineering Division. I also hold a part-time professorship at the Department of Computer Science and Engineering of the Chalmers University of Technology.

My research focuses on 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. I am the co-developer of the Vampire theorem prover. In 2014, I received the Wallenberg Academy Fellowship and an ERC Starting Grant.

  • Curriculum Vitae: Download CV
  • List of Publications: Download publication list
  • Possible topics for master/bachelor thesis:
    • deductive verification (using e.g. Hoare logic, weakest preconditions);
    • automating the generation of program assertions, such as loop invariants and ranking functions;
    • static analysis of deterministic and probabilistic programs;
    • first-order theorem proving in support of software verification;
    • safety and relational verification.

Please visit my personal web-page at lkovacs.com for further and up-to-date details. 

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

Full news archive