Quantitative bounds on resource usage of probabilistic programs
Cost analysis, also known as resource usage analysis, is the task of finding bounds on the total cost of a program and is a well-studied problem in static analysis. In this work, we consider two classical quantitative problems in cost analysis for probabilistic programs. The first problem is to find...
محفوظ في:
المؤلفون الرئيسيون: | CHATTERJEE, Krishnendu, GOHARSHADY, Amir Kafshdar, MEGGENDORFER, Tobias, ZIKELIC, Dorde |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2026
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/sis_research/9073 https://ink.library.smu.edu.sg/context/sis_research/article/10076/viewcontent/3649824.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Singapore Management University |
اللغة: | English |
مواد مشابهة
-
Equivalence and similarity refutation for probabilistic programs
بواسطة: CHATTERJEE, Krishnendu, وآخرون
منشور في: (2025) -
Stochastic invariants for probabilistic termination
بواسطة: CHATTERJEE, Krishnendu, وآخرون
منشور في: (2017) -
On lexicographic proof rules for probabilistic termination
بواسطة: CHATTERJEE, Krishnendu, وآخرون
منشور في: (2025) -
On lexicographic proof rules for probabilistic termination
بواسطة: CHATTERJEE, Krishnendu, وآخرون
منشور في: (2021) -
Sound and complete certificates for quantitative termination analysis of probabilistic programs
بواسطة: CHATTERJEE, Krishnendu, وآخرون
منشور في: (2022)