Analysis, Verification, and Synthesis for Infinite-State Systems

On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets

Autori: Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell
Pubblicato in: 46th International Symposium on Mathematical Foundations of Computer Science (MFCS), Numero 202, 2021, Pagina/e 33:1--33:21
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.mfcs.2021.33

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: 46th International Symposium on Mathematical Foundations of Computer Science (MFCS), Numero 202, 2021, Pagina/e 67:1--67:15
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.mfcs.2021.67

Invariants for Continuous Linear Dynamical Systems

Autori: Shaull Almagor, Edon Kelmendi, Joël Ouaknine, James Worrell
Pubblicato in: 47th International Colloquium on Automata, Languages, and Programming (ICALP), Numero 168, 2020, Pagina/e 107:1--107:15
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2020.107

Decision Problems for Second-Order Holonomic Recurrences

Autori: Eike Neumann, Joël Ouaknine, James Worrell
Pubblicato in: 48th International Colloquium on Automata, Languages, and Programming (ICALP), Numero 198, 2021, Pagina/e 99:1--99:20
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2021.99

Reachability in Dynamical Systems with Rounding

Autori: Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland
Pubblicato in: 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Numero 182, 2020, Pagina/e 36:1--36:17
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.fsttcs.2020.36

The Pseudo-Skolem Problem is Decidable

Autori: Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, Sadegh Soudjani, James Worrell
Pubblicato in: 46th International Symposium on Mathematical Foundations of Computer Science (MFCS), Numero 202, 2021, Pagina/e 34:1--34:21
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.mfcs.2021.34

Universal Skolem Sets

Autori: Florian Luca, Joel Ouaknine, James Worrell
Pubblicato in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Pagina/e 1-6, ISBN 978-1-6654-4895-6
Editore: IEEE
DOI: 10.1109/lics52264.2021.9470513

Solvability of Matrix-Exponential Equations

Autori: Joel Ouaknine, Amaury Pouly, Joao Sousa-Pinto, James Worrell
Pubblicato in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Pagina/e 798-806, ISBN 9781-450343916
Editore: ACM Press
DOI: 10.1145/2933575.2934538

On Recurrent Reachability for Continuous Linear Dynamical Systems

Autori: Ventsislav Chonev, Joël Ouaknine, James Worrell
Pubblicato in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Pagina/e 515-524, ISBN 9781-450343916
Editore: ACM Press
DOI: 10.1145/2933575.2934548

Proving the Herman-Protocol Conjecture

Autori: Bruna, Maria; Grigore, Radu; Kiefer, Stefan; Ouaknine, Joël; Worrell, James
Pubblicato in: 43rd International Colloquium on Automata, Languages, and Programming (ICALP), 2016
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2016.104

On the Skolem Problem for Continuous Linear Dynamical Systems

Autori: Ventsislav Chonev, Joel Ouaknine, and James Worrell
Pubblicato in: 43rd International Colloquium on Automata, Languages, and Programming (ICALP), 2016
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2016.100

Model Checking Flat Freeze LTL on One-Counter Automata

Autori: Antonia Lechner, Richard Mayr, Joel Ouaknine, Amaury Pouly, and James Worrell
Pubblicato in: 27th International Conference on Concurrency Theory (CONCUR), 2016
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CONCUR.2016.29

Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem

Autori: Nathanael Fijalkow, Pierre Ohlmann, Joel Ouaknine, Amaury Pouly, and James Worrell
Pubblicato in: 34th Symposium on Theoretical Aspects of Computer Science (STACS), 2017
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2017.29

The Polytope-Collision Problem

Autori: Shaull Almagor, Joel Ouaknine, and James Worrell
Pubblicato in: 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.24

On the Polytope Escape Problem for Continuous Linear Dynamical Systems

Autori: Joel Ouaknine, Joao Sousa-Pinto, James Worrell
Pubblicato in: Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control - HSCC '17, 2017, Pagina/e 11-17, ISBN 9781-450345903
Editore: ACM Press
DOI: 10.1145/3049797.3049798

Polynomial Invariants for Affine Programs

Autori: Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell
Pubblicato in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Pagina/e 530-539, ISBN 9781-450355834
Editore: ACM Press
DOI: 10.1145/3209108.3209142

O-Minimal Invariants for Linear Loops

Autori: Almagor, Shaull; Chistikov, Dmitry; Ouaknine, Joël; Worrell, James
Pubblicato in: 45th International Colloquium on Automata, Languages, and Programming, ICALP, Numero 107, 2018, Pagina/e 114:1--114:14, ISBN 978-3-95977-076-7
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2018.114

Convex Language Semantics for Nondeterministic Probabilistic Automata

Autori: van Heerdt, Gerco; Hsu, Justin; Ouaknine, Joël; Silva, Alexandra
Pubblicato in: Proceedings, Theoretical Aspects of Computing (ICTAC) 2018 - 15th International Colloquium, Numero 11187, 2018, Pagina/e 472--492, ISBN 978-3-030-02507-6
Editore: Springer

Effective Divergence Analysis for Linear Recurrence Sequences

Autori: Almagor, Shaull; Chapman, Brynmor; Hosseini, Mehran; Ouaknine, Joël; Worrell, James
Pubblicato in: 29th International Conference on Concurrency Theory, CONCUR, Numero 118, 2018, Pagina/e 42:1--42:15, ISBN 978-3-95977-087-3
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CONCUR.2018.42

Sequential Relational Decomposition

Autori: Dror Fried, Axel Legay, Joël Ouaknine, Moshe Y. Vardi
Pubblicato in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, Numero Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2018, Pagina/e 432-441, ISBN 9781-450355834
Editore: ACM Press
DOI: 10.1145/3209108.3209203

The Semialgebraic Orbit Problem

Autori: Shaull Almagor, Joel Ouaknine, James Worrell
Pubblicato in: Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science (STACS), Numero LIPIcs 126, 2019, Pagina/e 6:1--6:15
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2019.6

On Reachability Problems for Low-Dimensional Matrix Semigroups

Autori: Thomas Colcombet, Joel Ouaknine, Pavel Semukhin, James Worrell
Pubblicato in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP), Numero LIPIcs 132, 2019, Pagina/e 44:1-44:15
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2019.44

Termination of Linear Loops over the Integers

Autori: Mehran Hosseini, Joel Ouaknine, James Worrell
Pubblicato in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP), Numero LIPIcs 132, 2019, Pagina/e 118:1-118:13
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2019.118

On the decidability of reachability in linear time-invariant systems

Autori: Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa-Pinto, James Worrell
Pubblicato in: Proceedings of the 22nd ACM International Conference on Hybrid Systems Computation and Control - HSCC '19, 2019, Pagina/e 77-86, ISBN 9781-450362825
Editore: ACM Press
DOI: 10.1145/3302504.3311796

On the Skolem Problem and prime powers

Autori: George Kenison, Richard Lipton, Joël Ouaknine, James Worrell
Pubblicato in: 45th International Symposium on Symbolic and Algebraic Computation (ISSAC), Numero 20 July 2020, 2020, Pagina/e 289-296
Editore: ACM
DOI: 10.1145/3373207.3404036

The Orbit Problem for Parametric Linear Dynamical Systems

Autori: Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Florian Luca, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell
Pubblicato in: 32nd International Conference on Concurrency Theory (CONCUR), Numero 203, 2021, Pagina/e 28:1--28:17
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2021.28

How Fast Can You Escape a Compact Polytope?

Autori: Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, James Worrell
Pubblicato in: 37th International Symposium on Theoretical Aspects of Computer Science (STACS), Numero 154, 2020, Pagina/e 49:1-49:11, ISBN 978-3-95977-140-5
Editore: Schloss Dagstuhl--Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2020.49

On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems

Autori: Toghrul Karimov, Joël Ouaknine, James Worrell
Pubblicato in: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS), Numero 170, 2020, Pagina/e 54:1--54:14
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.mfcs.2020.54

On Ranking Function Synthesis and Termination for Polynomial Programs

Autori: Eike Neumann, Joël Ouaknine, James Worrell
Pubblicato in: 31st International Conference on Concurrency Theory (CONCUR), Numero 171, 2020, Pagina/e 15:1--15:15
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2020.15

Algebraic Invariants for Linear Hybrid Automata

Autori: Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell
Pubblicato in: 31st International Conference on Concurrency Theory (CONCUR), Numero 171, 2020, Pagina/e 32:1--32:17
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2020.32

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 Symposium on Programming Languages, Numero 6/POPL, 2022, Pagina/e 1-25, ISSN 2475-1421
Editore: ACM
DOI: 10.1145/3498727

Deciding ω-regular properties on linear recurrence sequences

Autori: Shaull Almagor, Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell
Pubblicato in: Proceedings of the ACM on Programming Languages, Numero 5/POPL, 2021, Pagina/e 1-24, ISSN 2475-1421
Editore: ACM
DOI: 10.1145/3434329

On the Complexity of the Orbit Problem

Autori: Ventsislav Chonev, Joël Ouaknine, James Worrell
Pubblicato in: Journal of the ACM, Numero 63/3, 2016, Pagina/e 1-18, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/2857050

Zeno, Hercules, and the Hydra

Autori: Ranko Lazić, Joël Ouaknine, James Worrell
Pubblicato in: ACM Transactions on Computational Logic, Numero 17/3, 2016, Pagina/e 1-27, ISSN 1529-3785
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/2874774

On parametric timed automata and one-counter machines

Autori: Daniel Bundala, Joel Ouaknine
Pubblicato in: Information and Computation, Numero 253, 2017, Pagina/e 272-303, ISSN 0890-5401
Editore: Academic Press
DOI: 10.1016/j.ic.2016.07.011

Cyclic-routing of Unmanned Aerial Vehicles

Autori: Nir Drucker, Hsi-Ming Ho, Joël Ouaknine, Michal Penn, Ofer Strichman
Pubblicato in: Journal of Computer and System Sciences, Numero 103, 2019, Pagina/e 18-45, ISSN 0022-0000
Editore: Academic Press
DOI: 10.1016/j.jcss.2019.02.002

Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem

Autori: Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
Pubblicato in: Theory of Computing Systems, Numero 63/5, 2019, Pagina/e 1027-1048, ISSN 1432-4350
Editore: Springer Verlag
DOI: 10.1007/s00224-019-09913-3

On the Decidability of Membership in Matrix-exponential Semigroups

Autori: Joël Ouaknine, Amaury Pouly, João Sousa-Pinto, James Worrell
Pubblicato in: Journal of the ACM, Numero 66/3, 2019, Pagina/e 1-24, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3286487

First-Order Orbit Queries

Autori: Shaull Almagor, Joël Ouaknine, James Worrell
Pubblicato in: Theory of Computing Systems, Numero 65/4, 2021, Pagina/e 638-661, ISSN 1432-4350
Editore: Springer Verlag
DOI: 10.1007/s00224-020-09976-7

On the Monniaux Problem in Abstract Interpretation

Autori: Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
Pubblicato in: Static Analysis - 26th International Symposium, SAS 2019, Porto, Portugal, October 8–11, 2019, Proceedings, Numero 11822, 2019, Pagina/e 162-180, ISBN 978-3-030-32303-5
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-32304-2_9

Porous Invariants

Autori: Engel Lefaucheux, Joël Ouaknine, David Purser, James Worrell
Pubblicato in: Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part II, Numero 12760, 2021, Pagina/e 172-194, ISBN 978-3-030-81687-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-81688-9_8

Pubblicazioni

Condividi questa pagina

Scarica