6 Publications

Mark all

[6]
2020 | Conference Paper | IST-REx-ID: 8089 | OA
Chatterjee K, Fu H, Goharshady AK, Goharshady EK. 2020. Polynomial invariant generation for non-deterministic recursive programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation 672–687.
View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2019 | Conference Paper | IST-REx-ID: 6175 | OA
Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation 204–220.
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. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018. 4700–4707.
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.
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. CAV: Computer Aided Verification, LNCS, vol. 9779. 3–22.
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. POPL: Principles of Programming Languages, POPL, vol. 20–22. 327–342.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed

6 Publications

Mark all

[6]
2020 | Conference Paper | IST-REx-ID: 8089 | OA
Chatterjee K, Fu H, Goharshady AK, Goharshady EK. 2020. Polynomial invariant generation for non-deterministic recursive programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation 672–687.
View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2019 | Conference Paper | IST-REx-ID: 6175 | OA
Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation 204–220.
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. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018. 4700–4707.
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.
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. CAV: Computer Aided Verification, LNCS, vol. 9779. 3–22.
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. POPL: Principles of Programming Languages, POPL, vol. 20–22. 327–342.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed