Laura Kovacs

Docent at Chalmers, Computer Science and Engineering (Chalmers), [Formella metoder]

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

Source: chalmers.se

Projects

2014–2017

GenPro: Generating and Proving Program Properties via Symbol Elimination

Laura Kovacs Software Technology (Chalmers)
Swedish Research Council (VR)

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

Publications

2017

Coming to Terms with Quantified Reasoning

Laura Kovacs, Andrei Voronkov, Simon Robillard
SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 52 (1), p. 260-270
Paper in proceedings
2017

Replacing Conjectures by Positive Knowledge: Inferring Proven Precise Worst-Case Execution Time Bounds Using Symbolic Execution

Jens Knoop, Laura Kovacs, Jakob Zwirchmayr
Journal of Symbolic Computation. Vol. 80, p. 101-124
Journal article
2017

Splitting proofs for interpolation

M. Suda, Laura Kovacs, B. Gleiss
Lecture Notes in Computer Science. Vol. 10395, p. 291-309
Paper in proceedings
2016

Symbolic Computation and Automated Reasoning for Program Analysis

Laura Kovacs
Lecture Notes in Computer Science. Vol. 9681, p. 20-27
Paper in proceedings
2016

A Clausal Normal Form Translation for FOOL

M. Suda, Evgenii Kotelnikov, Laura Kovacs et al
Proceedings of the 2nd Global Conference on Artificial Intelligence (GCAI). Vol. EasyChair EPiC Series in Computing volume 41
Paper in proceedings
2016

Proceedings of the 1st and 2nd Vampire Workshops

Laura Kovacs, Andrei Voronkov
Book
2016

The Vampire and the FOOL

Evgenii Kotelnikov, G. Reger, Andrei Voronkov et al
2016, p. 37-48
Paper in proceedings
2016

Theory-Specific Reasoning about Loops with Arrays using Vampire

Chen Yuting, Laura Kovacs, Simon Robillard
Proceedings of the 3rd Vampire Workshop. Vol. EPiC volume
Paper in proceedings
2015

Reasoning About Loops Using Vampire in KeY

Laura Kovacs, Wolfgang Ahrendt, Simon Robillard
Lecture Notes in Computer Science. Vol. 9450, p. 434-443
Paper in proceedings
2015

Segment Abstraction for Worst-Case Execution Time Analysis

A. Radhakrishna, P. Cerny, J. Zwirchmayr et al
Lecture Notes in Computer Science. Vol. 9032, p. 105-131
Paper in proceedings
2015

Special issue on symbolic computation in software science Foreword

B. Buchberger, A. Bouhoula, T. Kutsia et al
Journal of Symbolic Computation. Vol. 69 (1), p. 1-2
Scientific journal article - non peer reviewed
2015

Lingva: Generating and proving program properties using symbol elimination

I. Dragan, Laura Kovacs
Lecture Notes in Computer Science. Vol. 8974, p. 67-75
Paper in proceedings
2015

A First Class Boolean Sort in First-Order Theorem Proving and TPTP

A. Voronkov, Laura Kovacs, Evgenii Kotelnikov
Lecture Notes in Computer Science. Vol. 9150, p. 71-86
Paper in proceedings
2014

Supervisory Control of Discrete-Event Systems via IC3

Bengt Lennartson, Laura Kovacs, Mohammad Reza Shoaei
Lecture Notes in Computer Science. Vol. 8855, p. 252-266
Paper in proceedings
2014

Experimenting with SAT solvers in vampire

Laura Kovacs, A. Biere, I. Dragan et al
Lecture Notes in Computer Science. Vol. 8856, p. 431-442
Paper in proceedings
2014

Extensional crisis and proving identity

Laura Kovacs, B. Kragl, A. Gupta et al
Lecture Notes in Computer Science. Vol. 8837, p. 185-200
Paper in proceedings
2013

Bound Propagation for Arithmetic Reasoning in Vampire

Konstantin Korovin, Andrei Voronkov, Laura Kovacs et al
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
Paper in proceedings
2013

WCET Squeezing: On-Demand Feasibility Refinement for Proven Precise WCET-Bounds

Jakob Zwirchmayr, Laura Kovacs, Jens Knoop
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
Paper in proceedings
2013

A Parametric Interpolation Framework for First-Order Theories

Laura Kovacs, Natasha Sharygina, Simone Fulvio Rollini
Lecture Notes in Computer Science. Vol. LNCS 8265 (PART 1), p. 24-40
Paper in proceedings
2013

Special issue on Automated Specification and Verification of Web Systems

Rosario Pugliese, Laura Kovacs, Francesco Tiezzi et al
Journal of Logic and Algebraic Programming. Vol. 82 (8), p. 241-242
Scientific journal article - non peer reviewed
2013

The Inverse Method for Many-Valued Logics

Laura Kovacs, Andrei Voronkov, Andrei Mantsivoda
Lecture Notes in Computer Science. Vol. LNCS 8265 (PART 1), p. 12-23
Paper in proceedings
2013

First-Order Theorem Proving and Vampire

Laura Kovacs, A. Voronkov
Lecture Notes in Computer Science. Vol. LNCS 8044, p. 1-35
Paper in proceedings
2013

SmacC: A Retargetable Symbolic Execution Engine

Jakob Zwirchmayr, Jens Knoop, Armin Biere et al
Lecture Notes in Computer Science. Vol. LNCS 8172, p. 482-486
Paper in proceedings
2013

The Auspicious Couple: Symbolic Execution and WCET Analysis

Armin Biere, Laura Kovacs, Jens Knoop et al
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
Paper in proceedings
2013

Tree Interpolation in Vampire

Laura Kovacs, Regis Blanc, Bernhard Kragl et al
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
Paper in proceedings