Skip to main content

Parametrized Verification and Synthesis

Searching for OpenAIRE data...

Publications

Adaptive Synchronisation of Pushdown Automata

Author(s): A. R. Balasubramanian, K. S. Thejaswini
Published in: preprint, 2021
Publisher: none

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics

Author(s): A. R. Balasubramanian, Timo Lang, Revantha Ramanayake
Published in: preprint, 2021
Publisher: none

Decision Power of Weak Asynchronous Models of Distributed Computing

Author(s): Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza
Published in: preprint, 2021
Publisher: none

Constructive expressive power of population protocols

Author(s): Mikhail Raskin
Published in: preprint, 2020
Publisher: none

Affine Extensions of Integer Vector Addition Systems with States

Author(s): Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail Raskin
Published in: 29th International Conference on Concurrency Theory (CONCUR 2018), 2018, Page(s) 14:1--14:17, ISBN 978-3-95977-087-3
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2018.14

The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results

Author(s): Swen Jacobs, Roderick Bloem, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Philipp J. Meyer, Thibaud Michaud, Mouhammad Sakr, Salomon Sickert, Leander Tentrup, Adam Walker
Published in: The 5th Reactive Synthesis Competition (SYNTCOMP 2018), Yearly report, 2019
Publisher: none

Population Protocols with Unreliable Communication

Author(s): Mikhail Raskin
Published in: preprint, 2019
Publisher: none

On Affine Reachability Problems

Author(s): Stefan Jaax, Stefan Kiefer
Published in: preprint, 2019
Publisher: none

Computing Parameterized Invariants of Parameterized Petri Nets

Author(s): Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Published in: preprint, 2021
Publisher: none

A unified algorithm for colouring graphs of bounded clique-width

Author(s): Bruno Courcelle, Irène Durand, Michael Raskin
Published in: preprint, 2020
Publisher: none

Sharp Thresholds in Random Simple Temporal Graphs

Author(s): Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Published in: preprint, 2020
Publisher: none

Proving Noninterference in Multi-Agent Systems

Author(s): Christian Müller
Published in: 2020
Publisher: Technical University of Munich

A Unified Translation of Linear Temporal Logic to Omega-Automata

Author(s): Salomon Sickert
Published in: 2019
Publisher: Technical University of Munich

Population Protocols: Expressiveness, Succinctness and Automatic Verification

Author(s): Stefan Jaax
Published in: 2020
Publisher: Technical University of Munich

Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling

Author(s): Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kučera, Philipp J. Meyer
Published in: Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21–24, 2020, Proceedings, Part II, 12225, 2020, Page(s) 372-397, ISBN 978-3-030-53290-1
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-53291-8_20

Characterizing Consensus in the Heard-Of Model

Author(s): A. R. Balasubramanian, Igor Walukiewicz
Published in: 31st International Conference on Concurrency Theory, CONCUR 2020, 171, 2020, Page(s) 9:1--9:18
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2020.9

A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries

Author(s): Nathalie Bertrand, Marijana Lazic, Josef Widder
Published in: Verification, Model Checking, and Abstract Interpretation, 2021, Page(s) 219--239
Publisher: Springer
DOI: 10.1007/978-3-030-67067-2_11

Certifying Inexpressibility

Author(s): Orna Kupferman, Salomon Sickert
Published in: Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 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, 12650, 2021, Page(s) 385-405, ISBN 978-3-030-71994-4
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-71995-1_20

Tutorial: Parameterized Verification with Byzantine Model Checker

Author(s): Igor Konnov, Marijana Lazic, Ilina Stoilkovska, Josef Widder
Published in: Formal Techniques for Distributed Objects, Components, and Systems - FORTE 2020, 2020
Publisher: Springer
DOI: 10.1007/978-3-030-50086-3_11

Flatness and Complexity of Immediate Observation Petri Nets

Author(s): Mikhail Raskin, Chana Weil-Kennedy, Javier Esparza
Published in: 31st International Conference on Concurrency Theory, CONCUR 2020, 171, 2020, Page(s) 45:1--45:19
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2020.45

Peregrine 2.0: Explaining Correctness of Population Protocols Through Stage Graphs

Author(s): Javier Esparza, Martin Helfrich, Stefan Jaax, Philipp J. Meyer
Published in: Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, 12302, 2020, Page(s) 550-556, ISBN 978-3-030-59151-9
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-59152-6_32

Verification of Immediate Observation Population Protocols

Author(s): Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy
Published in: 29th International Conference on Concurrency Theory, CONCUR 2018, 2018, ISBN 978-3-95977-087-3
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CONCUR.2018.31

Automatic Analysis of Expected Termination Time for Population Protocols

Author(s): Michael Blondin, Javier Esparza, Antonín Kučera
Published in: 29th International Conference on Concurrency Theory, CONCUR 2018, 2018, ISBN 978-3-95977-087-3
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CONCUR.2018.33

Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics

Author(s): Idan Berkovits, Marijana Lazić, Giuliano Losa, Oded Padon, Sharon Shoham
Published in: Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II, 11562, 2019, Page(s) 245-266, ISBN 978-3-030-25542-8
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-25543-5_15

Computing the Expected Execution Time of Probabilistic Workflow Nets

Author(s): Philipp J. Meyer, Javier Esparza, Philip Offtermatt
Published in: Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Part II, 11428, 2019, Page(s) 154-171, ISBN 978-3-030-17464-4
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-17465-1_9

Working with first-order proofs and provers

Author(s): Mikhail Raskin, Christoph Welzel
Published in: 12-th European Lisp Symposium (ELS 2019), 2019
Publisher: ELS
DOI: 10.5281/zenodo.2633990

Expressive Power of Broadcast Consensus Protocols

Author(s): Michael Blondin, Javier Esparza, Stefan Jaax
Published in: 30th International Conference on Concurrency Theory (CONCUR 2019), 2019, Page(s) 31:1--31:16, ISBN 978-3-95977-121-4
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2019.31

Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries

Author(s): Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder
Published in: 30th International Conference on Concurrency Theory (CONCUR 2019), 2019, Page(s) 33:1--33:15, ISBN 978-3-95977-121-4
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2019.33

How to Win First-Order Safety Games

Author(s): Helmut Seidl, Christian Müller, Bernd Finkbeiner
Published in: Verification, Model Checking, and Abstract Interpretation - 21st International Conference, VMCAI 2020, New Orleans, LA, USA, January 16–21, 2020, Proceedings, 11990, 2020, Page(s) 426-448, ISBN 978-3-030-39321-2
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-39322-9_20

Succinct Population Protocols for Presburger Arithmetic

Author(s): Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax
Published in: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), volume 154, 2020, Page(s) 40:1--40:15, ISBN 978-3-95977-140-5
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2020.40

Wait-Free Solvability of Equality Negation Tasks

Author(s): Eric Goubault, Marijana Lazic, Jeremy Ledent, Sergio Rajsbaum
Published in: 33rd International Symposium on Distributed Computing (DISC 2019), Volume 146, 2019, Page(s) 21:1--21:16, ISBN 978-3-95977-126-9
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.disc.2019.21

A Dynamic Epistemic Logic Analysis of the Equality Negation Task

Author(s): Éric Goubault, Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum
Published in: Dynamic Logic. New Trends and Applications - Second International Workshop, DaLí 2019, Porto, Portugal, October 7–11, 2019, Proceedings, 12005, 2020, Page(s) 53-70, ISBN 978-3-030-38807-2
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-38808-9_4

Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead

Author(s): Michael Raskin, Mark Simkin
Published in: Advances in Cryptology – ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part II, 11922, 2019, Page(s) 537-563, ISBN 978-3-030-34620-1
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-34621-8_19

Structural Invariants for the Verification of Systems with Parameterized Architectures

Author(s): Marius Bozga, Javier Esparza, Radu Iosif, Joseph Sifakis, Christoph Welzel
Published 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, 12078, 2020, Page(s) 228-246, ISBN 978-3-030-45189-9
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-45190-5_13

The Complexity of Reachability in Affine Vector Addition Systems with States

Author(s): Michael Blondin, Mikhail Raskin
Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Page(s) 224-236, ISBN 9781-450371049
Publisher: ACM
DOI: 10.1145/3373718.3394741

An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata

Author(s): Salomon Sickert, Javier Esparza
Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Page(s) 831-844, ISBN 9781-450371049
Publisher: ACM
DOI: 10.1145/3373718.3394743

Complexity of controlled bad sequences over finite sets of Nd

Author(s): A. R. Balasubramanian
Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Page(s) 130-140, ISBN 9781-450371049
Publisher: ACM
DOI: 10.1145/3373718.3394753

Efficient Restrictions of Immediate Observation Petri Nets

Author(s): Michael Raskin, Chana Weil-Kennedy
Published in: Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19–21, 2020, Proceedings, 12448, 2020, Page(s) 99-114, ISBN 978-3-030-61738-7
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-61739-4_7

Running Time Analysis of Broadcast Consensus Protocols

Author(s): Philipp Czerner, Stefan Jaax
Published in: Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 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, 12650, 2021, Page(s) 164-183, ISBN 978-3-030-71994-4
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-71995-1_9

Complexity of Verification and Synthesis of Threshold Automata

Author(s): A. R. Balasubramanian, Javier Esparza, Marijana Lazić
Published in: Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, 12302, 2020, Page(s) 144-160, ISBN 978-3-030-59151-9
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-59152-6_8

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy

Author(s): A. R. Balasubramanian, Javier Esparza, Mikhail Raskin
Published in: Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 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, 12650, 2021, Page(s) 42-61, ISBN 978-3-030-71994-4
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-71995-1_3

A Classification of Weak Asynchronous Models of Distributed Computing

Author(s): Javier Esparza, Fabian Reiter
Published in: 31st International Conference on Concurrency Theory, CONCUR 2020, 171, 2020, Page(s) 10:1--10:16
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2020.10

A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks

Author(s): Hans van Ditmarsch, Éric Goubault, Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum
Published in: Journal of Logical and Algebraic Methods in Programming, 121, 2021, Page(s) 100662, ISSN 2352-2208
Publisher: Elsevier
DOI: 10.1016/j.jlamp.2021.100662

A Unified Translation of Linear Temporal Logic to ω-Automata

Author(s): Javier Esparza, Jan Křetínský, Salomon Sickert
Published in: Journal of the ACM, 67/6, 2020, Page(s) 1-61, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3417995

Practical synthesis of reactive systems from LTL specifications via parity games

Author(s): Michael Luttenberger, Philipp J. Meyer, Salomon Sickert
Published in: Acta Informatica, 2019, ISSN 0001-5903
Publisher: Springer Verlag
DOI: 10.1007/s00236-019-00349-3

A Stay-in-a-Set Game without a Stationary Equilibrium

Author(s): Kristoffer Arnsfelt Hansen, Mikhail Raskin
Published in: Electronic Proceedings in Theoretical Computer Science, 305, 2019, Page(s) 83-90, ISSN 2075-2180
Publisher: Electronic Proceedings in Theoretical Computer Science
DOI: 10.4204/eptcs.305.6

On defining linear orders by automata

Author(s): Bruno Courcelle, Irène Durand, Michael Raskin
Published in: Moscow Journal of Combinatorics and Number Theory, 9/3, 2020, Page(s) 253-291, ISSN 2640-7361
Publisher: Mathematical Sciences Publishers
DOI: 10.2140/moscow.2020.9.253

Towards efficient verification of population protocols

Author(s): Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer
Published in: Formal Methods in System Design, 2021, ISSN 0925-9856
Publisher: Kluwer Academic Publishers
DOI: 10.1007/s10703-021-00367-3

The complexity of verifying population protocols

Author(s): Javier Esparza, Stefan Jaax, Mikhail Raskin, Chana Weil-Kennedy
Published in: Distributed Computing, 34/2, 2021, Page(s) 133-177, ISSN 0178-2770
Publisher: Springer Verlag
DOI: 10.1007/s00446-021-00390-x

Parameterized Analysis of Immediate Observation Petri Nets

Author(s): Javier Esparza, Mikhail Raskin, Chana Weil-Kennedy
Published in: Application and Theory of Petri Nets and Concurrency - 40th International Conference, PETRI NETS 2019, Aachen, Germany, June 23–28, 2019, Proceedings, 11522, 2019, Page(s) 365-385, ISBN 978-3-030-21570-5
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-21571-2_20