![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Umang Mathur 0001
Person information
- affiliation: National University of Singapore
- affiliation (former): University of Illinois at Urbana Champaign, IL, USA
- affiliation (former): Facebook, Inc., USA
Other persons with the same name
- Umang Mathur 0002 — San Francisco State University, San Francisco, CA, USA
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j13]Kuldeep S. Meel
, Sourav Chakraborty
, Umang Mathur
:
A faster FPRAS for #NFA. Proc. ACM Manag. Data 2(2): 112 (2024) - [j12]Azadeh Farzan
, Umang Mathur
:
Coarser Equivalences for Causal Concurrency. Proc. ACM Program. Lang. 8(POPL): 911-941 (2024) - [j11]Soham Chakraborty
, Shankara Narayanan Krishna
, Umang Mathur
, Andreas Pavlogiannis
:
How Hard Is Weak-Memory Testing? Proc. ACM Program. Lang. 8(POPL): 1978-2009 (2024) - [j10]Zhendong Ang
, Umang Mathur
:
Predictive Monitoring against Pattern Regular Languages. Proc. ACM Program. Lang. 8(POPL): 2191-2225 (2024) - 2023
- [j9]Hünkar Can Tunç
, Parosh Aziz Abdulla
, Soham Chakraborty
, Shankaranarayanan Krishna
, Umang Mathur
, Andreas Pavlogiannis
:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Proc. ACM Program. Lang. 7(PLDI): 761-785 (2023) - [j8]Hünkar Can Tunç
, Umang Mathur
, Andreas Pavlogiannis
, Mahesh Viswanathan
:
Sound Dynamic Deadlock Prediction in Linear Time. Proc. ACM Program. Lang. 7(PLDI): 1733-1758 (2023) - [j7]Mosaad Al Thokair
, Minjian Zhang
, Umang Mathur
, Mahesh Viswanathan
:
Dynamic Race Detection with O(1) Samples. Proc. ACM Program. Lang. 7(POPL): 1308-1337 (2023) - 2022
- [j6]Chuchu Fan
, Zengyi Qin
, Umang Mathur
, Qiang Ning
, Sayan Mitra
, Mahesh Viswanathan
:
Controller Synthesis for Linear System With Reach-Avoid Specifications. IEEE Trans. Autom. Control. 67(4): 1713-1727 (2022) - 2021
- [j5]Umang Mathur
, Andreas Pavlogiannis
, Mahesh Viswanathan:
Optimal prediction of synchronization-preserving races. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - 2020
- [j4]Umang Mathur
, Matthew S. Bauer, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Exact quantitative probabilistic model checking through rational search. Formal Methods Syst. Des. 56(1): 90-126 (2020) - [j3]Umang Mathur
, Adithya Murali
, Paul Krogmeier, P. Madhusudan, Mahesh Viswanathan:
Deciding memory safety for single-pass heap-manipulating programs. Proc. ACM Program. Lang. 4(POPL): 35:1-35:29 (2020) - 2019
- [j2]Umang Mathur
, P. Madhusudan, Mahesh Viswanathan:
Decidable verification of uninterpreted programs. Proc. ACM Program. Lang. 3(POPL): 46:1-46:29 (2019) - 2018
- [j1]Umang Mathur
, Dileep Kini, Mahesh Viswanathan:
What happens-after the first race? enhancing the predictive power of happens-before based dynamic race detection. Proc. ACM Program. Lang. 2(OOPSLA): 145:1-145:29 (2018)
Conference and Workshop Papers
- 2024
- [c21]Dylan Wolff
, Zheng Shi
, Gregory J. Duck
, Umang Mathur
, Abhik Roychoudhury
:
Greybox Fuzzing for Concurrency Testing. ASPLOS (2) 2024: 482-498 - [c20]Zhendong Ang
, Umang Mathur
:
Predictive Monitoring with Strong Trace Prefixes. CAV (2) 2024: 182-204 - [c19]Qiyuan Zhao, George Pîrlea, Zhendong Ang, Umang Mathur
, Ilya Sergey:
Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic. CPP 2024: 45-59 - [c18]Zheng Shi
, Umang Mathur
, Andreas Pavlogiannis
:
Optimistic Prediction of Synchronization-Reversal Data Races. ICSE 2024: 134:1-134:13 - 2022
- [c17]Umang Mathur, Andreas Pavlogiannis
, Hünkar Can Tunç
, Mahesh Viswanathan:
A tree clock data structure for causal orderings in concurrent executions. ASPLOS 2022: 710-725 - [c16]Umang Mathur, Andreas Pavlogiannis:
Dynamic data race prediction: fundamentals, theory, and practice (tutorial). ESEC/SIGSOFT FSE 2022: 1820 - 2021
- [c15]Rucha Kulkarni, Umang Mathur, Andreas Pavlogiannis
:
Dynamic Data-Race Detection Through the Fine-Grained Lens. CONCUR 2021: 16:1-16:23 - [c14]Vijayaraghavan Murali, Edward Yao, Umang Mathur
, Satish Chandra:
Scalable Statistical Root Cause Analysis on App Telemetry. ICSE (SEIP) 2021: 288-297 - [c13]Minjian Zhang
, Umang Mathur
, Mahesh Viswanathan:
Checking LTL[F, G, X] on compressed traces in polynomial time. ESEC/SIGSOFT FSE 2021: 131-143 - 2020
- [c12]Umang Mathur
, Mahesh Viswanathan:
Atomicity Checking in Linear Time using Vector Clocks. ASPLOS 2020: 183-199 - [c11]Paul Krogmeier
, Umang Mathur
, Adithya Murali
, P. Madhusudan, Mahesh Viswanathan:
Decidable Synthesis of Programs with Uninterpreted Functions. CAV (2) 2020: 634-657 - [c10]Umang Mathur
, Andreas Pavlogiannis
, Mahesh Viswanathan:
The Complexity of Dynamic Data Race Prediction. LICS 2020: 713-727 - [c9]Umang Mathur
, P. Madhusudan, Mahesh Viswanathan:
What's Decidable About Program Verification Modulo Axioms? TACAS (2) 2020: 158-177 - 2018
- [c8]Chuchu Fan
, Umang Mathur
, Sayan Mitra
, Mahesh Viswanathan:
Controller Synthesis Made Real: Reach-Avoid Specifications and Linear Dynamics. CAV (1) 2018: 347-366 - [c7]P. Madhusudan, Umang Mathur
, Shambwaditya Saha, Mahesh Viswanathan:
A Decidable Fragment of Second Order Logic With Applications to Synthesis. CSL 2018: 31:1-31:19 - [c6]Dileep Kini, Umang Mathur
, Mahesh Viswanathan:
Data race detection on compressed traces. ESEC/SIGSOFT FSE 2018: 26-37 - 2017
- [c5]Adrià Gascón, Ashish Tiwari, Brent Carmer, Umang Mathur
:
Look for the Proof to Find the Program: Decorated-Component-Based Program Synthesis. CAV (2) 2017: 86-103 - [c4]Matthew S. Bauer, Umang Mathur
, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Exact quantitative probabilistic model checking through rational search. FMCAD 2017: 92-99 - [c3]Dileep Kini, Umang Mathur
, Mahesh Viswanathan:
Dynamic race prediction in linear time. PLDI 2017: 157-170 - 2014
- [c2]Shankara Narayanan Krishna, Umang Mathur
, Ashutosh Trivedi:
Weak Singular Hybrid Automata. FORMATS 2014: 161-175 - [c1]Rohit Chadha, Umang Mathur
, Stefan Schwoon:
Computing Information Flow Using Symbolic Model-Checking. FSTTCS 2014: 505-516
Informal and Other Publications
- 2024
- [i23]Zheng Shi, Umang Mathur, Andreas Pavlogiannis:
Optimistic Prediction of Synchronization-Reversal Data Races. CoRR abs/2401.05642 (2024) - [i22]Zhendong Ang, Umang Mathur:
Predictive Monitoring with Strong Trace Prefixes. CoRR abs/2405.10499 (2024) - 2023
- [i21]Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç, Mahesh Viswanathan:
Sound Dynamic Deadlock Prediction in Linear Time. CoRR abs/2304.03692 (2023) - [i20]Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. CoRR abs/2304.03714 (2023) - [i19]Zhendong Ang, Umang Mathur:
Predictive Monitoring against Pattern Regular Languages. CoRR abs/2310.14611 (2023) - [i18]Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
How Hard is Weak-Memory Testing? CoRR abs/2311.04302 (2023) - [i17]Kuldeep S. Meel, Sourav Chakraborty, Umang Mathur:
A faster FPRAS for #NFA. CoRR abs/2312.13320 (2023) - 2022
- [i16]Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç, Mahesh Viswanathan:
A Tree Clock Data Structure for Causal Orderings in Concurrent Executions. CoRR abs/2201.06325 (2022) - [i15]Azadeh Farzan, Umang Mathur:
Coarser Equivalences for Concurrent Program Runs. CoRR abs/2208.12117 (2022) - 2021
- [i14]Rucha Kulkarni, Umang Mathur, Andreas Pavlogiannis:
Dynamic Data-Race Detection through the Fine-Grained Lens. CoRR abs/2107.03569 (2021) - 2020
- [i13]Umang Mathur, Mahesh Viswanathan:
Atomicity Checking in Linear Time using Vector Clocks. CoRR abs/2001.04961 (2020) - [i12]Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
The Complexity of Dynamic Data Race Prediction. CoRR abs/2004.14931 (2020) - [i11]Vijayaraghavan Murali, Edward Yao, Umang Mathur, Satish Chandra:
Scalable Statistical Root Cause Analysis on App Telemetry. CoRR abs/2010.09974 (2020) - [i10]Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
Optimal Prediction of Synchronization-Preserving Races. CoRR abs/2010.16385 (2020) - 2019
- [i9]Umang Mathur, Adithya Murali, Paul Krogmeier, P. Madhusudan, Mahesh Viswanathan:
Deciding Memory Safety for Forest Datastructures. CoRR abs/1907.00298 (2019) - [i8]Paul Krogmeier, Umang Mathur, Adithya Murali, P. Madhusudan, Mahesh Viswanathan:
Decidable Synthesis of Programs with Uninterpreted Functions. CoRR abs/1910.09744 (2019) - [i7]Umang Mathur, P. Madhusudan, Mahesh Viswanathan:
What's Decidable About Program Verification Modulo Axioms? CoRR abs/1910.10889 (2019) - 2018
- [i6]Dileep Kini, Umang Mathur, Mahesh Viswanathan:
Data Race Detection on Compressed Traces. CoRR abs/1807.08427 (2018) - [i5]Umang Mathur, Dileep Kini, Mahesh Viswanathan:
What Happens - After the First Race? Enhancing the Predictive Power of Happens - Before Based Dynamic Race Detection. CoRR abs/1808.00185 (2018) - [i4]Umang Mathur, P. Madhusudan, Mahesh Viswanathan:
Decidable Verification of Uninterpreted Programs. CoRR abs/1811.00192 (2018) - 2017
- [i3]Dileep Kini, Umang Mathur, Mahesh Viswanathan:
Dynamic Race Prediction in Linear Time. CoRR abs/1704.02432 (2017) - [i2]P. Madhusudan, Umang Mathur, Shambwaditya Saha, Mahesh Viswanathan:
A Decidable Fragment of Second Order Logic With Applications to Synthesis. CoRR abs/1712.05513 (2017) - 2013
- [i1]Shankara Narayanan Krishna, Umang Mathur, Ashutosh Trivedi:
Weak Singular Hybrid Automata. CoRR abs/1311.3826 (2013)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint