Laura Kovács

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 123

Top Venues

Publications

Simon Jeanteur, Laura Kovács, Matteo Maffei, Michael Rawson
CryptoVampire: Automated Reasoning for the Complete Symbolic Attacker Cryptographic Model. IACR Cryptol. ePrint Arch. 2024 (2024)
Sophie Rain, Lea Salome Brugger, Anja Petkovic Komel, Laura Kovács, Michael Rawson
Scaling Game-Theoretic Security Reasoning. CoRR (2024)
Pamina Georgiou, Márton Hajdú, Laura Kovács
Saturating Sorting without Sorts. LPAR (2024)
Márton Hajdú, Laura Kovács, Michael Rawson
Rewriting and Inductive Reasoning. LPAR (2024)
Thomas Hader, Daniela Kaufmann, Ahmed Irfan, Stéphane Graham-Lengrand, Laura Kovács
MCSat-based Finite Field Reasoning in the Yices2 SMT Solver. CoRR (2024)
Petra Hozzová, Laura Kovács, Chase Norman, Andrei Voronkov
Program Synthesis in Saturation. CoRR (2024)
Márton Hajdú, Laura Kovács, Michael Rawson, Andrei Voronkov
Reducibility Constraints in Superposition. IJCAR (1) (2024)
Robin Coutelier, Laura Kovács, Michael Rawson, Jakob Rath
SAT-Based Subsumption Resolution. CoRR (2024)
Sophie Rain, Lea Salome Brugger, Anja Petkovic Komel, Laura Kovács, Michael Rawson
Scaling CheckMate for Game-Theoretic Security. LPAR (2024)
Márton Hajdú, Laura Kovács, Michael Rawson
Rewriting and Inductive Reasoning. CoRR (2024)
Pamina Georgiou, Márton Hajdú, Laura Kovács
Saturating Sorting without Sorts. CoRR (2024)
Jakob Rath, Clemens Eisenhofer, Daniela Kaufmann, Nikolaj S. Bjørner, Laura Kovács
PolySAT: Word-level Bit-vector Reasoning in Z3. CoRR (2024)
Petra Hozzová, Daneshvar Amrollahi, Márton Hajdú, Laura Kovács, Andrei Voronkov, Eva Maria Wagner
Synthesis of Recursive Programs in Saturation. IJCAR (1) (2024)
Johannes Schoisswohl, Laura Kovács, Konstantin Korovin
VIRAS: Conflict-Driven Quantifier Elimination for Integer-Real Arithmetic. LPAR (2024)
Robin Coutelier, Mathias Fleury, Laura Kovács
Lazy Reimplication in Chronological Backtracking. SAT (2024)
Julian Müllner, Marcel Moosbrugger, Laura Kovács
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs. Proc. ACM Program. Lang. 8 (POPL) (2024)
Márton Hajdú, Petra Hozzová, Laura Kovács, Giles Reger, Andrei Voronkov
Getting Saturated with Induction. CoRR (2024)
S. Hitarth, George Kenison, Laura Kovács, Anton Varonka
Linear Loop Synthesis for Quadratic Invariants. STACS (2024)
Thomas Hader, Daniela Kaufmann, Ahmed Irfan, Stéphane Graham-Lengrand, Laura Kovács
MCSat-Based Finite Field Reasoning in the Yices2 SMT Solver (Short Paper). IJCAR (1) (2024)
Laura Kovács, Petra Hozzová, Márton Hajdú, Andrei Voronkov
Induction in Saturation. IJCAR (1) (2024)
Clemens Eisenhofer, Michael Rawson, Laura Kovács
Spanning Matrices via Satisfiability Solving. CoRR (2024)
George Kenison, Laura Kovács, Anton Varonka
From Polynomial Invariants to Linear Loops. CoRR (2023)
Laura Kovács
Symbolic Computation in Automated Program Reasoning. FM (2023)
Robin Coutelier, Laura Kovács, Michael Rawson, Jakob Rath
SAT-Based Subsumption Resolution. CADE (2023)
Marcel Moosbrugger, Julian Müllner, Laura Kovács
Automated Sensitivity Analysis for Probabilistic Loops. CoRR (2023)
Maximilian Jaroschek, Manuel Kauers, Laura Kovács
Lonely Points in Simplices. Discret. Comput. Geom. 69 (1) (2023)
S. Hitarth, George Kenison, Laura Kovács, Anton Varonka
Linear Loop Synthesis for Quadratic Invariants. CoRR (2023)
Thomas Hader, Daniela Kaufmann, Laura Kovács
SMT Solving over Finite Field Arithmetic. LPAR (2023)
Laura Kovács, Anton Varonka
What Else is Undecidable About Loops? RAMiCS (2023)
Daneshvar Amrollahi, Ezio Bartocci, George Kenison, Laura Kovács, Marcel Moosbrugger, Miroslav Stankovic
(Un)Solvable Loop Analysis. CoRR (2023)
Laura Kovács
Algebraic Reasoning for (Un)Solvable Loops (Invited Talk). MFCS (2023)
Laura Kovács
Algebra-Based Loop Analysis. ISSAC (2023)
Simon Jeanteur, Laura Kovács, Matteo Maffei, Michael Rawson
CryptoVampire: Automated Reasoning for the Complete Symbolic Attacker Cryptographic Model. CoRR (2023)
George Kenison, Laura Kovács, Anton Varonka
From Polynomial Invariants to Linear Loops. ISSAC (2023)
Ahmed Bhayat, Konstantin Korovin, Laura Kovács, Johannes Schoisswohl
Refining Unification with Abstraction. LPAR (2023)
Nikolaj S. Bjørner, Clemens Eisenhofer, Laura Kovács
Satisfiability Modulo Custom Theories in Z3. VMCAI (2023)
Thomas Hader, Daniela Kaufmann, Laura Kovács
SMT Solving over Finite Field Arithmetic. CoRR (2023)
Martina Landman, Sophie Rain, Laura Kovács, Gerald Futschek
Reshaping Unplugged Computer Science Workshops for Primary School Education. ISSEP (2023)
Clemens Eisenhofer, Laura Kovács, Michael Rawson
Embedding the Connection Calculus in Satisfiability Modulo Theories. AReCCa@TABLEAUX (2023)
Petra Hozzová, Laura Kovács, Chase Norman, Andrei Voronkov
Program Synthesis in Saturation. CADE (2023)
Clemens Eisenhofer, Ruba Alassaf, Michael Rawson, Laura Kovács
Non-Classical Logics in Satisfiability Modulo Theories. TABLEAUX (2023)
Lea Salome Brugger, Laura Kovács, Anja Petkovic Komel, Sophie Rain, Michael Rawson
CheckMate: Automated Game-Theoretic Security Reasoning. CCS (2023)
Marcel Moosbrugger, Julian Müllner, Laura Kovács
Automated Sensitivity Analysis for Probabilistic Loops. iFM (2023)
Julian Müllner, Marcel Moosbrugger, Laura Kovács
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs. CoRR (2023)
Sophie Rain, Georgia Avarikioti, Laura Kovács, Matteo Maffei
Towards a Game-Theoretic Security Analysis of Off-Chain Protocols. CSF (2023)
Konstantin Korovin, Laura Kovács, Giles Reger, Johannes Schoisswohl, Andrei Voronkov
ALASCA: Reasoning in Quantified Linear Arithmetic. TACAS (1) (2023)
Daneshvar Amrollahi, Ezio Bartocci, George Kenison, Laura Kovács, Marcel Moosbrugger, Miroslav Stankovic
Solving Invariant Generation for Unsolvable Loops. SAS (2022)
Miroslav Stankovic, Ezio Bartocci, Laura Kovács
Moment-based analysis of Bayesian network properties. Theor. Comput. Sci. 903 (2022)
Ahmad Karimi, Marcel Moosbrugger, Miroslav Stankovic, Laura Kovács, Ezio Bartocci, Efstathia Bura
Distribution Estimation for Probabilistic Loops. QEST (2022)
Marcel Moosbrugger, Miroslav Stankovic, Ezio Bartocci, Laura Kovács
This is the Moment for Probabilistic Loops. CoRR (2022)
Jakob Rath, Armin Biere, Laura Kovács
First-Order Subsumption via SAT Solving. FMCAD (2022)
Pamina Georgiou, Bernhard Gleiss, Ahmed Bhayat, Michael Rawson, Laura Kovács, Giles Reger
The Rapid Software Verification Framework. FMCAD (2022)
Andreas Humenberger, Daneshvar Amrollahi, Nikolaj S. Bjørner, Laura Kovács
Algebra-Based Reasoning for Loop Synthesis. CoRR (2022)
Marcel Moosbrugger, Miroslav Stankovic, Ezio Bartocci, Laura Kovács
This is the moment for probabilistic loops. Proc. ACM Program. Lang. 6 (OOPSLA2) (2022)
Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács
The probabilistic termination tool amber. Formal Methods Syst. Des. 61 (1) (2022)
Márton Hajdú, Petra Hozzová, Laura Kovács, Giles Reger, Andrei Voronkov
Getting Saturated with Induction. Principles of Systems Design (2022)
Andreas Humenberger, Daneshvar Amrollahi, Nikolaj S. Bjørner, Laura Kovács
Algebra-Based Reasoning for Loop Synthesis. Formal Aspects Comput. 34 (1) (2022)
Nikolaj S. Bjørner, Clemens Eisenhofer, Laura Kovács
User-Propagators for Custom Theories in SMT Solving. SMT (2022)
Márton Hajdú, Laura Kovács, Michael Rawson, Andrei Voronkov
The Vampire Approach to Induction (short paper). PAAR@IJCAR (2022)
Thomas Hader, Laura Kovács
An SMT Approach for Solving Polynomials over Finite Fields. SMT (2022)
Ahmed Bhayat, Pamina Georgiou, Clemens Eisenhofer, Laura Kovács, Giles Reger
Lemmaless Induction in Trace Logic. CICM (2022)
Daneshvar Amrollahi, Ezio Bartocci, George Kenison, Laura Kovács, Marcel Moosbrugger, Miroslav Stankovic
Solving Invariant Generation for Unsolvable Loops. CoRR (2022)
Johannes Schoisswohl, Laura Kovács
Automating Induction by Reflection. CoRR (2021)
Ezio Bartocci, Laura Kovács, Miroslav Stankovic
MORA - Automatic Generation of Moment-Based Invariants. CoRR (2021)
Petra Hozzová, Laura Kovács, Jakob Rath
Automated Generation of Exam Sheets for Automated Deduction. CICM (2021)
Neta Elad, Sophie Rain, Neil Immerman, Laura Kovács, Mooly Sagiv
Summing Up Smart Transitions. CoRR (2021)
Laura Kovács, Hanna Lachnitt, Stefan Szeider
Formalizing Graph Trail Properties in Isabelle/HOL. CoRR (2021)
Johannes Schoisswohl, Laura Kovács
Automating Induction by Reflection. LFMTP (2021)
Andreas Humenberger, Laura Kovács
Algebra-based Synthesis of Loops and their Invariants (Invited Paper). CoRR (2021)
Andreas Humenberger, Laura Kovács
Algebra-Based Synthesis of Loops and Their Invariants (Invited Paper). VMCAI (2021)
Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács
The Probabilistic Termination Tool Amber. CoRR (2021)
Neta Elad, Sophie Rain, Neil Immerman, Laura Kovács, Mooly Sagiv
Summing up Smart Transitions. CAV (1) (2021)
Márton Hajdú, Petra Hozzová, Laura Kovács, Johannes Schoisswohl, Andrei Voronkov
Inductive Benchmarks for Automated Reasoning. CICM (2021)
Sophie Rain, Zeta Avarikioti, Laura Kovács, Matteo Maffei
Towards a Game-Theoretic Security Analysis of Off-Chain Protocols. CoRR (2021)
Petra Hozzová, Laura Kovács, Andrei Voronkov
Integer Induction in Saturation. CADE (2021)
Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács
The Probabilistic Termination Tool Amber. FM (2021)
Márton Hajdú, Petra Hozzová, Laura Kovács, Andrei Voronkov
Induction with Recursive Definitions in Superposition. FMCAD (2021)
Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács
Automated Termination Analysis of Polynomial Probabilistic Programs. ESOP (2021)
Ezio Bartocci, Laura Kovács, Miroslav Stankovic
Mora - Automatic Generation of Moment-Based Invariants. TACAS (1) (2020)
Ezio Bartocci, Laura Kovács, Miroslav Stankovic
Analysis of Bayesian Networks via Prob-Solvable Loops. CoRR (2020)
Bernhard Gleiss, Laura Kovács, Lena Schnedlitz
Interactive Visualization of Saturation Attempts in Vampire. CoRR (2020)
Bernhard Gleiss, Laura Kovács, Jakob Rath
Subsumption Demodulation in First-Order Theorem Proving. IJCAR (1) (2020)
Laura Kovács, Hanna Lachnitt, Stefan Szeider
Formalizing Graph Trail Properties in Isabelle/HOL. CICM (2020)
Márton Hajdú, Petra Hozzová, Laura Kovács, Johannes Schoisswohl, Andrei Voronkov
Induction with Generalization in Superposition Reasoning. CICM (2020)
Ezio Bartocci, Laura Kovács, Miroslav Stankovic
Analysis of Bayesian Networks via Prob-Solvable Loops. ICTAC (2020)
Andreas Humenberger, Nikolaj Bjørner, Laura Kovács
Algebra-Based Loop Synthesis. IFM (2020)
Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács
Automated Termination Analysis of Polynomial Probabilistic Programs. CoRR (2020)
Pamina Georgiou, Bernhard Gleiss, Laura Kovács
Trace Logic for Inductive Loop Reasoning. CoRR (2020)
Bernhard Gleiss, Laura Kovács, Jakob Rath
Subsumption Demodulation in First-Order Theorem Proving. CoRR (2020)
Pamina Georgiou, Bernhard Gleiss, Laura Kovács
Trace Logic for Inductive Loop Reasoning. FMCAD (2020)
Andreas Humenberger, Laura Kovács
Algebra-based Loop Synthesis. CoRR (2020)
Pascal Schreck, Tetsuo Ida, Laura Kovács
Foreword - Formalization of geometry, automated and interactive geometric reasoning. Ann. Math. Artif. Intell. 85 (2-4) (2019)
Ezio Bartocci, Laura Kovács, Miroslav Stankovic
Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops. CoRR (2019)
Ezio Bartocci, Laura Kovács, Miroslav Stankovic
Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops. ATVA (2019)
Maximilian Jaroschek, Manuel Kauers, Laura Kovács
Lonely Points in Simplices. CoRR (2019)
Gilles Barthe, Renate Eilers, Pamina Georgiou, Bernhard Gleiss, Laura Kovács, Matteo Maffei
Verifying Relational Properties using Trace Logic. CoRR (2019)
Gilles Barthe, Renate Eilers, Pamina Georgiou, Bernhard Gleiss, Laura Kovács, Matteo Maffei
Verifying Relational Properties using Trace Logic. FMCAD (2019)
David Damestani, Laura Kovács, Martin Suda
Superposition Reasoning about Quantified Bitvector Formulas. SYNASC (2019)
Gergely Kovásznai, Krisztián Gajdár, Laura Kovács
Portfolio SAT and SMT Solving of Cardinality Constraints in Sensor Network Optimization. SYNASC (2019)
James H. Davenport, Laura Kovács, Daniela Zaharie
Foreword. Math. Comput. Sci. 13 (4) (2019)

Laura Kovács.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Laura Kovács