| Publication | Date of Publication | Type |
|---|
Ramsey quantifiers over automatic structures: complexity and applications to verification
| 2024-12-06 | Paper |
Reasoning on data words over numeric domains
| 2024-12-06 | Paper |
Probabilistic bisimulation for parameterized systems (with applications to verifying anonymous protocols)
Computer Aided Verification | 2024-02-16 | Paper |
Decision procedures for sequence theories
| 2024-01-12 | Paper |
Complexity analysis of tree share structure
Programming Languages and Systems | 2023-08-02 | Paper |
Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
Regular model checking revisited
Model Checking, Synthesis, and Learning | 2023-05-26 | Paper |
A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type
1517.68074 | 2022-12-22 | Paper |
Monadic decomposition in integer linear arithmetic
| 2022-11-09 | Paper |
scientific article; zbMATH DE number 7561596 (Why is no real title available?)
| 2022-07-21 | Paper |
Learning union of integer hypercubes with queries (with applications to monadic decomposition)
| 2022-03-25 | Paper |
Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
| 2022-02-09 | Paper |
Parameterized synthesis with safety properties
| 2021-07-08 | Paper |
Fair termination for parameterized probabilistic concurrent systems
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Liveness of randomised parameterised systems under arbitrary schedulers
Computer Aided Verification | 2019-05-03 | Paper |
Decidable models of integer-manipulating programs with recursive parallelism
Theoretical Computer Science | 2018-11-23 | Paper |
Decidability and complexity of tree share formulas
| 2018-04-19 | Paper |
Decidable models of integer-manipulating programs with recursive parallelism
Lecture Notes in Computer Science | 2018-03-26 | Paper |
Accelerating tree-automatic relations
| 2017-01-26 | Paper |
String solving with word equations and transducers: towards a logic for analysing mutation XSS
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
A linear-time algorithm for the orbit problem over cyclic groups
Acta Informatica | 2016-08-22 | Paper |
Regular symmetry patterns
Lecture Notes in Computer Science | 2016-03-23 | Paper |
Expressive path queries on graph with data
Logical Methods in Computer Science | 2015-10-29 | Paper |
Refining the process rewrite systems hierarchy via ground tree rewrite systems
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
A linear-time algorithm for the orbit problem over cyclic groups
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Analysis of probabilistic basic parallel processes
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Expressive path queries on graphs with data
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Weakly-synchronized ground tree rewriting (with applications to verifying multithreaded programs)
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Concurrency makes simple theories hard
| 2012-08-23 | Paper |
Refining the process rewrite systems hierarchy via ground tree rewrite systems
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
