David Purser

Orcid: 0000-0003-0394-1634

Affiliations:
  • Max Planck Institute for Software Systems (MPI-SWS), Saarbrücken, Germany
  • University of Warwick, Coventry, UK (PhD 2020)


According to our database1, David Purser authored at least 34 papers between 2018 and 2023.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
SIGLOG Monthly 242.
ACM SIGLOG News, October, 2023

SIGLOG Monthly 239: July 2023.
ACM SIGLOG News, July, 2023

SIGLOG Monthly 233: January 2023.
ACM SIGLOG News, January, 2023

SIGLOG Monthly 236: April 2023.
ACM SIGLOG News, 2023

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata.
CoRR, 2023

Model Checking Linear Dynamical Systems under Floating-point Rounding.
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).
LICS, 2023

History-Deterministic Vector Addition Systems.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022
SIGLOG Monthly 230.
ACM SIGLOG News, October, 2022

SIGLOG monthly 227.
ACM SIGLOG News, 2022

SIGLOG monthly 224.
ACM SIGLOG News, 2022

SIGLOG monthly 221.
ACM SIGLOG News, 2022

What's decidable about linear loops?
Proc. ACM Program. Lang., 2022

The Big-O Problem.
Log. Methods Comput. Sci., 2022

Skolem Meets Schanuel.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

On the Skolem Problem and the Skolem Conjecture.
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.
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.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021
SIGLOG monthly 218.
ACM SIGLOG News, 2021

SIGLOG monthly 215.
ACM SIGLOG News, 2021

SIGLOG monthly 212.
ACM SIGLOG News, 2021

SIGLOG monthly 209.
ACM SIGLOG News, 2021

The Orbit Problem for Parametric Linear Dynamical Systems.
CoRR, 2021

The Orbit Problem for Parametric Linear Dynamical Systems.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

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

2020
On the complexity of verifying differential privacy.
PhD thesis, 2020

The Complexity of Verifying Loop-Free Programs as Differentially Private.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Reachability in Dynamical Systems with Rounding.
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.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
The Complexity of Verifying Circuits as Differentially Private.
CoRR, 2019

Structural liveness of Petri nets is ExpSpace-hard and decidable.
Acta Informatica, 2019

Asymmetric Distances for Approximate Differential Privacy.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
Twitter Usage Across Industry: A Spatiotemporal Analysis.
Proceedings of the Fourth IEEE International Conference on Big Data Computing Service and Applications, 2018

Bisimilarity Distances for Approximate Differential Privacy.
Proceedings of the Automated Technology for Verification and Analysis, 2018


  Loading...