Symbolic Computation and Automated Reasoning for Program Analysis

Automated induction by reflection

Autori: Johannes Schoisswohl
Pubblicato in: Master thesis, 2020
Editore: TU Wien, Austria
DOI: 10.34726/hss.2020.75342

Formalizing Graph Trail Properties

Autori: Hanna Lachnitt
Pubblicato in: Master thesis, 2020, Pagina/e 1-62
Editore: TU Wien

Automating inductive reasoning with recursive functions

Autori: Marton Hajdu
Pubblicato in: Master thesis, 2021
Editore: TU Wien, Austria
DOI: 10.34726/hss.2021.84140

First-Order Reasoning with Aggregates

Autori: Sophie Rain
Pubblicato in: Master thesis, 2020, Pagina/e 1-66
Editore: TU Wien

Automated software verification using superposition-based theorem proving

Autori: Bernhard Gleiss
Pubblicato in: 2020
Editore: TU Wien, Austria
DOI: 10.34726/hss.2020.86611

Trace Reasoning for formal verification - Guiding Vampire in induction

Autori: Pamina Georgiou
Pubblicato in: Master Thesis, 2019, Pagina/e 1-58
Editore: TU Wien

Subsumption demodulation in first-order theorem proving

Autori: Jakob Rath
Pubblicato in: Master Thesis, 2019, Pagina/e 1-53
Editore: TU Wien

Automating Termination Analysis of Probabilistic Programs

Autori: Marcel Moosbrugger
Pubblicato in: Master Thesis, 2020, Pagina/e 1-68
Editore: TU Wien

Algebra-based loop reasoning - invariant generation and synthesis for numeric loops

Autori: Andreas Humenberger
Pubblicato in: PhD Dissertation, 2021
Editore: TU Wien, Austria
DOI: 10.34726/hss.2021.89761

Formalizing Graph Trail Properties in Isabelle/HOL

Autori: Laura Kovács, Hanna Lachnitt, Stefan Szeider
Pubblicato in: Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26–31, 2020, Proceedings, Numero 12236, 2020, Pagina/e 190-205, ISBN 978-3-030-53517-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-53518-6_12

Induction with Generalization in Superposition Reasoning

Autori: Márton Hajdú, Petra Hozzová, Laura Kovács, Johannes Schoisswohl, Andrei Voronkov
Pubblicato in: Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26–31, 2020, Proceedings, Numero 12236, 2020, Pagina/e 123-137, ISBN 978-3-030-53517-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-53518-6_8

Algebra-Based Loop Synthesis

Autori: Andreas Humenberger, Nikolaj Bjørner, Laura Kovács
Pubblicato in: Integrated Formal Methods - 16th International Conference, IFM 2020, Lugano, Switzerland, November 16–20, 2020, Proceedings, Numero 12546, 2020, Pagina/e 440-459, ISBN 978-3-030-63460-5
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-63461-2_24

Inductive Benchmarks for Automated Reasoning

Autori: Márton Hajdu, Petra Hozzová, Laura Kovács, Johannes Schoisswohl, Andrei Voronkov
Pubblicato in: Intelligent Computer Mathematics - 14th International Conference, CICM 2021, Timisoara, Romania, July 26–31, 2021, Proceedings, Numero 12833, 2021, Pagina/e 124-129, ISBN 978-3-030-81096-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-81097-9_9

Global Guidance for Local Generalization in Model Checking

Autori: Hari Govind Vediramana Krishnan, YuTing Chen, Sharon Shoham, Arie Gurfinkel
Pubblicato in: Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21–24, 2020, Proceedings, Part II, Numero 12225, 2020, Pagina/e 101-125, ISBN 978-3-030-53290-1
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-53291-8_7

Integer Induction in Saturation

Autori: Petra Hozzová, Laura Kovács, Andrei Voronkov
Pubblicato in: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Numero 12699, 2021, Pagina/e 361-377, ISBN 978-3-030-79875-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-79876-5_21

Analysis of Bayesian Networks via Prob-Solvable Loops

Autori: Ezio Bartocci, Laura Kovács, Miroslav Stankovič
Pubblicato in: Theoretical Aspects of Computing – ICTAC 2020 - 17th International Colloquium, Macau, China, November 30 – December 4, 2020, Proceedings, Numero 12545, 2020, Pagina/e 221-241, ISBN 978-3-030-64275-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-64276-1_12

Mora - Automatic Generation of Moment-Based Invariants

Autori: Ezio Bartocci, Laura Kovács, Miroslav Stankovič
Pubblicato in: Tools and Algorithms for the Construction and Analysis of Systems - 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings, Part I, Numero 12078, 2020, Pagina/e 492-498, ISBN 978-3-030-45189-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-45190-5_28

Interactive Visualization of Saturation Attempts in Vampire

Autori: Bernhard Gleiss, Laura Kovács, Lena Schnedlitz
Pubblicato in: Integrated Formal Methods - 15th International Conference, IFM 2019, Bergen, Norway, December 2–6, 2019, Proceedings, Numero 11918, 2019, Pagina/e 504-513, ISBN 978-3-030-34967-7
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-34968-4_28

Selecting the Selection

Autori: Kryštof Hoder, Giles Reger, Martin Suda, Andrei Voronkov
Pubblicato in: Automated Reasoning, Numero LNCS 9706, 2016, Pagina/e 313-329, ISBN 978-3-319-40229-1
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-40229-1_22

Symbolic Computation and Automated Reasoning for Program Analysis

Autori: Laura Kovács
Pubblicato in: Integrated Formal Methods, Numero LNCS 9681, 2016, Pagina/e 20-27, ISBN 978-3-319-33693-0
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-33693-0_2

Finding Finite Models in Multi-sorted First-Order Logic

Autori: Giles Reger, Martin Suda, Andrei Voronkov
Pubblicato in: Theory and Applications of Satisfiability Testing – SAT 2016, Numero LNCS 9710, 2016, Pagina/e 323-341, ISBN 978-3-319-40970-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-40970-2_20

Lifting QBF Resolution Calculi to DQBF

Autori: Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda
Pubblicato in: Theory and Applications of Satisfiability Testing – SAT 2016, Numero LNCS 9710, 2016, Pagina/e 490-499, ISBN 978-3-319-40970-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-40970-2_30

Layered Clause Selection for Theory Reasoning - (Short Paper)

Autori: Bernhard Gleiss, Martin Suda
Pubblicato in: Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I, Numero 12166, 2020, Pagina/e 402-409, ISBN 978-3-030-51073-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-51074-9_23

Summing up Smart Transitions

Autori: Neta Elad, Sophie Rain, Neil Immerman, Laura Kovács, Mooly Sagiv
Pubblicato in: Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part I, Numero 12759, 2021, Pagina/e 317-340, ISBN 978-3-030-81684-1
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-81685-8_15

The Probabilistic Termination Tool Amber

Autori: Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács
Pubblicato in: Proceedings of FM, To Appear, 2021
Editore: Springer

Subsumption Demodulation in First-Order Theorem Proving

Autori: Bernhard Gleiss, Laura Kovács, Jakob Rath
Pubblicato in: Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I, Numero 12166, 2020, Pagina/e 297-315, ISBN 978-3-030-51073-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-51074-9_17

Automated Generation of Exam Sheets for Automated Deduction

Autori: Petra Hozzová, Laura Kovács, Jakob Rath
Pubblicato in: Intelligent Computer Mathematics - 14th International Conference, CICM 2021, Timisoara, Romania, July 26–31, 2021, Proceedings, Numero 12833, 2021, Pagina/e 185-196, ISBN 978-3-030-81096-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-81097-9_15

Induction in Saturation-Based Proof Search

Autori: Giles Reger, Andrei Voronkov
Pubblicato in: Automated Deduction – CADE 27 - 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings, Numero 11716, 2019, Pagina/e 477-494, ISBN 978-3-030-29435-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-29436-6_28

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

Autori: Ezio Bartocci, Laura Kovács, Miroslav Stankovič
Pubblicato in: Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019, Proceedings, Numero 11781, 2019, Pagina/e 255-276, ISBN 978-3-030-31783-6
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-31784-3_15

Induction with Recursive Definitions in Superposition

Autori: Marton Hajdu, Petra Hozzova, Laura Kovacs, Andrei Voronkov
Pubblicato in: Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design – FMCAD 2021, 2021, Pagina/e 246-255
Editore: TU Wien Repositum
DOI: 10.34727/2021/isbn.978-3-85448-046-4_34

Automated Termination Analysis of Polynomial Probabilistic Programs

Autori: Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács
Pubblicato in: Programming Languages and Systems - 30th European Symposium on Programming, ESOP 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Numero 12648, 2021, Pagina/e 491-518, ISBN 978-3-030-72018-6
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-72019-3_18

Algebra-Based Synthesis of Loops and Their Invariants (Invited Paper)

Autori: Andreas Humenberger, Laura Kovács
Pubblicato in: Verification, Model Checking, and Abstract Interpretation - 22nd International Conference, VMCAI 2021, Copenhagen, Denmark, January 17–19, 2021, Proceedings, Numero 12597, 2021, Pagina/e 17-28, ISBN 978-3-030-67066-5
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-67067-2_2

Verifying Relational Properties using Trace Logic

Autori: Gilles Barthe, Renate Eilers, Pamina Georgiou, Bernhard Gleiss, Laura Kovacs, Matteo Maffei
Pubblicato in: 2019 Formal Methods in Computer Aided Design (FMCAD), 2019, Pagina/e 170-178, ISBN 978-0-9835678-9-9
Editore: IEEE
DOI: 10.23919/fmcad.2019.8894277

Superposition Reasoning about Quantified Bitvector Formulas

Autori: David Damestani, Laura Kovacs, Martin Suda
Pubblicato in: 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2019, Pagina/e 95-99, ISBN 978-1-7281-5724-5
Editore: IEEE
DOI: 10.1109/synasc49474.2019.00022

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

Autori: Gergely Kovasznai, Krisztian Gajdar, Laura Kovacs
Pubblicato in: 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2019, Pagina/e 85-91, ISBN 978-1-7281-5724-5
Editore: IEEE
DOI: 10.1109/synasc49474.2019.00021

Theory-Specific Reasoning about Loops with Arrays using Vampire

Autori: Yuting Chen, Laura Kovács, Simon Robillard
Pubblicato in: Proceedings of the 3rd Vampire Workshop, Numero EasyChair EPiC Series in Computing 44, 2016, Pagina/e 16-32
Editore: EasyChair

A Clausal Normal Form Translation for FOOL

Autori: Evgenii Kotelnikov, Laura Kovács, Martin Suda, Andrei Voronkov
Pubblicato in: Proceedings of the 2nd Global Conference on Artificial Intelligence (GCAI), Numero EasyChair EPiC Series in Computing 41, 2016, Pagina/e 53-71
Editore: EasyChair

First-Order Interpolation and Interpolating Proof Systems

Autori: Laura Kovacs, Andrei Voronkov
Pubblicato in: Proceedings of the 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Numero EasyChair EPiC Series in Computing 46, 2017, Pagina/e 49-64
Editore: EasyChair

Blocked Clauses in First-Order Logic

Autori: Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere
Pubblicato in: Proceedings of the 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Numero EasyChair EPiC Series in Computing 46, 2017, Pagina/e 31-48
Editore: EasyChair

Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric Sequences

Autori: Andreas Humenberger, Maximilian Jaroschek, Laura Kovács
Pubblicato in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation - ISSAC '17, 2017, Pagina/e 221-228, ISBN 9781-450350648
Editore: ACM Press
DOI: 10.1145/3087604.3087623

Set of Support for Theory Reasoning

Autori: Giles Reger, Martin Suda
Pubblicato in: Proceedings of the 2017 International Workshop on the Implementation of Logics (IWIL), Numero Kalpa Publications in Computing, 2017, Pagina/e 124-134
Editore: EasyChair

Automated Invention of Strategies and Term Orderings for Vampire

Autori: Jan Jakubuv, Martin Suda, Josef Urban
Pubblicato in: Proceedings of the 3rd Global Conference on Artificial Intelligence (GCAI), Numero EasyChair EPiC Series in Computing volume 50, 2017, Pagina/e 121-133
Editore: EasyChair

A Unifying Principle for Clause Elimination in First-Order Logic

Autori: Benjamin Kiesl, Martin Suda
Pubblicato in: Proceedings of the 26th International Conference on Automated Deduction (CADE), Numero LNCS 10395, 2017, Pagina/e 274-290, ISBN 978-3-319-63045-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-63046-5_17

Splitting Proofs for Interpolation

Autori: Bernhard Gleiss, Laura Kovács, Martin Suda
Pubblicato in: Proceedings of the 26th International Conference on Automated Deduction (CADE), Numero LNCS 10395, 2017, Pagina/e 291-309, ISBN 978-3-319-63045-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-63046-5_18

Checkable Proofs for First-Order Theorem Proving

Autori: Giles Reger, Martin Suda
Pubblicato in: Proceedings of the 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements (ARCADE), Numero EasyChair EPiC Series in Computing volume 51, 2017, Pagina/e 55-63
Editore: EasyChair

First-Order Interpolation and Grey Areas of Proofs (Invited Talk)

Autori: Laura Kovacs
Pubblicato in: Proceedings of the 26th EACSL Annual Conference on Computer Science Logic (CSL), Numero LIPIcs 82,, 2017, Pagina/e 3:13:1
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CSL.2017.3

A Supervisory Control Algorithm Based on Property-Directed Reachability

Autori: Koen Claessen, Jonatan Kilhamn, Laura Kovács, Bengt Lennartson
Pubblicato in: 13th International Haifa Verification Conference on Hardware and Software: Verification and Testing (HVC), Numero LNCS 10629, 2017, Pagina/e 115-130, ISBN 978-3-319-70388-6
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-70389-3_8

Testing a Saturation-Based Theorem Prover: Experiences and Challenges

Autori: Giles Reger, Martin Suda, Andrei Voronkov
Pubblicato in: Proceedings of the 11th International Conference on Tests and Proofs (TAP), Numero LNCS 10375, 2017, Pagina/e 152-161, ISBN 978-3-319-61466-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-61467-0_10

Invariant Generation for Multi-Path Loops with Polynomial Assignments

Autori: Andreas Humenberger, Maximilian Jaroschek, Laura Kovács
Pubblicato in: Proceedings of the 19th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), Numero LNCS 10747, 2018, Pagina/e 226-246
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-73721-8_11

Desingularization of First Order Linear Difference Systems with Rational Function Coefficients

Autori: Moulay A. Barkatou, Maximilian Jaroschek
Pubblicato in: Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation - ISSAC '18, 2018, Pagina/e 39-46, ISBN 9781-450355506
Editore: ACM Press
DOI: 10.1145/3208976.3208989

Aligator.jl - A Julia Package for Loop Invariant Generation

Autori: Andreas Humenberger, Maximilian Jaroschek, Laura Kovács
Pubblicato in: Proceedings of the International Conference on Intelligent Computer Mathematics (CICM), Numero LNCS 11006, 2018, Pagina/e 111-117
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-96812-4_10

Unification with Abstraction and Theory Instantiation in Saturation-Based Reasoning

Autori: Giles Reger, Martin Suda, Andrei Voronkov
Pubblicato in: Proceedings of the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Numero LNCS 10805, 2018, Pagina/e 3-22
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-89960-2_1

A FOOLish Encoding of the Next State Relations of Imperative Programs

Autori: Evgenii Kotelnikov, Laura Kovács, Andrei Voronkov
Pubblicato in: Proceedings of the 9th International Joint Conference on Automated Reasoning (IJCAR), Numero LNCS 10900, 2018, Pagina/e 405-421
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-94205-6_27

Local Soundness for QBF Calculi

Autori: Martin Suda, Bernhard Gleiss
Pubblicato in: Proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing (SAT), Numero LNCS 10929, 2018, Pagina/e 217-234
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-94144-8_14

Superposition with Datatypes and Codatatypes

Autori: Jasmin Christian Blanchette, Nicolas Peltier, Simon Robillard
Pubblicato in: Proceedings of the 9th International Conference on Automated Reasoning (IJCAR), Numero LNCS 10900, 2018, Pagina/e 370-387
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-94205-6_25

Loop Analysis by Quantification over Iterations

Autori: Bernhard Gleiss, Laura Kovács, Simon Robillard
Pubblicato in: EPiC Series in Computing volume 57, 2018, Pagina/e 381-361
Editore: EasyChair
DOI: 10.29007/269p

Towards Smarter MACE-style Model Finders

Autori: Mikolas Janota, Martin Suda
Pubblicato in: EPiC Series in Computing volume 57, 2018, Pagina/e 454-436
Editore: EasyChair
DOI: 10.29007/w42s

A Theory of Satisfiability-Preserving Proofs in SAT Solving

Autori: Adrian Rebola Pardo, Martin Suda
Pubblicato in: Proceedings of the 22nd International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR), Numero EasyChair EPiC Series, volume 57, 2018, Pagina/e 583-603
Editore: EasyChair

Incremental Solving with Vampire

Autori: Giles Reger, Martin Suda
Pubblicato in: EPiC Series in Computing volume 53, 2018, Pagina/e 52-39
Editore: EasyChair
DOI: 10.29007/6sjl

Local proofs and AVATAR

Autori: Giles Reger, Martin Suda
Pubblicato in: Proceedings of the 4th Vampire Workshop, Numero EPiC Series in Computing 53, 2018, Pagina/e 33-41
Editore: EasyChair

An Inference Rule for the Acyclicity Property of Term Algebras

Autori: Simon Robillard
Pubblicato in: Proceedings of the 4th Vampire Workshop, Numero EasyChair EPiC Series Volume 53, 2018, Pagina/e 20-32
Editore: EasyChair

Automating Induction by Reflection

Autori: Johannes Schoisswohl; Laura Kovacs
Pubblicato in: Proceedings of LFMTP 2021, 2021
Editore: EPTCS

Layered Clause Selection for Saturation-based Theorem Proving

Autori: Bernhard Gleiss and Marton Suda
Pubblicato in: Proceedings of the 7th Workshop on Practical Aspects of Automated Reasoning (PAAR), 2020, Pagina/e 1-17
Editore: INRIA

Trace Logic for Inductive Loop Reasoning

Autori: Georgiou, Pamina; Gleiss, Bernhard; Kovács, Laura
Pubblicato in: Proceedings of FMCAD 2020, Numero volume 1, 2020, Pagina/e 255-263, ISBN 978-3-85448-042-6
Editore: TU Wien Academic Press
DOI: 10.34727/2020/isbn.978-3-85448-042-6

Formal solutions of completely integrable Pfaffian systems with normal crossings

Autori: Moulay A. Barkatou, Maximilian Jaroschek, Suzy S. Maddah
Pubblicato in: Journal of Symbolic Computation, Numero 81, 2017, Pagina/e 41-68, ISSN 0747-7171
Editore: Academic Press
DOI: 10.1016/j.jsc.2016.11.018

Coming to terms with quantified reasoning

Autori: Laura Kovács, Simon Robillard, Andrei Voronkov
Pubblicato in: ACM SIGPLAN Notices, Numero 52/1, 2017, Pagina/e 260-270, ISSN 0362-1340
Editore: Special Interest Group on Computer Graphics, Association for Computing Machinery
DOI: 10.1145/3093333.3009887

Replacing conjectures by positive knowledge: Inferring proven precise worst-case execution time bounds using symbolic execution

Autori: Jens Knoop, Laura Kovács, Jakob Zwirchmayr
Pubblicato in: Journal of Symbolic Computation, Numero 80, 2017, Pagina/e 101-124, ISSN 0747-7171
Editore: Academic Press
DOI: 10.1016/j.jsc.2016.07.023

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF

Autori: Olaf Beyersdorff, Joshua Blinkhorn, Leroy Chew, Renate Schmidt, Martin Suda
Pubblicato in: Journal of Automated Reasoning, 2018, Pagina/e 1-27, ISSN 0168-7433
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10817-018-9482-4

Pubblicazioni

Condividi questa pagina

Scarica