Dynamic race prediction in linear time D Kini, U Mathur, M Viswanathan ACM SIGPLAN Notices 52 (6), 157-170, 2017 | 83 | 2017 |
What Happens-After the First Race? Enhancing the Predictive Power of Happens-Before Based Dynamic Race Detection U Mathur, D Kini, M Viswanathan Proceedings of the ACM on Programming Languages 2 (OOPSLA), 145, 2018 | 39 | 2018 |
Controller synthesis made real: Reach-avoid specifications and linear dynamics C Fan, U Mathur, S Mitra, M Viswanathan International Conference on Computer Aided Verification, 347-366, 2018 | 39 | 2018 |
Optimal prediction of synchronization-preserving races U Mathur, A Pavlogiannis, M Viswanathan Proceedings of the ACM on Programming Languages 5 (POPL), 1-29, 2021 | 31 | 2021 |
Atomicity checking in linear time using vector clocks U Mathur, M Viswanathan Proceedings of the Twenty-Fifth International Conference on Architectural …, 2020 | 25 | 2020 |
The complexity of dynamic data race prediction U Mathur, A Pavlogiannis, M Viswanathan Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 24 | 2020 |
Controller synthesis for linear system with reach-avoid specifications C Fan, Z Qin, U Mathur, Q Ning, S Mitra, M Viswanathan IEEE Transactions on Automatic Control 67 (4), 1713-1727, 2021 | 22 | 2021 |
Look for the proof to find the program: Decorated-component-based program synthesis A Gascón, A Tiwari, B Carmer, U Mathur International Conference on Computer Aided Verification, 86-103, 2017 | 19 | 2017 |
Decidable synthesis of programs with uninterpreted functions P Krogmeier, U Mathur, A Murali, P Madhusudan, M Viswanathan International Conference on Computer Aided Verification, 634-657, 2020 | 18 | 2020 |
Decidable verification of uninterpreted programs U Mathur, P Madhusudan, M Viswanathan Proceedings of the ACM on Programming Languages 3 (POPL), 1-29, 2019 | 16 | 2019 |
Data race detection on compressed traces D Kini, U Mathur, M Viswanathan Proceedings of the 2018 26th ACM Joint Meeting on European Software …, 2018 | 16 | 2018 |
Computing Information Flow Using Symbolic Model-Checking R Chadha, U Mathur, S Schwoon 34th International Conference on Foundation of Software Technology and …, 2014 | 16 | 2014 |
Scalable statistical root cause analysis on app telemetry V Murali, E Yao, U Mathur, S Chandra 2021 IEEE/ACM 43rd International Conference on Software Engineering …, 2021 | 14 | 2021 |
What’s decidable about program verification modulo axioms? U Mathur, P Madhusudan, M Viswanathan International Conference on Tools and Algorithms for the Construction and …, 2020 | 11 | 2020 |
Deciding memory safety for single-pass heap-manipulating programs U Mathur, A Murali, P Krogmeier, P Madhusudan, M Viswanathan Proceedings of the ACM on Programming Languages 4 (POPL), 1-29, 2019 | 11 | 2019 |
Exact quantitative probabilistic model checking through rational search MS Bauer, U Mathur, R Chadha, AP Sistla, M Viswanathan 2017 Formal Methods in Computer Aided Design (FMCAD), 92-99, 2017 | 11 | 2017 |
A tree clock data structure for causal orderings in concurrent executions U Mathur, A Pavlogiannis, HC Tunç, M Viswanathan Proceedings of the 27th ACM International Conference on Architectural …, 2022 | 10 | 2022 |
Dynamic data-race detection through the fine-grained lens R Kulkarni, U Mathur, A Pavlogiannis arXiv preprint arXiv:2107.03569, 2021 | 9 | 2021 |
Sound dynamic deadlock prediction in linear time HC Tunç, U Mathur, A Pavlogiannis, M Viswanathan Proceedings of the ACM on Programming Languages 7 (PLDI), 1733-1758, 2023 | 8 | 2023 |
Dynamic race detection with O (1) samples MA Thokair, M Zhang, U Mathur, M Viswanathan Proceedings of the ACM on Programming Languages 7 (POPL), 1308-1337, 2023 | 7 | 2023 |