Suivre
Mateusz Ujma
Mateusz Ujma
DPhil Student, Oxford University
Adresse e-mail validée de cs.ox.ac.uk
Titre
Citée par
Citée par
Année
Verification of Markov decision processes using learning algorithms
T Brázdil, K Chatterjee, M Chmelik, V Forejt, J Křetínský, M Kwiatkowska, ...
Automated Technology for Verification and Analysis: 12th International …, 2014
2402014
Software engineering meets control theory
A Filieri, M Maggio, K Angelopoulos, N d'Ippolito, I Gerostathopoulos, ...
2015 IEEE/ACM 10th International Symposium on Software Engineering for …, 2015
1272015
Control strategies for self-adaptive software systems
A Filieri, M Maggio, K Angelopoulos, N D’ippolito, I Gerostathopoulos, ...
ACM Transactions on Autonomous and Adaptive Systems (TAAS) 11 (4), 1-31, 2017
872017
Permissive controller synthesis for probabilistic systems
K Drager, V Forejt, M Kwiatkowska, D Parker, M Ujma
Logical Methods in Computer Science 11, 2015
592015
Incremental runtime verification of probabilistic systems
V Forejt, M Kwiatkowska, D Parker, H Qu, M Ujma
Runtime Verification: Third International Conference, RV 2012, Istanbul …, 2013
492013
Jpf-awt: Model checking gui applications
P Mehlitz, O Tkachuk, M Ujma
2011 26th IEEE/ACM International Conference on Automated Software …, 2011
412011
On verification and controller synthesis for probabilistic systems at runtime
M Ujma
University of Oxford, 2015
192015
jpf-concurrent: an extension of Java PathFinder for java. util. concurrent
M Ujma, N Shafiei
JPF Workshop, Lawrence, USA, 2012
112012
On incremental quantitative verification for probabilistic systems
M Kwiatkowska, D Parker, H Qu, M Ujma
High-order workshop on automated runtime verification and debugging, 2011
92011
Learning Algorithms for Verification of Markov Decision Processes
T Brázdil, K Chatterjee, M Chmelik, V Forejt, J Křetínský, M Kwiatkowska, ...
arXiv preprint arXiv:2403.09184, 2024
2024
INCREMENTAL RUNTIME VERIFICATION OF PROBABLISTIC SYSTEMS
H Qu, M Ujma
2012
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–11