Laura Kovacs

Publikationer (41)
Projekt (1)

Visar 41 publikationer

2020

Subsumption Demodulation in First-Order Theorem Proving

B. Gleiss, Laura Kovacs, Jakob Rath

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 12166 LNAI, p. 297-315

Paper i proceeding

2020

Superposition Reasoning about Quantified Bitvector Formulas

David Damestani, Laura Kovacs, Martin Suda

2019 21ST INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2019), p. 95-99

Paper i proceeding

2020

Induction with generalization in superposition reasoning

Márton Hajdú, Petra Hozzová, Laura Kovacs et al

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 12236 LNAI, p. 123-137

Paper i proceeding

2019

Interactive Visualization of Saturation Attempts in Vampire

B. Gleiss, Laura Kovacs, Lena Schnedlitz

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 11918 LNCS, p. 504-513

Paper i proceeding

2019

Foreword - Mathematics in Computer Science

James H. Davenport, Laura Kovacs, Daniela Zaharie

Mathematics in Computer Science. Vol. 13 (4), p. 459-460

Övrig text i vetenskaplig tidskrift

2019

Portfolio SAT and SMT Solving of Cardinality Constraints in Sensor Network Optimization

Gergely Kovasznai, Krisztian Gajdar, Laura Kovacs

Proceedings - 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2019, p. 85-91

Paper i proceeding

2019

Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops

Ezio Bartocci, Laura Kovacs, Miroslav Stankovič

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 11781 LNCS, p. 255-276

Paper i proceeding

2019

Verifying relational properties using trace logic

Gilles Barthes, Renate Eilers, Pamina Georgiou et al

Proceedings of the 19th Conference on Formal Methods in Computer-Aided Design, FMCAD 2019, p. 170-178

Paper i proceeding

2018

Loop Analysis by Quantification over Iterations

Bernhard Gleiss, Laura Kovacs, Simon Robillard

EPiC Series in Computing. Vol. 57, p. 381-399

Paper i proceeding

2018

Aligator.jl - A Julia Package for Loop Invariant Generation

Laura Kovacs, Maximillian Jaroschek, Andreas Humenberger

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 11006 LNAI (11006), p. 111-117

Paper i proceeding

2018

Invariant Generation for Multi-Path Loops with Polynomial Assignments

Laura Kovacs, Andreas Humenberger, Maximillian Jaroschek

Proceedings of the 19th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI). Vol. LNCS (10747), p. 226-246

Paper i proceeding

2018

A FOOLish Encoding of the Next State Relations of Imperative Programs

Evgenii Kotelnikov, Laura Kovacs, Andrei Voronkov

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 10900 LNAI, 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

Coming to terms with quantified reasoning

Laura Kovacs, Simon Robillard, Andrei Voronkov

ACM SIGPLAN Notices. Vol. 52 (1), p. 260-270

Artikel i vetenskaplig tidskrift

2017

Splitting proofs for interpolation

B. Gleiss, Laura Kovacs, M. Suda

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 10395 LNAI, 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 (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 10629 LNCS, p. 115-130

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

The Vampire and the FOOL

Evgenii Kotelnikov, Laura Kovacs, G. Reger et al

2016, p. 37-48

Paper i proceeding

2016

Proceedings of the 1st and 2nd Vampire Workshops

Laura Kovacs, Andrei Voronkov

Bok

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

2016

Symbolic Computation and Automated Reasoning for Program Analysis

Laura Kovacs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9681, p. 20-27

Paper i proceeding

2015

Special issue on symbolic computation in software science

A. Bouhoula, B. Buchberger, Laura Kovacs et al

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

Övrig text i vetenskaplig tidskrift

2015

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

Evgenii Kotelnikov, Laura Kovacs, A. Voronkov

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9150, p. 71-86

Paper i proceeding

2015

Reasoning About Loops Using Vampire in KeY

Wolfgang Ahrendt, Laura Kovacs, Simon Robillard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9450, p. 434-443

Paper i proceeding

2015

Lingva: Generating and proving program properties using symbol elimination

I. Dragan, Laura Kovacs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8974, p. 67-75

Paper i proceeding

2015

Segment Abstraction for Worst-Case Execution Time Analysis

P. Cerny, T. A. Henzinger, Laura Kovacs et al

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9032, p. 105-131

Artikel i vetenskaplig tidskrift

2014

Supervisory Control of Discrete-Event Systems via IC3

Mohammad Reza Shoaei, Laura Kovacs, Bengt Lennartson

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8855, p. 252-266

Artikel i vetenskaplig tidskrift

2014

Symbol elimination for automated generation of program properties

Laura Kovacs

Electronic Communications of the EASST. Vol. 70

Artikel i vetenskaplig tidskrift

2014

Experimenting with SAT solvers in vampire

A. Biere, I. Dragan, Laura Kovacs et al

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8856, p. 431-442

Artikel i vetenskaplig tidskrift

2014

Extensional crisis and proving identity

A. Gupta, Laura Kovacs, B. Kragl et al

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8837, p. 185-200

Paper i proceeding

2013

A Parametric Interpolation Framework for First-Order Theories

Laura Kovacs, Natasha Sharygina, Simone Fulvio Rollini

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8265 LNAI (PART 1), p. 24-40

Paper i proceeding

2013

The Auspicious Couple: Symbolic Execution and WCET Analysis

Armin Biere, Jens Knoop, Laura Kovacs et al

OpenAccess Series in Informatics. Vol. 30, p. 53-63

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

Övrig text 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

First-Order Theorem Proving and Vampire

Laura Kovacs, A. Voronkov

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8044 LNCS, p. 1-35

Paper i proceeding

2013

Proceedings of the 5th International Symposium on Symbolic Computation in Software Science (SCSS 2013)

Laura Kovacs, Temur Kutsia

Samlingsverk (redaktörskap)

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

2013

The Inverse Method for Many-Valued Logics

Laura Kovacs, Andrei Mantsivoda, Andrei Voronkov

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. LNCS 8265 (PART 1), p. 12-23

Paper i proceeding

2013

Bound Propagation for Arithmetic Reasoning in Vampire

I. Dragan, Konstantin Korovin, Laura Kovacs et al

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. Vol. 2013, p. 169-176

Paper i proceeding

2013

SmacC: A Retargetable Symbolic Execution Engine

Armin Biere, Jens Knoop, Laura Kovacs et al

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8172 LNAI, p. 482-486

Paper i proceeding

Ladda ner publikationslistor

Du kan ladda ner denna lista till din dator.

Filtrera och ladda ner publikationslista

Som inloggad användare hittar du ytterligare funktioner i MyResearch.

Du kan även exportera direkt till Zotero eller Mendeley genom webbläsarplugins. Dessa hittar du här:

Zotero Connector
Mendeley Web Importer

Tjänsten SwePub erbjuder uttag av Researchs listor i andra format, till exempel kan du få uttag av publikationer enligt Harvard och Oxford i .RIS, BibTex och RefWorks-format.

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.