Amir Goharshady

Chatterjee Group

31 Publications

Mark all

[31]
2024 | Published | Journal Article | IST-REx-ID: 17162 | OA
K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Quantitative bounds on resource usage of probabilistic programs,” Proceedings of the ACM on Programming Languages, vol. 8, no. OOPSLA1. Association for Computing Machinery, 2024.
[Published Version] View | Files available | DOI
 
[30]
2024 | Published | Conference Paper | IST-REx-ID: 18155 | OA
K. Chatterjee, A. K. Goharshady, E. Goharshady, M. Karrabi, and D. Zikelic, “Sound and complete witnesses for template-based verification of LTL properties on polynomial programs,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Milan, Italy, 2024, vol. 14933, pp. 600–619.
[Published Version] View | Files available | DOI | arXiv
 
[29]
2023 | Published | Conference Paper | IST-REx-ID: 14318 | OA
Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Automated tail bound analysis for probabilistic recurrence relations,” in Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 16–39.
[Published Version] View | Files available | DOI
 
[28]
2022 | Published | Conference Paper | IST-REx-ID: 12102 | OA
A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
[Published Version] View | Files available | DOI
 
[27]
2022 | Published | Conference Paper | IST-REx-ID: 12000 | OA
K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete certificates for auantitative termination analysis of probabilistic programs,” in Proceedings of the 34th International Conference on Computer Aided Verification, Haifa, Israel, 2022, vol. 13371, pp. 55–78.
[Published Version] View | Files available | DOI | WoS
 
[26]
2021 | Published | Conference Paper | IST-REx-ID: 9645 | OA
A. Asadi, K. Chatterjee, H. Fu, A. K. Goharshady, and M. Mahdavi, “Polynomial reachability witnesses via Stellensätze,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 772–787.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[25]
2021 | Published | Conference Paper | IST-REx-ID: 9646 | OA
J. Wang, Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Quantitative analysis of assertion violations in probabilistic programs,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1171–1186.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[24]
2021 | Published | Thesis | IST-REx-ID: 8934 | OA
A. K. Goharshady, “Parameterized and algebro-geometric advances in static program analysis,” Institute of Science and Technology Austria, 2021.
[Published Version] View | Files available | DOI
 
[23]
2020 | Published | Journal Article | IST-REx-ID: 8671 | OA
A. Shakiba, A. K. Goharshady, M. R. Hooshmandasl, and M. Alambardar Meybodi, “A note on belief structures and s-approximation spaces,” Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2. Iranian Academic Center for Education, Culture and Research, pp. 117–128, 2020.
[Submitted Version] View | Files available | DOI | arXiv
 
[22]
2020 | Published | Conference Paper | IST-REx-ID: 8089 | OA
K. Chatterjee, H. Fu, A. K. Goharshady, and E. K. Goharshady, “Polynomial invariant generation for non-deterministic recursive programs,” in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, London, United Kingdom, 2020, pp. 672–687.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[21]
2020 | Published | Journal Article | IST-REx-ID: 6918 | OA
A. K. Goharshady and F. Mohammadi, “An efficient algorithm for computing network reliability in small treewidth,” Reliability Engineering and System Safety, vol. 193. Elsevier, 2020.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[20]
2020 | Published | Conference Paper | IST-REx-ID: 7810 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal and perfectly parallel algorithms for on-demand data-flow analysis,” in European Symposium on Programming, Dublin, Ireland, 2020, vol. 12075, pp. 112–140.
[Published Version] View | Files available | DOI | WoS
 
[19]
2020 | Published | Conference Paper | IST-REx-ID: 8728 | OA
A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi, and A. Pavlogiannis, “Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth,” in Automated Technology for Verification and Analysis, Hanoi, Vietnam, 2020, vol. 12302, pp. 253–270.
[Submitted Version] View | Files available | DOI | WoS
 
[18]
2019 | Published | Conference Paper | IST-REx-ID: 6378 | OA
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, 2019, vol. Part F147772, pp. 374–381.
[Submitted Version] View | Files available | DOI | WoS
 
[17]
2019 | Published | Conference Paper | IST-REx-ID: 6175 | OA
P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Phoenix, AZ, United States, 2019, pp. 204–220.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[16]
2019 | Published | Journal Article | IST-REx-ID: 7158 | OA
K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.
[Submitted Version] View | Files available | DOI | WoS
 
[15]
2019 | Published | Conference Paper | IST-REx-ID: 6490 | OA
K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol. Part F147772, pp. 400–408.
[Submitted Version] View | Files available | DOI | WoS
 
[14]
2019 | Published | Journal Article | IST-REx-ID: 6380 | OA
K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL. ACM, 2019.
[Published Version] View | Files available | DOI
 
[13]
2019 | Published | Conference Paper | IST-REx-ID: 6056 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[12]
2019 | Published | Journal Article | IST-REx-ID: 7014 | OA
K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[11]
2019 | Published | Conference Paper | IST-REx-ID: 6780 | OA
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, 2019, vol. 3.
[Published Version] View | Files available | DOI | arXiv
 
[10]
2018 | Published | Conference Paper | IST-REx-ID: 66 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.
[Published Version] View | Files available | DOI | arXiv
 
[9]
2018 | Published | Conference Paper | IST-REx-ID: 311 | OA
K. Chatterjee, A. K. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.
[Published Version] View | Files available | DOI
 
[8]
2018 | Published | Conference Paper | IST-REx-ID: 6340 | OA
A. K. Goharshady, A. Behrouz, and K. Chatterjee, “Secure Credit Reporting on the Blockchain,” in Proceedings of the IEEE International Conference on Blockchain, Halifax, Canada, 2018, pp. 1343–1348.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[7]
2018 | Published | Conference Paper | IST-REx-ID: 5977 | OA
K. Chatterjee, H. Fu, A. K. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[6]
2018 | Published | Journal Article | IST-REx-ID: 6009 | OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[5]
2017 | Published | Conference Paper | IST-REx-ID: 639 | OA
K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst case analysis of recursive programs,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 41–63.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[4]
2017 | Published | Conference Paper | IST-REx-ID: 949 | OA
K. Chatterjee, A. K. Goharshady, and A. Pavlogiannis, “JTDec: A tool for tree decompositions in soot,” presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India, 2017, vol. 10482, pp. 59–66.
[Submitted Version] View | Files available | DOI | WoS
 
[3]
2016 | Published | Conference Paper | IST-REx-ID: 1437 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2016 | Published | Conference Paper | IST-REx-ID: 1386 | OA
K. Chatterjee, H. Fu, and A. K. Goharshady, “Termination analysis of probabilistic programs through Positivstellensatz’s,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9779, pp. 3–22.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[1]
2015 | Published | Technical Report | IST-REx-ID: 5441 | OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

1 Grants


Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies

2019-06-01 – 2021-01-31
Österreichischen Akademie der Wissenschaften

31 Publications

Mark all

[31]
2024 | Published | Journal Article | IST-REx-ID: 17162 | OA
K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Quantitative bounds on resource usage of probabilistic programs,” Proceedings of the ACM on Programming Languages, vol. 8, no. OOPSLA1. Association for Computing Machinery, 2024.
[Published Version] View | Files available | DOI
 
[30]
2024 | Published | Conference Paper | IST-REx-ID: 18155 | OA
K. Chatterjee, A. K. Goharshady, E. Goharshady, M. Karrabi, and D. Zikelic, “Sound and complete witnesses for template-based verification of LTL properties on polynomial programs,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Milan, Italy, 2024, vol. 14933, pp. 600–619.
[Published Version] View | Files available | DOI | arXiv
 
[29]
2023 | Published | Conference Paper | IST-REx-ID: 14318 | OA
Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Automated tail bound analysis for probabilistic recurrence relations,” in Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 16–39.
[Published Version] View | Files available | DOI
 
[28]
2022 | Published | Conference Paper | IST-REx-ID: 12102 | OA
A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
[Published Version] View | Files available | DOI
 
[27]
2022 | Published | Conference Paper | IST-REx-ID: 12000 | OA
K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete certificates for auantitative termination analysis of probabilistic programs,” in Proceedings of the 34th International Conference on Computer Aided Verification, Haifa, Israel, 2022, vol. 13371, pp. 55–78.
[Published Version] View | Files available | DOI | WoS
 
[26]
2021 | Published | Conference Paper | IST-REx-ID: 9645 | OA
A. Asadi, K. Chatterjee, H. Fu, A. K. Goharshady, and M. Mahdavi, “Polynomial reachability witnesses via Stellensätze,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 772–787.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[25]
2021 | Published | Conference Paper | IST-REx-ID: 9646 | OA
J. Wang, Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Quantitative analysis of assertion violations in probabilistic programs,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1171–1186.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[24]
2021 | Published | Thesis | IST-REx-ID: 8934 | OA
A. K. Goharshady, “Parameterized and algebro-geometric advances in static program analysis,” Institute of Science and Technology Austria, 2021.
[Published Version] View | Files available | DOI
 
[23]
2020 | Published | Journal Article | IST-REx-ID: 8671 | OA
A. Shakiba, A. K. Goharshady, M. R. Hooshmandasl, and M. Alambardar Meybodi, “A note on belief structures and s-approximation spaces,” Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2. Iranian Academic Center for Education, Culture and Research, pp. 117–128, 2020.
[Submitted Version] View | Files available | DOI | arXiv
 
[22]
2020 | Published | Conference Paper | IST-REx-ID: 8089 | OA
K. Chatterjee, H. Fu, A. K. Goharshady, and E. K. Goharshady, “Polynomial invariant generation for non-deterministic recursive programs,” in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, London, United Kingdom, 2020, pp. 672–687.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[21]
2020 | Published | Journal Article | IST-REx-ID: 6918 | OA
A. K. Goharshady and F. Mohammadi, “An efficient algorithm for computing network reliability in small treewidth,” Reliability Engineering and System Safety, vol. 193. Elsevier, 2020.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[20]
2020 | Published | Conference Paper | IST-REx-ID: 7810 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal and perfectly parallel algorithms for on-demand data-flow analysis,” in European Symposium on Programming, Dublin, Ireland, 2020, vol. 12075, pp. 112–140.
[Published Version] View | Files available | DOI | WoS
 
[19]
2020 | Published | Conference Paper | IST-REx-ID: 8728 | OA
A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi, and A. Pavlogiannis, “Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth,” in Automated Technology for Verification and Analysis, Hanoi, Vietnam, 2020, vol. 12302, pp. 253–270.
[Submitted Version] View | Files available | DOI | WoS
 
[18]
2019 | Published | Conference Paper | IST-REx-ID: 6378 | OA
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, 2019, vol. Part F147772, pp. 374–381.
[Submitted Version] View | Files available | DOI | WoS
 
[17]
2019 | Published | Conference Paper | IST-REx-ID: 6175 | OA
P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Phoenix, AZ, United States, 2019, pp. 204–220.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[16]
2019 | Published | Journal Article | IST-REx-ID: 7158 | OA
K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.
[Submitted Version] View | Files available | DOI | WoS
 
[15]
2019 | Published | Conference Paper | IST-REx-ID: 6490 | OA
K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol. Part F147772, pp. 400–408.
[Submitted Version] View | Files available | DOI | WoS
 
[14]
2019 | Published | Journal Article | IST-REx-ID: 6380 | OA
K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL. ACM, 2019.
[Published Version] View | Files available | DOI
 
[13]
2019 | Published | Conference Paper | IST-REx-ID: 6056 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[12]
2019 | Published | Journal Article | IST-REx-ID: 7014 | OA
K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[11]
2019 | Published | Conference Paper | IST-REx-ID: 6780 | OA
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, 2019, vol. 3.
[Published Version] View | Files available | DOI | arXiv
 
[10]
2018 | Published | Conference Paper | IST-REx-ID: 66 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.
[Published Version] View | Files available | DOI | arXiv
 
[9]
2018 | Published | Conference Paper | IST-REx-ID: 311 | OA
K. Chatterjee, A. K. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.
[Published Version] View | Files available | DOI
 
[8]
2018 | Published | Conference Paper | IST-REx-ID: 6340 | OA
A. K. Goharshady, A. Behrouz, and K. Chatterjee, “Secure Credit Reporting on the Blockchain,” in Proceedings of the IEEE International Conference on Blockchain, Halifax, Canada, 2018, pp. 1343–1348.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[7]
2018 | Published | Conference Paper | IST-REx-ID: 5977 | OA
K. Chatterjee, H. Fu, A. K. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[6]
2018 | Published | Journal Article | IST-REx-ID: 6009 | OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[5]
2017 | Published | Conference Paper | IST-REx-ID: 639 | OA
K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst case analysis of recursive programs,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 41–63.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[4]
2017 | Published | Conference Paper | IST-REx-ID: 949 | OA
K. Chatterjee, A. K. Goharshady, and A. Pavlogiannis, “JTDec: A tool for tree decompositions in soot,” presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India, 2017, vol. 10482, pp. 59–66.
[Submitted Version] View | Files available | DOI | WoS
 
[3]
2016 | Published | Conference Paper | IST-REx-ID: 1437 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2016 | Published | Conference Paper | IST-REx-ID: 1386 | OA
K. Chatterjee, H. Fu, and A. K. Goharshady, “Termination analysis of probabilistic programs through Positivstellensatz’s,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9779, pp. 3–22.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[1]
2015 | Published | Technical Report | IST-REx-ID: 5441 | OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed