| Linear-time model-checking for multithreaded programs under scope-bounding MF Atig, A Bouajjani, K Narayan Kumar, P Saivasan International Symposium on Automated Technology for Verification and …, 2012 | 30 | 2012 |
| Regular separability of well structured transition systems SĹ Lasota, R Meyer, S Muskalla, KN Kumar, P Saivasan arXiv preprint arXiv:1702.05334, 2017 | 27 | 2017 |
| Deciding reachability under persistent x86-TSO PA Abdulla, MF Atig, A Bouajjani, KN Kumar, P Saivasan Proceedings of the ACM on Programming Languages 5 (POPL), 1-32, 2021 | 23 | 2021 |
| Adjacent Ordered Multi-Pushdown Systems PS M F Atig, K. N Kumar 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21 …, 2013 | 19* | 2013 |
| On the complexity of bounded context switching P Chini, J Kolberg, A Krebs, R Meyer, P Saivasan arXiv preprint arXiv:1609.09728, 2016 | 18 | 2016 |
| On bounded reachability analysis of shared memory systems MF Atig, A Bouajjani, K Narayan Kumar, P Saivasan 34th International Conference on Foundation of Software Technology and …, 2014 | 18 | 2014 |
| Fine-grained complexity of safety verification P Chini, R Meyer, P Saivasan Journal of Automated Reasoning 64 (7), 1419-1444, 2020 | 15 | 2020 |
| Liveness in broadcast networks P Chini, R Meyer, P Saivasan International Conference on Networked Systems, 52-66, 2019 | 15 | 2019 |
| The complexity of regular abstractions of one-counter languages MF Atig, D Chistikov, P Hofman, KN Kumar, P Saivasan, G Zetzsche Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 15 | 2016 |
| A framework for consistency algorithms P Chini, P Saivasan arXiv preprint arXiv:2007.11398, 2020 | 11 | 2020 |
| Complexity of liveness in parameterized systems P Chini, R Meyer, P Saivasan arXiv preprint arXiv:1909.12004, 2019 | 9 | 2019 |
| Parity games on bounded phase multi-pushdown systems MF Atig, A Bouajjani, K Narayan Kumar, P Saivasan International Conference on Networked Systems, 272-287, 2017 | 9 | 2017 |
| Model checking branching-time properties of multi-pushdown systems is hard MF Atig, A Bouajjani, KN Kumar, P Saivasan arXiv preprint arXiv:1205.6928, 2012 | 8 | 2012 |
| Separability and non-determinizability of WSTS E Keskin, R Meyer 34th International Conference on Concurrency Theory (CONCUR 2023), 8: 1-8: 17, 2023 | 7 | 2023 |
| On the upward/downward closures of Petri nets MF Atig, R Meyer, S Muskalla, P Saivasan arXiv preprint arXiv:1701.02927, 2017 | 5 | 2017 |
| Verification under Intel-x86 with Persistency P Abdulla, MF Atig, A Bouajjani, KN Kumar, P Saivasan Proceedings of the ACM on Programming Languages 8 (PLDI), 1189-1212, 2024 | 4 | 2024 |
| Weighted one-deterministic-counter automata P Mathew, V Penelle, P Saivasan, AV Sreejith arXiv preprint arXiv:2301.13456, 2023 | 4 | 2023 |
| On the satisfiability of context-free string constraints with subword-ordering C Aiswarya, S Mal, P Saivasan Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 4 | 2022 |
| Verifying reachability for TSO programs with dynamic thread creation PA Abdulla, MF Atig, A Bouajjani, K Narayan Kumar, P Saivasan International Conference on Networked Systems, 283-300, 2022 | 4 | 2022 |
| Acceleration in multi-pushdown systems MF Atig, K Narayan Kumar, P Saivasan International Conference on Tools and Algorithms for the Construction and …, 2016 | 4 | 2016 |
Narayan KumarProfessor, Chennai Mathematical InstituteVerified email at cmi.ac.in
