Laura Kovacs is an associate professor of Formal Methods at the Department of Computer Science and Egineering at Chalmers University of Technology. Her research and teaching focuses on computer theorem proving and symbolic computation, and integrates program analysis techniques with new approaches to program assertion synthesis and automated reasoning. She is the co-developer of the award-winning theorem prover Vampire, with a special role on enhancing theorem prover with novel features for program analysis. She works interdisciplinary, bridging together computer science, mathematics and logic. She is a founding member of the Austrian Society for Rigorous Systems Engineering. Her scientific work was awarded by the European Resarch Council with an ERC Starting Grant 2014. Link to personal page

There might be more projects where Laura Kovacs participates, but you have to be logged in as a Chalmers employee to see them.

SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 52 (1), p. 260-270

Journal of Symbolic Computation. Vol. 80, p. 101-124

Lecture Notes in Computer Science. Vol. 10395, p. 291-309

Lecture Notes in Computer Science. Vol. 10629 LNCS, p. 115-130

Lecture Notes in Computer Science. Vol. 9681, p. 20-27

Proceedings of the 2nd Global Conference on Artificial Intelligence (GCAI). Vol. EasyChair EPiC Series in Computing volume 41

2016, p. 37-48

Proceedings of the 3rd Vampire Workshop. Vol. EPiC volume

Lecture Notes in Computer Science. Vol. 9450, p. 434-443

Journal of Symbolic Computation. Vol. 69 (1), p. 1-2

Lecture Notes in Computer Science. Vol. 9032, p. 105-131

Lecture Notes in Computer Science. Vol. 8974, p. 67-75

Lecture Notes in Computer Science. Vol. 9150, p. 71-86

Lecture Notes in Computer Science. Vol. 8856, p. 431-442

Lecture Notes in Computer Science. Vol. 8855, p. 252-266

Lecture Notes in Computer Science. Vol. 8837, p. 185-200

Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, September 23-26, 2013, Timisoara, Romania. Nikolaj Bjorner (editors), IEEE series, p. 169-176

Proceedings of the 21st International Conference on Real-Time Networks and Systems (RTNS 2013), October 17-18, 2013, Sophia Antipolis, France. Michel Auguin and Robert de Simone and Robert Davis and Emmanuel Grolleau (editors), ACM, p. 161-170

Journal of Logic and Algebraic Programming. Vol. 82 (8), p. 241-242

Lecture Notes in Computer Science. Vol. LNCS 8265 (PART 1), p. 24-40

Lecture Notes in Computer Science. Vol. LNCS 8265 (PART 1), p. 12-23

Lecture Notes in Computer Science. Vol. LNCS 8044, p. 1-35

Lecture Notes in Computer Science. Vol. LNCS 8172, p. 482-486

Proceedings of the 13th International Workshop on Worst-Case Execution Time Analysis (WCET 2013), July 9, 2013, Paris, France. Claire Maiza (editor), OASICS Series of Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. Vol. 30, p. 53-63

Proceedings of the 19th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-19), December 14-19, 2013, Stellenbosch, South Africa. Kenneth L. McMillan and Aart Middeldorp and Andrei Voronkov (editors), Springer Lecture Notes in Computer Science. Vol. LNCS 8312, p. 173-181