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

Opening of Vienna Center for Logic and Algorithms (VCLA) on Jan 25

The Vienna Center for Logic and Algorithms is an initiative of the Faculty of Informatics and funded by a three-year competitive grant of Vienna University of Technology. Embedded into the primary research area Computational Intelligence and the funding priority Computational Logic of the Faculty, the center is promoting international scientific collaboration in logic and algorithms. […]

Continue reading

Winter School on Verification

The Austrian Society for Rigorous Systems Engineering (ARiSE) and the Vienna Center for Logic and Algorithms (VCLA) are organizing a joint winter school on verification at Vienna University of Technology from 6-10 February 2012. Apart from ARiSE/VCLA students, the school will be open to outside students. Details are available from the VCLA website.

Continue reading

CfP: Workshop on Exploiting Concurrency Efficiently and Correctly (EC^2 2010)

The annual Workshop on Exploiting Concurrency Efficiently and Correctly (EC2) is a forum that brings together researchers working on formal methods for concurrency, and those working on advanced parallel applications. Its goal is to stimulate incubation of ideas leading to future concurrent system design an verification tools that are essential in the multi-core era.

Continue reading

Full news archive