David Purser

According to our database, David Purser authored at least 37 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

2024

Porous invariants for linear systems.

Engel Lefaucheux, Joël Ouaknine, David Purser, James Worrell

Formal Methods Syst. Des., October, 2024

SIGLOG Monthly 245: January 2024.

David Purser, Elli Anastasiadi

ACM SIGLOG News, January, 2024

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata.

Ismaël Jecker, Filip Mazowiecki, David Purser

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

The Power of Counting Steps in Quantitative Games.

Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove

Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023

SIGLOG Monthly 242.

David Purser

ACM SIGLOG News, October, 2023

SIGLOG Monthly 239: July 2023.

David Purser

ACM SIGLOG News, July, 2023

SIGLOG Monthly 233: January 2023.

David Purser

ACM SIGLOG News, January, 2023

SIGLOG Monthly 236: April 2023.

David Purser

ACM SIGLOG News, 2023

Model Checking Linear Dynamical Systems under Floating-point Rounding.

Engel Lefaucheux, Joël Ouaknine, David Purser, Mohammadamin Sharifi

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete).

Laure Daviaud, David Purser

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

History-Deterministic Vector Addition Systems.

Sougata Bose, David Purser, Patrick Totzke

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022

SIGLOG Monthly 230.

David Purser

ACM SIGLOG News, October, 2022

SIGLOG monthly 227.

David Purser

ACM SIGLOG News, 2022

SIGLOG monthly 224.

David Purser

ACM SIGLOG News, 2022

SIGLOG monthly 221.

David Purser

ACM SIGLOG News, 2022

What's decidable about linear loops?

Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Anton Varonka, Markus A. Whiteland, James Worrell

Proc. ACM Program. Lang., 2022

The Big-O Problem.

Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser

Log. Methods Comput. Sci., 2022

Skolem Meets Schanuel.

Yuri Bilu, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, James Worrell

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

On the Skolem Problem and the Skolem Conjecture.

Richard Lipton, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, James Worrell

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

The boundedness and zero isolation problems for weighted automata over nonnegative rationals.

Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications.

Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

SIGLOG monthly 218.

David Purser

ACM SIGLOG News, 2021

SIGLOG monthly 215.

David Purser

ACM SIGLOG News, 2021

SIGLOG monthly 212.

David Purser

ACM SIGLOG News, 2021

SIGLOG monthly 209.

David Purser

ACM SIGLOG News, 2021

The Orbit Problem for Parametric Linear Dynamical Systems.

Christel Baier, Florian Funke, Simon Jantsch, Engel Lefaucheux, Florian Luca, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell

CoRR, 2021

The Orbit Problem for Parametric Linear Dynamical Systems.

Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Florian Luca, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Porous Invariants.

Engel Lefaucheux, Joël Ouaknine, David Purser, James Worrell

Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020

On the complexity of verifying differential privacy.

David Purser

PhD thesis, 2020

The Complexity of Verifying Loop-Free Programs as Differentially Private.

Marco Gaboardi, Kobbi Nissim, David Purser

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Reachability in Dynamical Systems with Rounding.

Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

The Big-O Problem for Labelled Markov Chains and Weighted Automata.

Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

The Complexity of Verifying Circuits as Differentially Private.

Marco Gaboardi, Kobbi Nissim, David Purser

CoRR, 2019

Structural liveness of Petri nets is ExpSpace-hard and decidable.

Petr Jancar, David Purser

Acta Informatica, 2019

Asymmetric Distances for Approximate Differential Privacy.

Dmitry Chistikov, Andrzej S. Murawski, David Purser

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

Twitter Usage Across Industry: A Spatiotemporal Analysis.

Neha Gupta, Henry Crosby, David Purser, Stephen A. Jarvis, Weisi Guo

Proceedings of the Fourth IEEE International Conference on Big Data Computing Service and Applications, 2018

Bisimilarity Distances for Approximate Differential Privacy.

Dmitry Chistikov, Andrzej S. Murawski, David Purser

Proceedings of the Automated Technology for Verification and Analysis, 2018