| 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 | 27 | 2012 |
| Regular separability of well structured transition systems W Czerwiński, S Lasota, R Meyer, S Muskalla, KN Kumar, P Saivasan arXiv preprint arXiv:1702.05334, 2017 | 23 | 2017 |
| 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 |
| 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 | 15 | 2021 |
| Fine-grained complexity of safety verification P Chini, R Meyer, P Saivasan Journal of Automated Reasoning 64 (7), 1419-1444, 2020 | 15 | 2020 |
| 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 | 15 | 2014 |
| 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 | 14 | 2016 |
| Liveness in broadcast networks P Chini, R Meyer, P Saivasan International Conference on Networked Systems, 52-66, 2019 | 13 | 2019 |
| Parity games on bounded phase multi-pushdown systems MF Atig, A Bouajjani, K Narayan Kumar, P Saivasan Networked Systems: 5th International Conference, NETYS 2017, Marrakech …, 2017 | 9 | 2017 |
| Complexity of liveness in parameterized systems P Chini, R Meyer, P Saivasan arXiv preprint arXiv:1909.12004, 2019 | 8 | 2019 |
| 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 |
| A framework for consistency algorithms P Chini, P Saivasan arXiv preprint arXiv:2007.11398, 2020 | 7 | 2020 |
| On the upward/downward closures of Petri nets MF Atig, R Meyer, S Muskalla, P Saivasan arXiv preprint arXiv:1701.02927, 2017 | 4 | 2017 |
| 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 |
| 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 | 3 | 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 | 2 | 2022 |
| Temporal tracing of on-chip signals using timeprints R Massoud, HM Le, P Chini, P Saivasan, R Meyer, R Drechsler Proceedings of the 56th Annual Design Automation Conference 2019, 1-6, 2019 | 2 | 2019 |
| Fast witness counting P Chini, R Massoud, R Meyer, P Saivasan arXiv preprint arXiv:1807.05777, 2018 | 2 | 2018 |
| Verification of asynchronous programs with nested locks MF Atig, A Bouajjani, K Narayan Kumar, P Saivasan 37th IARCS Annual Conference on Foundations of Software Technology and …, 2018 | 2 | 2018 |
Narayan KumarProfessor, Chennai Mathematical InstituteDirección de correo verificada de cmi.ac.in
