Automated Reasoning with Theories and Induction for Software Technology

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Risultati finali

Data Management Plan

Data management plan detailing collection/processing/storing project data

Pubblicazioni

Program Synthesis in Saturation

Autori: Petra Hozzová, Laura Kovács, Chase Norman and Andrei Voronkov
Pubblicato in: Proceedings of the 29th International Conference on Automated Deduction (CADE), 2023, Pagina/e 307-324
Editore: Springer
DOI: 10.1007/978-3-031-38499-8_18

The Membership Problem for Hypergeometric Sequences with Quadratic Parameters

Autori: George Kenison; Klara Nosan; Mahsa Shirmohammadi; James Worrell
Pubblicato in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (ISSAC), 2023, Pagina/e 407-416
Editore: ACM
DOI: 10.1145/3597066.3597121

CheckMate: Automated Game-Theoretic Security Reasoning

Autori: Lea Salome Brugger; Laura Kovács; Anja Petkovic Komel; Sophie Rain; Michael Rawson
Pubblicato in: CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023, Pagina/e 1407–1421
Editore: ACM
DOI: 10.1145/3576915.3623183

Saturating Sorting without Sorts

Autori: Pamina Georgiou, Márton Hajdú, Laura Kovács
Pubblicato in: Proceedings of 25th Conference on Logic for Programming, Arti cial Intelligence and Reasoning (LPAR-25), Numero volume 100 of EPiC, 2024, Pagina/e 88-105
Editore: EasyChair
DOI: 10.29007/rg9z

Superposition with Delayed Unification

Autori: Ahmed Bhayat, Johannes Schoisswohl, Michael Rawson
Pubblicato in: Proceedings of the 29th International Conference on Automated Deduction (CADE), 2023
Editore: Springer
DOI: 10.1007/978-3-031-38499-8_2

The RAPID Software Verification Framework

Autori: Pamina Georgiou, Bernhard Gleiss, Ahmed Bhayat, Michael Rawson, Laura Kovacs, Giles Reger
Pubblicato in: Proceedings of the 22nd Conference on Formal Methods in Computer-Aided Design (FMCAD), 2022, Pagina/e 255-260
Editore: TU Wien Academic Press
DOI: 10.34727/2022/isbn.978-3-85448-053-2_32

CryptoVampire: Automated Reasoning for the Complete Symbolic Attacker Cryptographic Model

Autori: Jeanteur, Simon; Kovács, Laura; Maffei, Matteo; Rawson, Michael
Pubblicato in: Proceedings of the 2024 IEEE Symposium on Security and Privacy (SP), 2024, ISBN 979-8-3503-3130-1
Editore: IEEE
DOI: 10.48550/arxiv.2305.12173

Synthesis of Recursive Programs in Saturation

Autori: Petra Hozzová, Daneshvar Amrollahi, Márton Hajdú, Laura Kovács, Andrei Voronkov, Eva Maria Wagner
Pubblicato in: Proceedings of the International Joint Conference on Automated Reasoning (IJCAR), Numero volume 14739 of LNCS, 2024, Pagina/e 154-171
Editore: Springer
DOI: 10.1007/978-3-031-63498-7_10

Rewriting and Inductive Reasoning

Autori: Márton Hajdu, Laura Kovács, Michael Rawson
Pubblicato in: Proceedings of 25th Conference on Logic for Programming, Arti cial Intelligence and Reasoning (LPAR-25), Numero volume 100 of EPiC, 2024, Pagina/e 278-294
Editore: EasyChair
DOI: 10.29007/vbfp

This Is the Moment for Probabilistic Loops

Autori: Marcel Moosbrugger; Miroslav Stankovic; Laura Kovacs; Ezio Bartocci
Pubblicato in: Proceedings of the ACM on Programming Languages - OOPSLA, Numero Volume 6, Numero OOPSLA2, Article No.178, 2022, Pagina/e 1497-1525
Editore: ACM
DOI: 10.48550/arxiv.2204.07185

Embedding the Connection Calculus in Satisfiability Modulo Theories

Autori: Clemens Eisenhofer, Laura Kovacs and Michael Rawson
Pubblicato in: Proceedings of the 1st International Workshop on Automated Reasoning with Connection Calculi (AReCCa 2023), Numero 3613, 2023, Pagina/e 54-63
Editore: CEUR
DOI: 10.34726/5394

The Probabilistic Termination Tool Amber

Autori: Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács
Pubblicato in: Proceedings of the 24th International Symposium on Formal Methods (FM), Numero Lecture Notes in Computer Science, volume 13047, 2021, Pagina/e 667-675
Editore: Springer
DOI: 10.1007/978-3-030-90870-6_36

Positivity Problems for Reversible Linear Recurrence Sequences

Autori: George Kenison, Joris Nieuwveld, Joël Ouaknine, James Worrell
Pubblicato in: Proceedings of the 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), Numero volume 261 of LIPIcs, 2023, Pagina/e 130:1-130:17
Editore: LIPIcs
DOI: 10.4230/lipics.icalp.2023.130

From Polynomial Invariants to Linear Loops

Autori: George Kenison; Laura Kovács; Anton Varonka
Pubblicato in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (ISSAC), 2023, Pagina/e 398--406
Editore: ACM
DOI: 10.1145/3597066.3597109

Integer Induction in Saturation

Autori: Petra Hozzová, Laura Kovács, Andrei Voronkov
Pubblicato in: Proceedings of the 28th International Conference on Automated Deduction (CADE), Numero Lecture Notes in Computer Science, volume 12699, 2021, Pagina/e 361-377
Editore: Springer
DOI: 10.1007/978-3-030-79876-5_21

Linear Loop Synthesis for Quadratic Invariants

Autori: S. Hitarth, George Kenison, Laura Kovacs, Anton Varonka
Pubblicato in: Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), Numero Volume 289, 2024, Pagina/e 41:1-41:18
Editore: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.stacs.2024.41

SAT-Based Subsumption Resolution

Autori: Robin Coutelier, Laura Kovács, Michael Rawson, Jakob Rath
Pubblicato in: Proceedings of the 29th International Conference on Automated Deduction (CADE), 2023, Pagina/e 190-206
Editore: Springer
DOI: 10.1007/978-3-031-38499-8_11

Inductive Benchmarks for Automated Reasoning

Autori: Márton Hajdu, Petra Hozzová, Laura Kovács, Johannes Schoisswohl, Andrei Voronkov
Pubblicato in: Proceedings of the 14th International Conference on Intelligent Computer Mathematics (CICM), Numero Lecture Notes in Computer Science, volume 12833, 2021, Pagina/e 124-129
Editore: Springer
DOI: 10.1007/978-3-030-81097-9_9

On the Skolem Problem for Reversible Sequences

Autori: George Kenison
Pubblicato in: Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS), Numero LIPIcs, volume 241, 2022, Pagina/e 61:1-61:15
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2022.61

Reshaping Unplugged Computer Science Workshops for Primary School Education

Autori: Martina Landman, Sophie Rain, Laura Kovács, Gerald Futschek
Pubblicato in: Proceedings of the 6th International Conference on Informatics in Schools: Situation, Evolution, and Perspectives (ISSEP), 2023, Pagina/e 139-151
Editore: Springer
DOI: 10.1007/978-3-031-44900-0_11

Algebra-Based Loop Analysis

Autori: Laura Kovács
Pubblicato in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (ISSAC), 2023, Pagina/e 41-42
Editore: ACM
DOI: 10.1145/3597066.3597150

Distribution Estimation for Probabilistic Loops

Autori: Ahmad Karimi, Marcel Moosbrugger, Miroslav Stankovic, Laura Kovács, Ezio Bartocci, Efstathia Bura
Pubblicato in: Proceedings of the 19th International Conference on Quantitative Evaluation of Systems (QEST), Numero Lecture Notes in Computer Science, volume 13479, 2022, Pagina/e 26-42
Editore: Springer
DOI: 10.1007/978-3-031-16336-4_2

Lemmaless Induction in Trace Logic

Autori: Ahmed Bhayat, Pamina Georgiou, Clemens Eisenhofer, Laura Kovács, Giles Reger
Pubblicato in: Proceedings of the 15th International Conference on Intelligent Computer Mathematics (CICM), Numero Lecture Notes in Computer Science, volume 13467, 2022, Pagina/e 191-208
Editore: Springer
DOI: 10.1007/978-3-031-16681-5_14

Induction with Recursive Definitions in Superposition

Autori: Márton Hajdu, Petra Hozzová, Laura Kovács, Andrei Voronkov
Pubblicato in: Proceedings of the 21st International Conference on Formal Methods in Computer Aided Design (FMCAD), 2021, Pagina/e 1-10
Editore: IEEE
DOI: 10.34727/2021/isbn.978-3-85448-046-4_34

Refining Unification with Abstraction

Autori: Ahmed Bhayat; Konstantin Korovin; Laura Kovacs; Johannes Schoisswohl
Pubblicato in: Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Numero Volume 94, 2023, Pagina/e 36-47
Editore: EasyChair
DOI: 10.29007/h65j

Non-Classical Logics in Satisfiability Modulo Theories

Autori: Clemens Eisenhofer, Ruba Alassaf, Michael Rawson, Laura Kovács
Pubblicato in: Proceedings of the 32nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX), 2023, Pagina/e 24-36
Editore: Springer
DOI: 10.1007/978-3-031-43513-3_2

Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs

Autori: Julian Müllner, Marcel Moosbrugger, Laura Kovács
Pubblicato in: Proceedings of the ACM on Programming Languages (POPL), Numero Volume 8, 2024, Pagina/e 882-910
Editore: ACM
DOI: 10.1145/3632872

Towards a Game-Theoretic Security Analysis of Off-Chain Protocols

Autori: Rain, Sophie; Avarikioti, Georgia; Kovács, Laura; Maffei, Matteo
Pubblicato in: Proceedings of the 36th IEEE Computer Security Foundations Symposium (CSF), 2023, Pagina/e 107-122
Editore: IEEE
DOI: 10.1109/csf57540.2023.00003

Solving Invariant Generation for Unsolvable Loops

Autori: Daneshvar Amrollahi, Ezio Bartocci, George Kenison, Laura Kovács, Marcel Moosbrugger, Miroslav Stankovic
Pubblicato in: Proceedings of the 29th International Symposium on Static Analysis (SAS), Numero Lecture Notes in Computer Science, volume 13790, 2022, Pagina/e 19-43
Editore: Springer
DOI: 10.1007/978-3-031-22308-2_3

Summing Up Smart Transitions

Autori: Neta Elad, Sophie Rain, Neil Immerman, Laura Kovács and Mooly Sagiv
Pubblicato in: Proceedings of the 33rd International Conference on Computer Aided Verification (CAV), Numero Lecture Notes in Computer Science, Volume 12759, 2021, Pagina/e 317-340
Editore: Springer
DOI: 10.1007/978-3-030-81685-8_15

Reuse of Introduced Symbols in Automatic Theorem Provers (short paper)

Autori: Michael Rawson, Martin Suda, Petra Hozzová, Giles Reger
Pubblicato in: Proceedings of the Workshop on Practical Aspects of Automated Reasoning (PAAR), Numero CEUR Workshop Proceedings, volume 3201, 2022
Editore: CEUR-WS.org

Automated Sensitivity Analysis for Probabilistic Loops

Autori: Moosbrugger, Marcel; Müllner, Julian; Kovács, Laura
Pubblicato in: Proceedings of the 18th International Conference on integrated Formal Methods (iFM), 2023, Pagina/e 21-39
Editore: Springer
DOI: 10.1007/978-3-031-47705-8_2

A Formalization of Heisenbugs and Their Causes

Autori: Sarah Sallinger, Georg Weissenbacher, Florian Zuleger
Pubblicato in: Proceedings of the International Conference on Software Engineering and Formal Methods (SEFM), 2023, Pagina/e 282–300
Editore: Springer
DOI: 10.1007/978-3-031-47115-5_16

ALASCA: Reasoning in Quantified Linear Arithmetic

Autori: Konstantin Korovin, Laura Kovács, Giles Reger, Johannes Schoisswohl, Andrei Voronkov
Pubblicato in: Proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2023, Pagina/e 647-665
Editore: Springer
DOI: 10.1007/978-3-031-30823-9_33

The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters

Autori: George Kenison
Pubblicato in: Proceedings of the 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Numero Volume 297 of LIPIcs, 2024, Pagina/e 145:1-145:20
Editore: LIPIcs
DOI: 10.4230/lipics.icalp.2024.145

Overapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification

Autori: Petra Hozzová; Jaroslav Bendík; Alexander Nutz; Yoav Rodeh
Pubblicato in: Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Numero Volume 94, 2023, Pagina/e 257--269
Editore: EasyChair
DOI: 10.29007/h4p7

Getting Saturated with Induction

Autori: Márton Hajdu, Petra Hozzová, Laura Kovács, Giles Reger, Andrei Voronkov
Pubblicato in: Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday, Numero Lecture Notes in Computer Science, volume13660, 2022, Pagina/e 306-322
Editore: Springer
DOI: 10.1007/978-3-031-22337-2_15

VIRAS: Conflict-Driven Quantifier Elimination for Integer-Real Arithmetic

Autori: Johannes Schoisswohl, Laura Kovács, Konstantin Korovin
Pubblicato in: Proceedings of 25th Conference on Logic for Programming, Arti cial Intelligence and Reasoning (LPAR-25), Numero volume 100 of EPiC, 2024, Pagina/e 147-164
Editore: EasyChair
DOI: 10.29007/kg4v

Lazy Reimplication in Chronological Backtracking

Autori: Robin Coutelier, Mathias Fleury, Laura Kovács
Pubblicato in: Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024), Numero 305, 2024, Pagina/e 9:1-9:19
Editore: Leibniz International Proceedings in Informatics, Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.sat.2024.9

The Vampire Approach to Induction (short paper)

Autori: Márton Hajdu, Laura Kovács, Michael Rawson, Andrei Voronkov
Pubblicato in: Proceedings of the Workshop on Practical Aspects of Automated Reasoning (PAAR), Numero CEUR Workshop Proceedings, volume 3201, 2022
Editore: CEUR-WS.org

Lemmas: Generation, Selection, Application

Autori: Rawson, Michael; Wernhard, Christoph; Zombori, Zsolt; Bibel, Wolfgang
Pubblicato in: Proceedings of the 32nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX), 2023, Pagina/e 153-174
Editore: Springer
DOI: 10.1007/978-3-031-43513-3_9

Induction in Saturation

Autori: Laura Kovács, Petra Hozzová, Márton Hajdú, Andrei Voronkov
Pubblicato in: Proceedings of the International Joint Conference on Automated Reasoning (IJCAR), Numero volume 14739 of LNCS, 2023, Pagina/e 21-29
Editore: Springer
DOI: 10.1007/978-3-031-63498-7_2

What’s decidable about linear loops?

Autori: Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Anton Varonka, Markus A. Whiteland, James Worrell
Pubblicato in: Proceedings of the ACM on Programming Languages, Numero volume 6, number POPL, 2022, Pagina/e 1-25
Editore: ACM
DOI: 10.1145/3498727

Satisfiability Modulo Custom Theories in Z3

Autori: Nikolaj S. Bjørner, Clemens Eisenhofer, Laura Kovács:
Pubblicato in: Proceedings of the 24th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), Numero Lecture Notes in Computer Science, volume 13881, 2023, Pagina/e 91-105
Editore: Springer
DOI: 10.1007/978-3-031-24950-1_5

User-Propagators for Custom Theories in SMT Solving

Autori: Nikolaj S. Bjørner, Clemens Eisenhofer, Laura Kovács
Pubblicato in: Proceedings of the 20th International Workshop on Satisfiability Modulo Theories (SMT_, Numero CEUR Workshop Proceedings, volume 3185, 2022, Pagina/e 71-79
Editore: CEUR-WS.org

On Positivity and Minimality for Second-Order Holonomic Sequences

Autori: George Kenison, Oleksiy Klurman, Engel Lefaucheux, Florian Luca, Pieter Moree, Joël Ouaknine, Markus A. Whiteland, James Worrell
Pubblicato in: Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science (MFCS), Numero LIPIcs, volume 202, 2021, Pagina/e 67:1--67:15
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2021.67

An SMT Approach for Solving Polynomials over Finite Fields

Autori: Thomas Hader and Laura Kovács
Pubblicato in: Proceedings of the 20th International Workshop on Satisfiability Modulo Theories (SMT), Numero CEUR Workshop Proceedings, volume 3185, 2022, Pagina/e 90-98
Editore: CEUR-WS.org

Automating Induction by Reflection

Autori: Johannes Schoisswohl, Laura Kovács
Pubblicato in: Proceedings of the 16th Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP), Numero EPTCS volume 337, 2021, Pagina/e 39-54
Editore: EPTCS
DOI: 10.4204/eptcs.337.4

Reducibility Constraints in Superposition

Autori: Márton Hajdú, Laura Kovács, Michael Rawson, Andrei Voronkov
Pubblicato in: Proceedings of the International Joint Conference on Automated Reasoning (IJCAR), Numero volume 14739 of LNCS, 2024, Pagina/e 115-132
Editore: Springer
DOI: 10.1007/978-3-031-63498-7_8

Moment-based Invariants for Probabilistic Loops with Non-polynomial Assignments

Autori: Andrey Kofnov, Marcel Moosbrugger, Miroslav Stankovic, Ezio Bartocci, Efstathia Bura
Pubblicato in: Proceedings of the 19th International Conference on Quantitative Evaluation of Systems (QEST), Numero Lecture Notes in Computer Science, volume 13479, 2022, Pagina/e 3-25
Editore: Springer
DOI: 10.1007/978-3-031-16336-4_1

Automated Generation of Exam Sheets for Automated Deduction

Autori: Petra Hozzová, Laura Kovács, Jakob Rath
Pubblicato in: Proceedings of the 14th International Conference on Intelligent Computer Mathematics (CICM), Numero Lecture Notes in Computer Science, volume 12833, 2021, Pagina/e 185-196
Editore: Springer
DOI: 10.1007/978-3-030-81097-9_15

MCSat-based Finite Field Reasoning in the Yices2 SMT Solver (Short Paper)

Autori: Thomas Hader, Daniela Kaufmann, Ahmed Irfan, Stéphane Graham-Lengrand, Laura Kovács
Pubblicato in: Proceedings of the International Joint Conference on Automated Reasoning (IJCAR), Numero volume 14739 of LNCS, 2024, Pagina/e 386-395
Editore: Springer
DOI: 10.1007/978-3-031-63498-7_23

Deductive Controller Synthesis for Probabilistic Hyperproperties

Autori: Roman Andriushchenko, Ezio Bartocci, Milan Ceska, Francesco Pontiggia, Sarah Sallinger
Pubblicato in: Proceedings of the 20th International Conference on Quantitative Evaluation of Systems, 2023
Editore: Springer
DOI: 10.1007/978-3-031-43835-6_20

Scaling CheckMate for Game-Theoretic Security

Autori: Sophie Rain, Lea Salome Brugger, Anja Petkovic Komel, Laura Kovács, Michael Rawson
Pubblicato in: Proceedings of 25th Conference on Logic for Programming, Arti cial Intelligence and Reasoning (LPAR-25), Numero volume 100 or EPiC, 2024, Pagina/e 222-231
Editore: EasyChair
DOI: 10.29007/llnq

SMT Solving over Finite Field Arithmetic

Autori: Hader, Thomas; Kaufmann, Daniela; Kovács, Laura
Pubblicato in: Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Numero Volume 94, 2023, Pagina/e 238-256
Editore: EasyChair
DOI: 10.29007/4n6w

Discrete & Computational Geometry / Lonely Points in Simplices

Autori: Kauers, Manuel; Jaroschek, Maximilian; Kovács, Laura
Pubblicato in: Discrete and Computaational Geometry, Numero Volume 69, Number 1, 2022, Pagina/e 4-25, ISSN 0179-5376
Editore: Springer Verlag

(Un)Solvable Loop Analysis

Autori: Amrollahi, Daneshvar; Bartocci, Ezio; Kenison, George; Kovács, Laura; Moosbrugger, Marcel; Stankovič, Miroslav
Pubblicato in: Formal Methods in System Design - FMSD, 2024, ISSN 1572-8102
Editore: Springer
DOI: 10.1007/s10703-024-00455-0

The probabilistic termination tool amber

Autori: Moosbrugger, Marcel; Bartocci, Ezio; Katoen, Joost-Pieter; Kovács, Laura
Pubblicato in: Formal methods in system design, Numero 61(1), 2023, ISSN 0925-9856
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10703-023-00424-z

Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments

Autori: Kofnov, Andrey; Moosbrugger, Marcel; Stankovič, Miroslav; Bartocci, Ezio; Bura, Efstathia
Pubblicato in: ACM Transactions on Modeling and Computer Simulation - TOMACS, Numero Volume 34, Numero 3, Article No. 18, 2024, Pagina/e 1-25, ISSN 1049-3301
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3641545

Moment-based analysis of Bayesian network properties

Autori: Miroslav Stankovic, Ezio Bartocci, Laura Kovács
Pubblicato in: J. of Theoretical Computer Science, Numero Volume 903, 2022, Pagina/e 113-133, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2021.12.021

Algebra-Based Reasoning for Loop Synthesis

Autori: Andreas Humenberger, Daneshvar Amrollahi, Nikolaj S. Bjørner, Laura Kovács
Pubblicato in: Formal Aspects of Computing, Numero volume 34, number 1, 2022, Pagina/e 1-31, ISSN 0934-5043
Editore: Springer Verlag
DOI: 10.1145/3527458

Lonely Points in Simplices

Autori: Maximilian Jaroschek, Manuel Kauers, Laura Kovács
Pubblicato in: Discrete and Computational Geometry, Numero volume 69, number 1, 2023, Pagina/e 4-25, ISSN 0179-5376
Editore: Springer Verlag
DOI: 10.1007/s00454-022-00428-2

Non-Linear SMT-Reasoning over Finite Fields

Autori: Hader, Thomas
Pubblicato in: 2022
Editore: TU Wien
DOI: 10.34726/hss.2022.89445

Non-Linear Reasoning in the Superposition Calculus

Autori: Lackner, Andreas
Pubblicato in: 2022
Editore: TU Wien
DOI: 10.34726/hss.2022.90765

Automating Proofs of Game-Theoretic Security Properties of Off-Chain Protocols

Autori: Brugger, Lea Salome
Pubblicato in: 2022
Editore: TU Wien
DOI: 10.34726/hss.2022.104340

Towards Automating Induction for Software Verification - Guiding Inductive Reasoning in Superposition-based Theorem Proving

Autori: Pamina Georgiou
Pubblicato in: 2024
Editore: TU Wien
DOI: 10.34726/hss.2024.123801

Moment-Based Loop Analysis

Autori: Stankovic, Miroslav
Pubblicato in: 2023
Editore: TU Wien
DOI: 10.34726/hss.2023.113863

Exact Inference for Probabilistic Loops

Autori: Müllner, Julian
Pubblicato in: 2023
Editore: TU Wien
DOI: 10.34726/hss.2023.107471

User propagators for satisfiability modulo custom theories

Autori: Clemens Eisenhofer
Pubblicato in: 2022
Editore: TU Wien
DOI: 10.34726/hss.2022.100221

Automated Analysis of Probabilistic Loops

Autori: Marcel Moosbrugger
Pubblicato in: 2024
Editore: TU Wien
DOI: 10.34726/hss.2024.123240

È in corso la ricerca di dati su OpenAIRE...

Risultati finali

Pubblicazioni

Condividi questa pagina Condividi questa pagina sui social network

Scarica Scarica il contenuto della pagina