Model-Checking Temporal Behaviour in CSP. - Joël Ouaknine; George M. Reed (PDPTA, 1999)

Discrete analysis of continuous behaviour in real-time concurrent systems. - Joël Ouaknine (2000)

Digitisation and Full Abstraction for Dense-Time Model Checking. - Joël Ouaknine (TACAS, 2002)

Informatic vs. Classical Differentiation on the Real Line. - Keye Martin; Joël Ouaknine (Workshop on Domains, 2002)

Timed CSP = Closed Timed Safety Automata. - Joël Ouaknine; James Worrell 001 (EXPRESS, 2002)

An Intrinsic Characterization of Approximate Probabilistic Bisimilarity. - Franck van Breugel; Michael W. Mislove; Joël Ouaknine; James Worrell 001 (FoSSaCS, 2003)

Universality and Language Inclusion for Open and Closed Timed Automata. - Joël Ouaknine; James Worrell 001 (HSCC, 2003)

Revisiting Digitization, Robustness, and Decidability for Timed Automata. - Joël Ouaknine; James Worrell 001 (LICS, 2003)

Automated Compositional Abstraction Refinement for Concurrent C Programs: A Two-Level Approach. - Sagar Chaki; Joël Ouaknine; Karen Yorav; Edmund M. Clarke (SoftMC@CAV, 2003)

Axioms for Probability and Nondeterminism. - Michael W. Mislove; Joël Ouaknine; James Worrell 001 (EXPRESS, 2003)

Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems. - Edmund M. Clarke; Ansgar Fehnker; Zhi Han; Bruce H. Krogh; Joël Ouaknine; Olaf Stursberg; Michael Theobald (Int. J. Found. Comput. Sci., 2003)

Timed CSP = Closed Timed epsilon-automata. - Joël Ouaknine; James Worrell 001 (Nord. J. Comput., 2003)

Abstraction-Based Satisfiability Solving of Presburger Arithmetic. - Daniel Kroening; Joël Ouaknine; Sanjit A. Seshia; Ofer Strichman (CAV, 2004)

Duality for Labelled Markov Processes. - Michael W. Mislove; Joël Ouaknine; Dusko Pavlovic; James Worrell 001 (FoSSaCS, 2004)

State/Event-Based Software Model Checking. - Sagar Chaki; Edmund M. Clarke; Joël Ouaknine; Natasha Sharygina; Nishant Sinha 001 (IFM, 2004)

On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. - Joël Ouaknine; James Worrell 001 (LICS, 2004)

Automated, compositional and iterative deadlock detection. - Sagar Chaki; Edmund M. Clarke; Joël Ouaknine; Natasha Sharygina (MEMOCODE, 2004)

Completeness and Complexity of Bounded Model Checking. - Edmund M. Clarke; Daniel Kroening; Joël Ouaknine; Ofer Strichman (VMCAI, 2004)

Efficient Verification of Sequential and Concurrent C Programs. - Sagar Chaki; Edmund M. Clarke; Alex Groce; Joël Ouaknine; Ofer Strichman; Karen Yorav (Formal Methods Syst. Des., 2004)

On Probabilistic Program Equivalence and Refinement. - Andrzej S. Murawski; Joël Ouaknine (CONCUR, 2005)

Decidability and Complexity Results for Timed Automata via Channel Machines. - Parosh Aziz Abdulla; Johann Deneux; Joël Ouaknine; James Worrell 001 (ICALP, 2005)

State/Event Software Verification for Branching-Time Specifications. - Sagar Chaki; Edmund M. Clarke; Orna Grumberg; Joël Ouaknine; Natasha Sharygina; Tayssir Touili; Helmut Veith (IFM, 2005)

On the Decidability of Metric Temporal Logic. - Joël Ouaknine; James Worrell 001 (LICS, 2005)

On Timed Models and Full Abstraction. - Gavin Lowe; Joël Ouaknine (MFPS, 2005)

Timed CSP: A Retrospective. - Joël Ouaknine; Steve A. Schneider (APC 25, 2005)

Parallel Assignments in Software Model Checking. - Murray Stokely; Sagar Chaki; Joël Ouaknine (SVV@ICFEM, 2005)

Concurrent software verification with states, events, and deadlocks. - Sagar Chaki; Edmund M. Clarke; Joël Ouaknine; Natasha Sharygina; Nishant Sinha 001 (Formal Aspects Comput., 2005)

Computational challenges in bounded model checking. - Edmund M. Clarke; Daniel Kroening; Joël Ouaknine; Ofer Strichman (Int. J. Softw. Tools Technol. Transf., 2005)

Verification of Reactive Systems: Formal Methods and Algorithms. By Klaus Schneider. Springer, Texts in Theoretical Computer Science Series, 2004, ISBN: 3-540-00296-0, pp 600. - Joël Ouaknine (Softw. Test. Verification Reliab., 2005)

Domain theory, testing and simulation for labelled Markov processes. - Franck van Breugel; Michael W. Mislove; Joël Ouaknine; James Worrell 001 (Theor. Comput. Sci., 2005)

On Metric Temporal Logic and Faulty Turing Machines. - Joël Ouaknine; James Worrell 001 (FoSSaCS, 2006)

Sudoku as a SAT Problem. - Inês Lynce; Joël Ouaknine (AI&M, 2006)

Safety Metric Temporal Logic Is Fully Decidable. - Joël Ouaknine; James Worrell 001 (TACAS, 2006)

Undecidability of Universality for Timed Automata with Minimal Resources. - Sara Adams; Joël Ouaknine; James Worrell 001 (FORMATS, 2007)

Zone-Based Universality Analysis for Single-Clock Timed Automata. - Parosh Aziz Abdulla; Joël Ouaknine; Karin Quaas; James Worrell 001 (FSEN, 2007)

The Cost of Punctuality. - Patricia Bouyer; Nicolas Markey; Joël Ouaknine; James Worrell 001 (LICS, 2007)

Deciding Bit-Vector Arithmetic with Abstraction. - Randal E. Bryant; Daniel Kroening; Joël Ouaknine; Sanjit A. Seshia; Ofer Strichman; Bryan A. Brady (TACAS, 2007)

On the decidability and complexity of Metric Temporal Logic over finite words. - Joël Ouaknine; James Worrell 001 (Log. Methods Comput. Sci., 2007)

Some Recent Results in Metric Temporal Logic. - Joël Ouaknine; James Worrell 001 (FORMATS, 2008)

On Expressiveness and Complexity in Real-Time Model Checking. - Patricia Bouyer; Nicolas Markey; Joël Ouaknine; James Worrell 001 (ICALP (2), 2008)

On Termination for Faulty Channel Machines. - Patricia Bouyer; Nicolas Markey; Joël Ouaknine; Philippe Schnoebelen; James Worrell 001 (STACS, 2008)

On Automated Verification of Probabilistic Programs. - Axel Legay; Andrzej S. Murawski; Joël Ouaknine; James Worrell 001 (TACAS, 2008)

Universality Analysis for One-Clock Timed Automata. - Parosh Aziz Abdulla; Johann Deneux; Joël Ouaknine; Karin Quaas; James Worrell 001 (Fundam. Informaticae, 2008)

Nets with Tokens which Carry Data. - Ranko Lazic 001; Thomas Christopher Newcomb; Joël Ouaknine; A. W. Roscoe 001; James Worrell 001 (Fundam. Informaticae, 2008)

Reachability in Succinct and Parametric One-Counter Automata. - Christoph Haase; Stephan Kreutzer; Joël Ouaknine; James Worrell 001 (CONCUR, 2009)

Time-Bounded Verification. - Joël Ouaknine; Alexander Rabinovich; James Worrell 001 (CONCUR, 2009)

Faster FDR Counterexample Generation Using SAT-Solving. - Hristina Palikareva; Joël Ouaknine; Bill Roscoe (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2009)

An abstraction-based decision procedure for bit-vector arithmetic. - Randal E. Bryant; Daniel Kroening; Joël Ouaknine; Sanjit A. Seshia; Ofer Strichman; Bryan A. Brady (Int. J. Softw. Tools Technol. Transf., 2009)

On Process-Algebraic Extensions of Metric Temporal Logic. - Christoph Haase; Joël Ouaknine; James Worrell 001 (Reflections on the Work of C. A. R. Hoare, 2010)

Computing Rational Radical Sums in Uniform TC^0. - Paul Hunter 001; Patricia Bouyer; Nicolas Markey; Joël Ouaknine; James Worrell 001 (FSTTCS, 2010)

Model Checking Succinct and Parametric One-Counter Automata. - Stefan Göller; Christoph Haase; Joël Ouaknine; James Worrell 001 (ICALP (2), 2010)

Towards a Theory of Time-Bounded Verification. - Joël Ouaknine; James Worrell 001 (ICALP (2), 2010)

Alternating Timed Automata over Bounded Time. - Mark Jenkins; Joël Ouaknine; Alexander Rabinovich; James Worrell 001 (LICS, 2010)

Language Equivalence for Probabilistic Automata. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (CAV, 2011)

Linear Completeness Thresholds for Bounded Model Checking. - Daniel Kroening; Joël Ouaknine; Ofer Strichman; Thomas Wahl; James Worrell 001 (CAV, 2011)

Tractable Reasoning in a Fragment of Separation Logic. - Byron Cook; Christoph Haase; Joël Ouaknine; Matthew J. Parkinson; James Worrell 001 (CONCUR, 2011)

Static Livelock Analysis in CSP. - Joël Ouaknine; Hristina Palikareva; A. W. Roscoe 001; James Worrell 001 (CONCUR, 2011)

The Church Synthesis Problem with Metric. - Mark Jenkins; Joël Ouaknine; Alexander Rabinovich; James Worrell 001 (CSL, 2011)

On Reachability for Hybrid Automata over Bounded Time. - Thomas Brihaye; Laurent Doyen 001; Gilles Geeraerts; Joël Ouaknine; Jean-François Raskin; James Worrell 001 (ICALP (2), 2011)

On Stabilization in Herman's Algorithm. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; James Worrell 001; Lijun Zhang 001 (ICALP (2), 2011)

On Searching for Small Kochen-Specker Vector Systems. - Felix Arends; Joël Ouaknine; Charles W. Wampler (WG, 2011)

Preface. - Michael W. Mislove; Joël Ouaknine (MFPS, 2011)

Recent Developments in FDR. - Philip J. Armstrong; Michael Goldsmith; Gavin Lowe; Joël Ouaknine; Hristina Palikareva; A. W. Roscoe 001; James Worrell 001 (CAV, 2012)

APEX: An Analyzer for Open Probabilistic Programs. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (CAV, 2012)

Branching-Time Model Checking of Parametric One-Counter Automata. - Stefan Göller; Christoph Haase; Joël Ouaknine; James Worrell 001 (FoSSaCS, 2012)

On the Complexity of the Equivalence Problem for Probabilistic Automata. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (FoSSaCS, 2012)

On the Magnitude of Completeness Thresholds in Bounded Model Checking. - Daniel Bundala; Joël Ouaknine; James Worrell 001 (LICS, 2012)

On the Relationship between Reachability Problems in Timed and Counter Automata. - Christoph Haase; Joël Ouaknine; James Worrell 001 (RP, 2012)

Decision Problems for Linear Recurrence Sequences. - Joël Ouaknine; James Worrell 001 (RP, 2012)

When is Metric Temporal Logic Expressively Complete? - Paul Hunter 001; Joël Ouaknine; James Worrell 001 (CoRR, 2012)

Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints - Thomas Brihaye; Laurent Doyen 001; Gilles Geeraerts; Joël Ouaknine; Jean-François Raskin; James Worrell 001 (CoRR, 2012)

On termination and invariance for faulty channel machines. - Patricia Bouyer; Nicolas Markey; Joël Ouaknine; Philippe Schnoebelen; James Worrell 001 (Formal Aspects Comput., 2012)

Three tokens in Herman's algorithm. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (Formal Aspects Comput., 2012)

SAT-solving in CSP trace refinement. - Hristina Palikareva; Joël Ouaknine; A. W. Roscoe 001 (Sci. Comput. Program., 2012)

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. - Thomas Brihaye; Laurent Doyen 001; Gilles Geeraerts; Joël Ouaknine; Jean-François Raskin; James Worrell 001 (ATVA, 2013)

SeLoger: A Tool for Graph-Based Reasoning in Separation Logic. - Christoph Haase; Samin Ishtiaq; Joël Ouaknine; Matthew J. Parkinson (CAV, 2013)

Verifying multi-threaded software with impact. - Björn Wachter; Daniel Kroening; Joël Ouaknine (FMCAD, 2013)

Specification and Verification of Linear Dynamical Systems: Advances and Challenges. - Joël Ouaknine (FroCos, 2013)

Discrete Linear Dynamical Systems. - Joël Ouaknine (LATA, 2013)

Expressive Completeness for Metric Temporal Logic. - Paul Hunter 001; Joël Ouaknine; James Worrell 001 (LICS, 2013)

Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian. - Ranko Lazic 001; Joël Ouaknine; James Worrell 001 (MFCS, 2013)

The orbit problem in higher dimensions. - Ventsislav Chonev; Joël Ouaknine; James Worrell 001 (STOC, 2013)

Decision Problems for Linear Recurrence Sequences. - Joël Ouaknine (SCSS, 2013)

On the Complexity of Path Checking of Temporal Logics. - Daniel Bundala; Joël Ouaknine (CoRR, 2013)

Effective Positivity Problems for Simple Linear Recurrence Sequences. - Joël Ouaknine; James Worrell 001 (CoRR, 2013)

On the Complexity of Equivalence and Minimisation for Q-weighted Automata - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (Log. Methods Comput. Sci., 2013)

A Static Analysis Framework for Livelock Freedom in CSP - Joël Ouaknine; Hristina Palikareva; A. W. Roscoe 001; James Worrell 001 (Log. Methods Comput. Sci., 2013)

Algorithmic probabilistic game semantics - Playing games with automata. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (Formal Methods Syst. Des., 2013)

Model checking Timed CSP. - Philip J. Armstrong; Gavin Lowe; Joël Ouaknine; Bill Roscoe (HOWARD-60, 2014)

Foundations for Decision Problems in Separation Logic with General Inductive Predicates. - Timos Antonopoulos; Nikos Gorogiannis; Christoph Haase; Max I. Kanovich; Joël Ouaknine (FoSSaCS, 2014)

On the Complexity of Temporal-Logic Path Checking. - Daniel Bundala; Joël Ouaknine (ICALP (2), 2014)

On the Positivity Problem for Simple Linear Recurrence Sequences, . - Joël Ouaknine; James Worrell 001 (ICALP (2), 2014)

Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences. - Joël Ouaknine; James Worrell 001 (ICALP (2), 2014)

Advances in Parametric Real-Time Reasoning. - Daniel Bundala; Joël Ouaknine (MFCS (1), 2014)

Online Monitoring of Metric Temporal Logic. - Hsi-Ming Ho; Joël Ouaknine; James Worrell 001 (RV, 2014)

Positivity Problems for Low-Order Linear Recurrence Sequences. - Joël Ouaknine; James Worrell 001 (SODA, 2014)

The CR-UAV Problem is PSPACE-Complete. - Hsi-Ming Ho; Joël Ouaknine (CoRR, 2014)

Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141). - Javier Esparza; Alain Finkel; Pierre McKenzie; Joël Ouaknine (Dagstuhl Reports, 2014)

The Cyclic-Routing UAV Problem is PSPACE-Complete. - Hsi-Ming Ho; Joël Ouaknine (FoSSaCS, 2015)

On the Complexity of Linear Arithmetic with Divisibility. - Antonia Lechner; Joël Ouaknine; James Worrell 001 (LICS, 2015)

The Polyhedron-Hitting Problem. - Ventsislav Chonev; Joël Ouaknine; James Worrell 001 (SODA, 2015)

On Termination of Integer Linear Loops. - Joël Ouaknine; João Sousa Pinto; James Worrell 001 (SODA, 2015)

On Matrix Powering in Low Dimensions. - Esther Galby; Joël Ouaknine; James Worrell 001 (STACS, 2015)

On the Decidability of the Bounded Continuous Skolem Problem. - Ventsislav Chonev; Joël Ouaknine; James Worrell 001 (CoRR, 2015)

On the Decidability of the Continuous Infinite Zeros Problem. - Ventsislav Chonev; Joël Ouaknine; James Worrell 001 (CoRR, 2015)

The Polyhedral Escape Problem is Decidable. - Joël Ouaknine; João Sousa Pinto; James Worrell 001 (CoRR, 2015)

Reachability problems for Markov chains. - S. Akshay 001; Timos Antonopoulos; Joël Ouaknine; James Worrell 001 (Inf. Process. Lett., 2015)

On linear recurrence sequences and loop termination. - Joël Ouaknine; James Worrell 001 (ACM SIGLOG News, 2015)

Proving the Herman-Protocol Conjecture. - Maria Bruna; Radu Grigore; Stefan Kiefer; Joël Ouaknine; James Worrell 001 (ICALP, 2016)

On the Skolem Problem for Continuous Linear Dynamical Systems. - Ventsislav Chonev; Joël Ouaknine; James Worrell 001 (ICALP, 2016)

On Recurrent Reachability for Continuous Linear Dynamical Systems. - Ventsislav Chonev; Joël Ouaknine; James Worrell 001 (LICS, 2016)

Solvability of Matrix-Exponential Equations. - Joël Ouaknine; Amaury Pouly; João Sousa Pinto; James Worrell 001 (LICS, 2016)

Relating Reachability Problems in Timed and Counter Automata. - Christoph Haase; Joël Ouaknine; James Worrell 001 (Fundam. Informaticae, 2016)

On the Complexity of the Orbit Problem. - Ventsislav Chonev; Joël Ouaknine; James Worrell 001 (J. ACM, 2016)

Zeno, Hercules, and the Hydra: Safety Metric Temporal Logic is Ackermann-Complete. - Ranko Lazic 001; Joël Ouaknine; James Worrell 001 (ACM Trans. Comput. Log., 2016)

Timed Temporal Logics. - Patricia Bouyer; François Laroussinie; Nicolas Markey; Joël Ouaknine; James Worrell 001 (Models, Algorithms, Logics and Tools, 2017)

On the Polytope Escape Problem for Continuous Linear Dynamical Systems. - Joël Ouaknine; João Sousa Pinto; James Worrell 001 (HSCC, 2017)

The Polytope-Collision Problem. - Shaull Almagor; Joël Ouaknine; James Worrell 001 (ICALP, 2017)

LICS 2017 foreword. - Joël Ouaknine (LICS, 2017)

Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. - Nathanaël Fijalkow; Pierre Ohlmann; Joël Ouaknine; Amaury Pouly; James Worrell 001 (STACS, 2017)

On parametric timed automata and one-counter machines. - Daniel Bundala; Joël Ouaknine (Inf. Comput., 2017)

Effective Divergence Analysis for Linear Recurrence Sequences. - Shaull Almagor; Brynmor Chapman; Mehran Hosseini; Joël Ouaknine; James Worrell 001 (CONCUR, 2018)

O-Minimal Invariants for Linear Loops. - Shaull Almagor; Dmitry Chistikov 001; Joël Ouaknine; James Worrell 001 (ICALP, 2018)

Convex Language Semantics for Nondeterministic Probabilistic Automata. - Gerco van Heerdt; Justin Hsu; Joël Ouaknine; Alexandra Silva 001 (ICTAC, 2018)

Polynomial Invariants for Affine Programs. - Ehud Hrushovski; Joël Ouaknine; Amaury Pouly; James Worrell 001 (LICS, 2018)

Model Checking Flat Freeze LTL on One-Counter Automata. - Antonia Lechner; Richard Mayr; Joël Ouaknine; Amaury Pouly; James Worrell 001 (Log. Methods Comput. Sci., 2018)

Reachability Problems 2014: Special issue. - Joël Ouaknine; Igor Potapov; James Worrell 001 (Theor. Comput. Sci., 2018)

Model Checking Real-Time Systems. - Patricia Bouyer; Uli Fahrenberg; Kim Guldstrand Larsen; Nicolas Markey; Joël Ouaknine; James Worrell 001 (Handbook of Model Checking, 2018)

Program Invariants (Invited Talk). - Joël Ouaknine (CONCUR, 2019)

On the decidability of reachability in linear time-invariant systems. - Nathanaël Fijalkow; Joël Ouaknine; Amaury Pouly; João Sousa Pinto; James Worrell 001 (HSCC, 2019)

On Reachability Problems for Low-Dimensional Matrix Semigroups. - Thomas Colcombet; Joël Ouaknine; Pavel Semukhin; James Worrell 001 (ICALP, 2019)

Termination of Linear Loops over the Integers. - Mehran Hosseini; Joël Ouaknine; James Worrell 001 (ICALP, 2019)

On the Monniaux Problem in Abstract Interpretation. - Nathanaël Fijalkow; Engel Lefaucheux; Pierre Ohlmann; Joël Ouaknine; Amaury Pouly; James Worrell 001 (SAS, 2019)

The Semialgebraic Orbit Problem. - Shaull Almagor; Joël Ouaknine; James Worrell 001 (STACS, 2019)

On Termination of Integer Linear Loops. - Mehran Hosseini; Joël Ouaknine; James Worrell 001 (CoRR, 2019)

On the Decidability of Membership in Matrix-exponential Semigroups. - Joël Ouaknine; Amaury Pouly; João Sousa Pinto; James Worrell 001 (J. ACM, 2019)

Cyclic-routing of Unmanned Aerial Vehicles. - Nir Drucker; Hsi-Ming Ho; Joël Ouaknine; Michal Penn; Ofer Strichman (J. Comput. Syst. Sci., 2019)

On the Expressiveness and Monitoring of Metric Temporal Logic. - Hsi-Ming Ho; Joël Ouaknine; James Worrell 001 (Log. Methods Comput. Sci., 2019)

Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. - Nathanaël Fijalkow; Pierre Ohlmann; Joël Ouaknine; Amaury Pouly; James Worrell 001 (Theory Comput. Syst., 2019)

Algebraic Invariants for Linear Hybrid Automata. - Rupak Majumdar; Joël Ouaknine; Amaury Pouly; James Worrell 001 (CONCUR, 2020)

On Ranking Function Synthesis and Termination for Polynomial Programs. - Eike Neumann; Joël Ouaknine; James Worrell 001 (CONCUR, 2020)

Reachability in Dynamical Systems with Rounding. - Christel Baier; Florian Funke 002; Simon Jantsch; Toghrul Karimov; Engel Lefaucheux; Joël Ouaknine; Amaury Pouly; David Purser; Markus A. Whiteland (FSTTCS, 2020)

Invariants for Continuous Linear Dynamical Systems. - Shaull Almagor; Edon Kelmendi; Joël Ouaknine; James Worrell 001 (ICALP, 2020)

On the skolem problem and prime powers. - George Kenison; Richard Lipton 001; Joël Ouaknine; James Worrell 001 (ISSAC, 2020)

On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems. - Toghrul Karimov; Joël Ouaknine; James Worrell 001 (MFCS, 2020)

How Fast Can You Escape a Compact Polytope? - Julian D'Costa; Engel Lefaucheux; Joël Ouaknine; James Worrell 001 (STACS, 2020)

Porous Invariants. - Engel Lefaucheux; Joël Ouaknine; David Purser; James Worrell 001 (CAV (2), 2021)

The Orbit Problem for Parametric Linear Dynamical Systems. - Christel Baier; Florian Funke 002; Simon Jantsch; Toghrul Karimov; Engel Lefaucheux; Florian Luca; Joël Ouaknine; David Purser; Markus A. Whiteland; James Worrell 001 (CONCUR, 2021)

Decision Problems for Second-Order Holonomic Recurrences. - Eike Neumann; Joël Ouaknine; James Worrell 001 (ICALP, 2021)

Universal Skolem Sets. - Florian Luca; Joël Ouaknine; James Worrell 001 (LICS, 2021)

The Pseudo-Skolem Problem is Decidable. - Julian D'Costa; Toghrul Karimov; Rupak Majumdar; Joël Ouaknine; Mahmoud Salamati; Sadegh Soudjani; James Worrell 001 (MFCS, 2021)

On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. - Julian D'Costa; Engel Lefaucheux; Eike Neumann; Joël Ouaknine; James Worrell 001 (MFCS, 2021)

On Positivity and Minimality for Second-Order Holonomic Sequences. - George Kenison; Oleksiy Klurman; Engel Lefaucheux; Florian Luca; Pieter Moree; Joël Ouaknine; Markus A. Whiteland; James Worrell 001 (MFCS, 2021)

Holonomic Techniques, Periods, and Decision Problems (Invited Talk). - Joël Ouaknine (MFCS, 2021)

The Orbit Problem for Parametric Linear Dynamical Systems. - Christel Baier; Florian Funke 002; Simon Jantsch; Engel Lefaucheux; Florian Luca; Joël Ouaknine; David Purser; Markus A. Whiteland; James Worrell 001 (CoRR, 2021)

Preface. - Mikolaj Bojanczyk; Thomas Brihaye; Christoph Haase; Slawomir Lasota 001; Joël Ouaknine; Igor Potapov (Inf. Comput., 2021)

First-Order Orbit Queries. - Shaull Almagor; Joël Ouaknine; James Worrell 001 (Theory Comput. Syst., 2021)

Deciding ω-regular properties on linear recurrence sequences. - Shaull Almagor; Toghrul Karimov; Edon Kelmendi; Joël Ouaknine; James Worrell 001 (Proc. ACM Program. Lang., 2021)

What's Decidable About Discrete Linear Dynamical Systems? - Toghrul Karimov; Edon Kelmendi; Joël Ouaknine; James Worrell 001 (Principles of Systems Design, 2022)

Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications. - Christel Baier; Florian Funke 002; Simon Jantsch; Toghrul Karimov; Engel Lefaucheux; Joël Ouaknine; David Purser; Markus A. Whiteland; James Worrell 001 (CONCUR, 2022)

Algebraic Model Checking for Discrete Linear Dynamical Systems. - Florian Luca; Joël Ouaknine; James Worrell 001 (FORMATS, 2022)

On the Skolem Problem and the Skolem Conjecture. - Richard Lipton 001; Florian Luca; Joris Nieuwveld; Joël Ouaknine; David Purser; James Worrell 001 (LICS, 2022)

Skolem Meets Schanuel. - Yuri Bilu; Florian Luca; Joris Nieuwveld; Joël Ouaknine; David Purser; James Worrell 001 (MFCS, 2022)

The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems. - Julian D'Costa; Toghrul Karimov; Rupak Majumdar; Joël Ouaknine; Mahmoud Salamati; James Worrell 001 (MFCS, 2022)

Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. - Julian D'Costa; Engel Lefaucheux; Eike Neumann; Joël Ouaknine; James Worrell 001 (MFCS, 2022)

A Universal Skolem Set of Positive Lower Density. - Florian Luca; Joël Ouaknine; James Worrell 001 (MFCS, 2022)

The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems. - Julian D'Costa; Toghrul Karimov; Joël Ouaknine; Mahmoud Salamati; James Worrell 001 (CoRR, 2022)

Sequential Relational Decomposition. - Dror Fried; Axel Legay; Joël Ouaknine; Moshe Y. Vardi (Log. Methods Comput. Sci., 2022)

What's decidable about linear loops? - Toghrul Karimov; Engel Lefaucheux; Joël Ouaknine; David Purser; Anton Varonka; Markus A. Whiteland; James Worrell 001 (Proc. ACM Program. Lang., 2022)

O-Minimal Invariants for Discrete-Time Dynamical Systems. - Shaull Almagor; Dmitry Chistikov 001; Joël Ouaknine; James Worrell 001 (ACM Trans. Comput. Log., 2022)

Positivity Problems for Reversible Linear Recurrence Sequences. - George Kenison; Joris Nieuwveld; Joël Ouaknine; James Worrell 001 (ICALP, 2023)

Reachability in Injective Piecewise Affine Maps. - Faraz Ghahremani; Edon Kelmendi; Joël Ouaknine (LICS, 2023)

The Power of Positivity. - Toghrul Karimov; Edon Kelmendi; Joris Nieuwveld; Joël Ouaknine; James Worrell 001 (LICS, 2023)

Model Checking Linear Dynamical Systems under Floating-point Rounding. - Engel Lefaucheux; Joël Ouaknine; David Purser; Mohammadamin Sharifi (TACAS (1), 2023)

Skolem Meets Bateman-Horn. - Florian Luca; James Maynard 001; Armand Noubissie; Joël Ouaknine; James Worrell 001 (CoRR, 2023)

Transcendence of Sturmian Numbers over an Algebraic Base. - Florian Luca; Joël Ouaknine; James Worrell 001 (CoRR, 2023)

The Monadic Theory of Toric Words. - Valérie Berthé; Toghrul Karimov; Joël Ouaknine; Mihir Vahanwala; James Worrell 001 (CoRR, 2023)

On the Zeros of Exponential Polynomials. - Ventsislav Chonev; Joël Ouaknine; James Worrell 001 (J. ACM, 2023)

On Strongest Algebraic Program Invariants. - Ehud Hrushovski; Joël Ouaknine; Amaury Pouly; James Worrell 001 (J. ACM, 2023)

On the 𝑝-adic zeros of the Tribonacci sequence. - Yuri Bilu; Florian Luca; Joris Nieuwveld; Joël Ouaknine; James Worrell 001 (Math. Comput., 2023)

Inaproximability in Weighted Timed Games. - Quentin Guilmant; Joël Ouaknine (CONCUR, 2024)

Linear dynamical systems with continuous weight functions. - Rajab Aghamov; Christel Baier; Toghrul Karimov; Joël Ouaknine; Jakob Piribauer (HSCC, 2024)

The 2-Dimensional Constraint Loop Problem Is Decidable. - Quentin Guilmant; Engel Lefaucheux; Joël Ouaknine; James Worrell 001 (ICALP, 2024)

On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words. - Pavol Kebis; Florian Luca; Joël Ouaknine; Andrew Scoones; James Worrell 001 (ICALP, 2024)

On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates. - Valérie Berthé; Toghrul Karimov; Joris Nieuwveld; Joël Ouaknine; Mihir Vahanwala; James Worrell 001 (LICS, 2024)

Nonnegativity Problems for Matrix Semigroups. - Julian D'Costa; Joël Ouaknine; James Worrell 001 (STACS, 2024)

On the Counting Complexity of the Skolem Problem. - Gorav Jindal; Joël Ouaknine (CoRR, 2024)

Multiple Reachability in Linear Dynamical Systems. - Toghrul Karimov; Edon Kelmendi; Joël Ouaknine; James Worrell 001 (CoRR, 2024)

Model Checking Markov Chains as Distribution Transformers. - Rajab Aghamov; Christel Baier; Toghrul Karimov; Joris Nieuwveld; Joël Ouaknine; Jakob Piribauer; Mihir Vahanwala (CoRR, 2024)

On the Decidability of Presburger Arithmetic Expanded with Powers. - Toghrul Karimov; Florian Luca; Joris Nieuwveld; Joël Ouaknine; James Worrell 001 (CoRR, 2024)

Porous invariants for linear systems. - Engel Lefaucheux; Joël Ouaknine; David Purser; James Worrell 001 (Formal Methods Syst. Des., 2024)