Laura Kovacs

Biträdande professor vid Chalmers, Data- och informationsteknik, Formella metoder

Visar 29 publikationer

2018

A FOOLish Encoding of the Next State Relations of Imperative Programs

Evgenii Kotelnikov, Laura Kovacs, Andrei Voronkov
Lecture Notes in Computer Science, p. 405-421
Paper i proceeding
2017

Coming to Terms with Quantified Reasoning

Laura Kovacs, Simon Robillard, Andrei Voronkov
SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 52 (1), p. 260-270
Paper i proceeding
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
Artikel i vetenskaplig tidskrift
2017

Splitting proofs for interpolation

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

A supervisory control algorithm based on property-directed reachability

Koen Lindström Claessen, Jonatan Kilhamn, Laura Kovacs et al
Lecture Notes in Computer Science. Vol. 10629 LNCS, p. 115-130
Paper i proceeding
2016

Symbolic Computation and Automated Reasoning for Program Analysis

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

A Clausal Normal Form Translation for FOOL

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

Proceedings of the 1st and 2nd Vampire Workshops

Laura Kovacs, Andrei Voronkov
Bok
2016

The Vampire and the FOOL

Evgenii Kotelnikov, Laura Kovacs, G. Reger et al
2016, p. 37-48
Paper i proceeding
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 i proceeding
2015

Reasoning About Loops Using Vampire in KeY

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

Special issue on symbolic computation in software science Foreword

A. Bouhoula, B. Buchberger, Laura Kovacs et al
Journal of Symbolic Computation. Vol. 69 (1), p. 1-2
Artikel i övriga tidskrifter
2015

Segment Abstraction for Worst-Case Execution Time Analysis

P. Cerny, T. A. Henzinger, Laura Kovacs et al
Lecture Notes in Computer Science. Vol. 9032, p. 105-131
Paper i proceeding
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 i proceeding
2015

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

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

Supervisory Control of Discrete-Event Systems via IC3

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

Experimenting with SAT solvers in vampire

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

Extensional crisis and proving identity

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

Symbol elimination for automated generation of program properties

Laura Kovacs
Electronic Communications of the EASST. Vol. 70
Artikel i vetenskaplig tidskrift
2013

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

Jens Knoop, Laura Kovacs, Jakob Zwirchmayr
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 i proceeding
2013

Bound Propagation for Arithmetic Reasoning in Vampire

I. Dragan, Konstantin Korovin, 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 i proceeding
2013

Special issue on Automated Specification and Verification of Web Systems

Laura Kovacs, Rosario Pugliese, Josep Silva et al
Journal of Logic and Algebraic Programming. Vol. 82 (8), p. 241-242
Artikel i övriga tidskrifter
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 i proceeding
2013

First-Order Theorem Proving and Vampire

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

The Inverse Method for Many-Valued Logics

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

SmacC: A Retargetable Symbolic Execution Engine

Armin Biere, Jens Knoop, Laura Kovacs et al
Lecture Notes in Computer Science. Vol. LNCS 8172, p. 482-486
Paper i proceeding
2013

The Auspicious Couple: Symbolic Execution and WCET Analysis

Armin Biere, Jens Knoop, Laura Kovacs 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 i proceeding
2013

Tree Interpolation in Vampire

Regis Blanc, Ashutosh Gupta, Laura Kovacs 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 i proceeding

Spara referenser

Om du har installerat Zotero eller Mendeley på din dator kan du direkt ta ut referenser från de publikationer du ser i listan.

Du laddar ner dessa pluginer här:
Zotero
Mendeley

Visar 1 forskningsprojekt

2014–2017

GenPro: Generera och bevisa programegenskaper via symboleliminering

Laura Kovacs Programvaruteknik
Vetenskapsrådet (VR)

Det kan finnas fler projekt där Laura Kovacs medverkar, men du måste vara inloggad som anställd på Chalmers för att kunna se dem.