Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
2019 | Conference Paper | IST-REx-ID: 6175
P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019), Phoenix, AZ, United States, 2019, pp. 204–220.View | Files available | DOI | arXiv
2019 | Conference Paper | IST-REx-ID: 6378
K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, vol. Part F147772, pp. 374–381.View | Files available | DOI
2019 | Conference Paper | IST-REx-ID: 6462
G. Avni, R. Bloem, K. Chatterjee, T. A. Henzinger, B. Konighofer, and S. Pranger, “Run-time optimization for learned controllers through quantitative games,” in 31st International Conference on Computer-Aided Verification, New York, NY, United States, 2019, vol. 11561, pp. 630–649.View | Files available | DOI
2019 | Conference Paper | IST-REx-ID: 6056
K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in IEEE International Conference on Blockchain and Cryptocurrency, Seoul, Korea, 2019, p. 8751326.View | DOI | Download (ext.) | arXiv
2019 | Conference Paper | IST-REx-ID: 6780
M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification for almost-sure termination of probabilistic programs,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Athens, Greece.View | Files available | Download (ext.) | arXiv
2018 | Conference Paper | IST-REx-ID: 143
T. Brázdil, K. Chatterjee, A. Kučera, P. Novotny, D. Velan, and F. Zuleger, “Efficient algorithms for asymptotic bounds on termination time in VASS,” presented at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033, pp. 185–194.View | DOI | Download (ext.)