( en | de | ru )

 

Disambiguation of "Zikelic, Dorde"

Author of the publication

copydeleteadd this publication to your clipboard
On Lexicographic Proof Rules for Probabilistic Termination.

, , , , and . FM, volume 13047 of Lecture Notes in Computer Science, page 619-639. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dorde Komljenovic

Đorđe Tomić

Winfried Dördelmann

Francesca Dordei

Heinrich Dördelmann

 

Other publications of authors with the same name

Quantitative Bounds on Resource Usage of Probabilistic Programs., , , and . Proc. ACM Program. Lang., 8 (OOPSLA1): 362-391 (2024)Optimizing Expectation with Guarantees in POMDPs., , , , and . AAAI, page 3725-3732. AAAI Press, (2017)Proving non-termination by program reversal., , , and . PLDI, page 1033-1048. ACM, (2021)Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees., , , and . AAAI, page 11926-11935. AAAI Press, (2023)A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems., , , and . TACAS (1), volume 13993 of Lecture Notes in Computer Science, page 3-25. Springer, (2023)MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives., , , and . CAV (3), volume 13966 of Lecture Notes in Computer Science, page 86-112. Springer, (2023)Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs., , , and . CAV (1), volume 13371 of Lecture Notes in Computer Science, page 55-78. Springer, (2022)On Lexicographic Proof Rules for Probabilistic Termination., , , , and . FM, volume 13047 of Lecture Notes in Computer Science, page 619-639. Springer, (2021)Stability Verification in Stochastic Control Systems via Neural Network Supermartingales., , , and . AAAI, page 7326-7336. AAAI Press, (2022)Algorithms and Hardness Results for Computing Cores of Markov Chains., , , , , and . FSTTCS, volume 250 of LIPIcs, page 29:1-29:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)