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

Austrian Computer Science Day 2015

The Austrian Computer Science Day 2015, which takes place on October 15, features a range of talks by leading Austrian computer scientists, including topics such as computer games, augmented reality, aware systems, semantic web, business processes, and reliable systems. Register for free by October 7, 2015! This year’s speakers are: Alois Ferscha (JKU Linz) Tom […]

Continue reading

Helmut Veith receives CAV Award

The 2015 CAV Award is given to Edmund Clarke, Orna Grumberg, Ron Hardin, Zvi Harel, Somesh Jha, Robert Kurshan, Yuan Lu, and Helmut Veith for the development and implementation of the localization-reduction technique and the formulation of counterexample-guided abstraction refinement (CEGAR).

Continue reading

FRIDA’15

We had great talks at FRIDA’15 workshop in Grenoble. The slides of some of the talks are available online.

Continue reading

FRIDA’15 Program

Check the program of the 2nd workshop on Formal Reasoning in Distributed Algorithms at FORTE. We have a nice program this year.

Continue reading

Full news archive