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 
LibreCat: https://research-explorer.ista.ac.at/record/7158
DOI: 10.1145/3363525
WoS: 000564108400004

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. Association for Computing Machinery (ACM).https://doi.org/10.1145/3174800 
LibreCat: https://research-explorer.ista.ac.at/record/5993
DOI: 10.1145/3174800
WoS: 000434634500003
arXiv: 1510.08517

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 
LibreCat: https://research-explorer.ista.ac.at/record/6009
DOI: 10.1145/3210257
WoS: 000444694800001
arXiv: 1510.07565

Henzinger, T. A., Qadeer, S., Rajamani, S., &; Tasiran, S. (2002). An assume-guarantee rule for checking simulation. ACM Transactions on Programming Languages and Systems (TOPLAS). ACM.https://doi.org/10.1145/509705.509707 
LibreCat: https://research-explorer.ista.ac.at/record/4473
DOI: 10.1145/509705.509707