| Publication | Date of Publication | Type |
|---|
A quantum game designed for property partitioning with implementation on superconducting quantum processors
Theoretical Computer Science | 2026-03-20 | Paper |
Checking continuous stochastic logic against quantum continuous-time Markov chains
Logical Methods in Computer Science | 2026-02-13 | Paper |
| A sample-driven solving procedure for the repeated reachability of quantum continuous-time Markov chains | 2025-04-25 | Paper |
scientific article; zbMATH DE number 7730615 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-21 | Paper |
An optimal quantum error-correcting procedure using quantifier elimination
Quantum Information Processing | 2023-03-15 | Paper |
Quantitative controller synthesis for consumption Markov decision processes
Information Processing Letters | 2023-01-30 | Paper |
An algebraic method to fidelity-based model checking over quantum Markov chains
Theoretical Computer Science | 2022-10-14 | Paper |
Model checking QCTL plus on quantum Markov chains
Theoretical Computer Science | 2022-04-07 | Paper |
Measuring the constrained reachability in quantum Markov chains
Acta Informatica | 2021-12-15 | Paper |
| Qsimulation V2.0: an optimized quantum simulator | 2021-07-08 | Paper |
Time-bounded termination analysis for probabilistic programs with delays
Information and Computation | 2020-12-15 | Paper |
A conflict-driven solving procedure for poly-power constraints
Journal of Automated Reasoning | 2020-03-03 | Paper |
Positive root isolation for poly-powers by exclusion and differentiation
Journal of Symbolic Computation | 2017-10-10 | Paper |
Positive root isolation for poly-powers
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
Multiphase until formulas over Markov reward models: an algebraic approach
Theoretical Computer Science | 2015-12-15 | Paper |
Analyzing ultimate positivity for solvable systems
Theoretical Computer Science | 2015-12-08 | Paper |
Discovering non-terminating inputs for multi-path polynomial programs
Journal of Systems Science and Complexity | 2015-04-27 | Paper |
Quantifier elimination for a class of exponential polynomial formulas
Journal of Symbolic Computation | 2014-12-09 | Paper |
Some decidable results on reachability of solvable systems
International Journal of General Systems | 2014-01-08 | Paper |
Model checking conditional CSL for continuous-time Markov chains
Information Processing Letters | 2013-03-21 | Paper |
Symbolic termination analysis of solvable loops
Journal of Symbolic Computation | 2013-01-10 | Paper |
| scientific article; zbMATH DE number 5850072 (Why is no real title available?) | 2011-02-10 | Paper |
TERMINATION ANALYSIS OF LINEAR LOOPS
International Journal of Foundations of Computer Science | 2011-01-19 | Paper |
Real root isolation of multi-exponential polynomials with application
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
