Amir Goharshady

Chatterjee Group

30 Publications

Mark all

[30]
2023 | Conference Paper | IST-REx-ID: 14318 | OA
Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2023). Automated tail bound analysis for probabilistic recurrence relations. In Computer Aided Verification (Vol. 13966, pp. 16–39). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37709-9_2
[Published Version] View | Files available | DOI
 
[29]
2022 | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., & Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29
[Published Version] View | Files available | DOI
 
[28]
2022 | Conference Paper | IST-REx-ID: 12000 | OA
Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer. https://doi.org/10.1007/978-3-031-13185-1_4
[Published Version] View | Files available | DOI | WoS
 
[27]
2021 | Conference Paper | IST-REx-ID: 9646 | OA
Wang, J., Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2021). Quantitative analysis of assertion violations in probabilistic programs. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1171–1186). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454102
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[26]
2021 | Conference Paper | IST-REx-ID: 9645 | OA
Asadi, A., Chatterjee, K., Fu, H., Goharshady, A. K., & Mahdavi, M. (2021). Polynomial reachability witnesses via Stellensätze. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 772–787). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454076
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[25]
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
Chatterjee, K., Goharshady, A. K., Novotný, P., & Zikelic, D. (2021). RevTerm. Association for Computing Machinery. https://doi.org/10.1145/3410304
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[24]
2021 | Thesis | IST-REx-ID: 8934 | OA
Goharshady, A. K. (2021). Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8934
[Published Version] View | Files available | DOI
 
[23]
2020 | Journal Article | IST-REx-ID: 8671 | OA
Shakiba, A., Goharshady, A. K., Hooshmandasl, M. R., & Alambardar Meybodi, M. (2020). A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. Iranian Academic Center for Education, Culture and Research. https://doi.org/10.29252/ijmsi.15.2.117
[Submitted Version] View | Files available | DOI | arXiv
 
[22]
2020 | Conference Paper | IST-REx-ID: 7810 | OA
Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2020). Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In European Symposium on Programming (Vol. 12075, pp. 112–140). Dublin, Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-44914-8_5
[Published Version] View | Files available | DOI | WoS
 
[21]
2020 | Conference Paper | IST-REx-ID: 8728 | OA
Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., & Pavlogiannis, A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In Automated Technology for Verification and Analysis (Vol. 12302, pp. 253–270). Hanoi, Vietnam: Springer Nature. https://doi.org/10.1007/978-3-030-59152-6_14
[Submitted Version] View | Files available | DOI | WoS
 
[20]
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[19]
2020 | Journal Article | IST-REx-ID: 6918 | OA
Goharshady, A. K., & Mohammadi, F. (2020). An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. Elsevier. https://doi.org/10.1016/j.ress.2019.106665
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[18]
2019 | Conference Paper | IST-REx-ID: 6780 | OA
Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (2019). 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 (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360555
[Published Version] View | Files available | DOI | arXiv
 
[17]
2019 | Journal Article | IST-REx-ID: 6380 | OA
Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3290366
[Published Version] View | Files available | DOI
 
[16]
2019 | Conference Paper | IST-REx-ID: 6056 | OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[15]
2019 | Conference Paper | IST-REx-ID: 6378 | OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319
[Submitted Version] View | Files available | DOI | WoS
 
[14]
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
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[13]
2019 | Conference Paper | IST-REx-ID: 6490 | OA
Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322
[Submitted Version] View | Files available | DOI | WoS
 
[12]
2019 | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3363525
[Submitted Version] View | Files available | DOI | WoS
 
[11]
2019 | Journal Article | IST-REx-ID: 7014 | OA
Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3339984
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11
[Published Version] View | Files available | DOI | arXiv
 
[9]
2018 | Conference Paper | IST-REx-ID: 311 | OA
Chatterjee, K., Goharshady, A. K., & Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89884-1_26
[Published Version] View | Files available | DOI
 
[8]
2018 | Conference Paper | IST-REx-ID: 6340 | OA
Goharshady, A. K., Behrouz, A., & Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE. https://doi.org/10.1109/Cybermatics_2018.2018.00231
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[7]
2018 | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). https://doi.org/10.1145/3210257
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[6]
2018 | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee, K., Fu, H., Goharshady, A. K., & 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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[5]
2017 | Conference Paper | IST-REx-ID: 639 | OA
Chatterjee, K., Fu, H., & Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63390-9_3
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[4]
2017 | Conference Paper | IST-REx-ID: 949 | OA
Chatterjee, K., Goharshady, A. K., & Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer. https://doi.org/10.1007/978-3-319-68167-2_4
[Submitted Version] View | Files available | DOI | WoS
 
[3]
2016 | Conference Paper | IST-REx-ID: 1437 | OA
Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837624
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2016 | Conference Paper | IST-REx-ID: 1386 | OA
Chatterjee, K., Fu, H., & Goharshady, A. K. (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
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[1]
2015 | Technical Report | IST-REx-ID: 5441 | OA
Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria. https://doi.org/10.15479/AT:IST-2015-340-v1-1
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: APA

    Export / Embed

30 Publications

Mark all

[30]
2023 | Conference Paper | IST-REx-ID: 14318 | OA
Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2023). Automated tail bound analysis for probabilistic recurrence relations. In Computer Aided Verification (Vol. 13966, pp. 16–39). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37709-9_2
[Published Version] View | Files available | DOI
 
[29]
2022 | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., & Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29
[Published Version] View | Files available | DOI
 
[28]
2022 | Conference Paper | IST-REx-ID: 12000 | OA
Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer. https://doi.org/10.1007/978-3-031-13185-1_4
[Published Version] View | Files available | DOI | WoS
 
[27]
2021 | Conference Paper | IST-REx-ID: 9646 | OA
Wang, J., Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2021). Quantitative analysis of assertion violations in probabilistic programs. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1171–1186). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454102
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[26]
2021 | Conference Paper | IST-REx-ID: 9645 | OA
Asadi, A., Chatterjee, K., Fu, H., Goharshady, A. K., & Mahdavi, M. (2021). Polynomial reachability witnesses via Stellensätze. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 772–787). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454076
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[25]
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
Chatterjee, K., Goharshady, A. K., Novotný, P., & Zikelic, D. (2021). RevTerm. Association for Computing Machinery. https://doi.org/10.1145/3410304
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[24]
2021 | Thesis | IST-REx-ID: 8934 | OA
Goharshady, A. K. (2021). Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8934
[Published Version] View | Files available | DOI
 
[23]
2020 | Journal Article | IST-REx-ID: 8671 | OA
Shakiba, A., Goharshady, A. K., Hooshmandasl, M. R., & Alambardar Meybodi, M. (2020). A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. Iranian Academic Center for Education, Culture and Research. https://doi.org/10.29252/ijmsi.15.2.117
[Submitted Version] View | Files available | DOI | arXiv
 
[22]
2020 | Conference Paper | IST-REx-ID: 7810 | OA
Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2020). Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In European Symposium on Programming (Vol. 12075, pp. 112–140). Dublin, Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-44914-8_5
[Published Version] View | Files available | DOI | WoS
 
[21]
2020 | Conference Paper | IST-REx-ID: 8728 | OA
Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., & Pavlogiannis, A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In Automated Technology for Verification and Analysis (Vol. 12302, pp. 253–270). Hanoi, Vietnam: Springer Nature. https://doi.org/10.1007/978-3-030-59152-6_14
[Submitted Version] View | Files available | DOI | WoS
 
[20]
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[19]
2020 | Journal Article | IST-REx-ID: 6918 | OA
Goharshady, A. K., & Mohammadi, F. (2020). An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. Elsevier. https://doi.org/10.1016/j.ress.2019.106665
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[18]
2019 | Conference Paper | IST-REx-ID: 6780 | OA
Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (2019). 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 (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360555
[Published Version] View | Files available | DOI | arXiv
 
[17]
2019 | Journal Article | IST-REx-ID: 6380 | OA
Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3290366
[Published Version] View | Files available | DOI
 
[16]
2019 | Conference Paper | IST-REx-ID: 6056 | OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[15]
2019 | Conference Paper | IST-REx-ID: 6378 | OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319
[Submitted Version] View | Files available | DOI | WoS
 
[14]
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
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[13]
2019 | Conference Paper | IST-REx-ID: 6490 | OA
Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322
[Submitted Version] View | Files available | DOI | WoS
 
[12]
2019 | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3363525
[Submitted Version] View | Files available | DOI | WoS
 
[11]
2019 | Journal Article | IST-REx-ID: 7014 | OA
Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3339984
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11
[Published Version] View | Files available | DOI | arXiv
 
[9]
2018 | Conference Paper | IST-REx-ID: 311 | OA
Chatterjee, K., Goharshady, A. K., & Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89884-1_26
[Published Version] View | Files available | DOI
 
[8]
2018 | Conference Paper | IST-REx-ID: 6340 | OA
Goharshady, A. K., Behrouz, A., & Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE. https://doi.org/10.1109/Cybermatics_2018.2018.00231
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[7]
2018 | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). https://doi.org/10.1145/3210257
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[6]
2018 | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee, K., Fu, H., Goharshady, A. K., & 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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[5]
2017 | Conference Paper | IST-REx-ID: 639 | OA
Chatterjee, K., Fu, H., & Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63390-9_3
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[4]
2017 | Conference Paper | IST-REx-ID: 949 | OA
Chatterjee, K., Goharshady, A. K., & Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer. https://doi.org/10.1007/978-3-319-68167-2_4
[Submitted Version] View | Files available | DOI | WoS
 
[3]
2016 | Conference Paper | IST-REx-ID: 1437 | OA
Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837624
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2016 | Conference Paper | IST-REx-ID: 1386 | OA
Chatterjee, K., Fu, H., & Goharshady, A. K. (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
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[1]
2015 | Technical Report | IST-REx-ID: 5441 | OA
Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria. https://doi.org/10.15479/AT:IST-2015-340-v1-1
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: APA

    Export / Embed