6 Publications

Mark all

[6]
2020 | Conference Paper | IST-REx-ID: 8089 | OA
Chatterjee, K., Fu, H., Goharshady, A. K., & Goharshady, E. K. (2020). Polynomial invariant generation for non-deterministic recursive programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 672–687). London, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3385412.3385969
View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2019 | Conference Paper | IST-REx-ID: 6175 | OA
Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3314221.3314581
View | Files available | DOI | arXiv
 
[4]
2018 | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee, K., Fu, H., Goharshady, A., & Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/653
View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2018 | Journal Article | IST-REx-ID: 5993 | OA
Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems, 40(2), 7. https://doi.org/10.1145/3174800
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[2]
2016 | Conference Paper | IST-REx-ID: 1386 | OA
Chatterjee, K., Fu, H., & Goharshady, A. (2016). Termination analysis of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. https://doi.org/10.1007/978-3-319-41528-4_1
View | DOI | Download Preprint (ext.)
 
[1]
2016 | Conference Paper | IST-REx-ID: 1438 | OA
Chatterjee, K., Fu, H., Novotny, P., & Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837639
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

6 Publications

Mark all

[6]
2020 | Conference Paper | IST-REx-ID: 8089 | OA
Chatterjee, K., Fu, H., Goharshady, A. K., & Goharshady, E. K. (2020). Polynomial invariant generation for non-deterministic recursive programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 672–687). London, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3385412.3385969
View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2019 | Conference Paper | IST-REx-ID: 6175 | OA
Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3314221.3314581
View | Files available | DOI | arXiv
 
[4]
2018 | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee, K., Fu, H., Goharshady, A., & Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/653
View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2018 | Journal Article | IST-REx-ID: 5993 | OA
Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems, 40(2), 7. https://doi.org/10.1145/3174800
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[2]
2016 | Conference Paper | IST-REx-ID: 1386 | OA
Chatterjee, K., Fu, H., & Goharshady, A. (2016). Termination analysis of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. https://doi.org/10.1007/978-3-319-41528-4_1
View | DOI | Download Preprint (ext.)
 
[1]
2016 | Conference Paper | IST-REx-ID: 1438 | OA
Chatterjee, K., Fu, H., Novotny, P., & Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837639
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed