Folgen
Djordje Zikelic
Djordje Zikelic
Sonstige NamenĐorđe Žikelić, Dorde Zikelic
Bestätigte E-Mail-Adresse bei smu.edu.sg - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Stochastic invariants for probabilistic termination
K Chatterjee, P Novotný, Ð Žikelić
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming …, 2017
1152017
Scalable verification of quantized neural networks
TA Henzinger, M Lechner, Đ Žikelić
Proceedings of the AAAI conference on artificial intelligence 35 (5), 3787-3795, 2021
35*2021
Stability verification in stochastic control systems via neural network supermartingales
M Lechner, Đ Žikelić, K Chatterjee, TA Henzinger
Proceedings of the AAAI Conference on Artificial Intelligence 36 (7), 7326-7336, 2022
272022
Sound and complete certificates for quantitative termination analysis of probabilistic programs
K Chatterjee, AK Goharshady, T Meggendorfer, Đ Žikelić
International Conference on Computer Aided Verification, 55-78, 2022
242022
Infinite time horizon safety of bayesian neural networks
M Lechner, Đ Žikelić, K Chatterjee, T Henzinger
Advances in Neural Information Processing Systems 34, 10171-10185, 2021
202021
Proving non-termination by program reversal
K Chatterjee, EK Goharshady, P Novotný, Đ Žikelić
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming …, 2021
202021
Bidding mechanisms in graph games
G Avni, TA Henzinger, Đ Žikelić
Journal of Computer and System Sciences 119, 133-144, 2021
192021
Learning control policies for stochastic systems with reach-avoid guarantees
Đ Žikelić, M Lechner, TA Henzinger, K Chatterjee
Proceedings of the AAAI Conference on Artificial Intelligence 37 (10), 11926 …, 2023
152023
Optimizing expectation with guarantees in POMDPs
K Chatterjee, P Novotný, G Pérez, JF Raskin, Đ Žikelić
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
152017
On lexicographic proof rules for probabilistic termination
K Chatterjee, EK Goharshady, P Novotný, J Zárevúcky, Đ Žikelić
Formal Methods: 24th International Symposium, FM 2021, Virtual Event …, 2021
132021
Infinite-duration all-pay bidding games
G Avni, I Jecker, Đ Žikelić
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
122021
A learner-verifier framework for neural network controllers and certificates of stochastic systems
K Chatterjee, TA Henzinger, M Lechner, Đ Žikelić
International Conference on Tools and Algorithms for the Construction and …, 2023
52023
Compositional policy learning in stochastic control systems with formal guarantees
Đ Žikelić, M Lechner, A Verma, K Chatterjee, T Henzinger
Advances in Neural Information Processing Systems 36, 2024
42024
MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives
S Akshay, K Chatterjee, T Meggendorfer, Đ Žikelić
arXiv preprint arXiv:2305.16796, 2023
42023
Algorithms and Hardness Results for Computing Cores of Markov Chains
A Ahmadi, K Chatterjee, AK Goharshady, T Meggendorfer, R Safavi, ...
42nd IARCS Annual Conference on Foundations of Software Technology and …, 2022
42022
Differential cost analysis with simultaneous potentials and anti-potentials
Đ Žikelić, BYE Chang, P Bolignano, F Raimondi
Proceedings of the 43rd ACM SIGPLAN International Conference on Programming …, 2022
42022
Quantitative bounds on resource usage of probabilistic programs
K Chatterjee, AK Goharshady, T Meggendorfer, Đ Žikelić
Proceedings of the ACM on Programming Languages 8 (OOPSLA1), 362-391, 2024
32024
Bidding graph games with partially-observable budgets
G Avni, I Jecker, Đ Žikelić
Proceedings of the AAAI Conference on Artificial Intelligence 37 (5), 5464-5471, 2023
32023
Learning Stabilizing Policies in Stochastic Control Systems
Đ Žikelić, M Lechner, K Chatterjee, TA Henzinger
arXiv preprint arXiv:2205.11991, 2022
3*2022
Sound and complete witnesses for template-based verification of LTL properties on polynomial programs
K Chatterjee, AK Goharshady, EK Goharshady, M Karrabi, Đ Žikelić
arXiv preprint arXiv:2403.05386, 2024
22024
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20