Umang Mathur

Orcid: 0000-0002-7610-0660

Affiliations:
  • National University of Singapore
  • University of Illinois at Urbana Champaign, IL, USA (former)
  • Facebook, Inc., USA (former)


According to our database1, Umang Mathur authored at least 40 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Coarser Equivalences for Causal Concurrency.
Proc. ACM Program. Lang., January, 2024

How Hard Is Weak-Memory Testing?
Proc. ACM Program. Lang., January, 2024

Predictive Monitoring against Pattern Regular Languages.
Proc. ACM Program. Lang., January, 2024

A faster FPRAS for #NFA.
Proc. ACM Manag. Data, 2024

The Decision Problem for Regular First-Order Theories.
CoRR, 2024

Efficient Linearizability Monitoring for Sets, Stacks, Queues and Priority Queues.
CoRR, 2024

Optimistic Prediction of Synchronization-Reversal Data Races.
Proceedings of the 46th IEEE/ACM International Conference on Software Engineering, 2024

Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic.
Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2024

Predictive Monitoring with Strong Trace Prefixes.
Proceedings of the Computer Aided Verification - 36th International Conference, 2024

Greybox Fuzzing for Concurrency Testing.
Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2024

2023
Sound Dynamic Deadlock Prediction in Linear Time.
Dataset, March, 2023

Optimal Reads-From Consistency Checking for C11-Style Memory Models.
Dataset, March, 2023

Optimal Reads-From Consistency Checking for C11-Style Memory Models.
Dataset, March, 2023

Dynamic Race Detection with O(1) Samples.
Proc. ACM Program. Lang., January, 2023

Optimal Reads-From Consistency Checking for C11-Style Memory Models.
Proc. ACM Program. Lang., 2023

Sound Dynamic Deadlock Prediction in Linear Time.
Proc. ACM Program. Lang., 2023

2022
Controller Synthesis for Linear System With Reach-Avoid Specifications.
IEEE Trans. Autom. Control., 2022

Coarser Equivalences for Concurrent Program Runs.
CoRR, 2022

Dynamic data race prediction: fundamentals, theory, and practice (tutorial).
Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2022

A tree clock data structure for causal orderings in concurrent executions.
Proceedings of the ASPLOS '22: 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Lausanne, Switzerland, 28 February 2022, 2022

2021
Optimal prediction of synchronization-preserving races.
Proc. ACM Program. Lang., 2021

Checking LTL[F, G, X] on compressed traces in polynomial time.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

Scalable Statistical Root Cause Analysis on App Telemetry.
Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering: Software Engineering in Practice, 2021

Dynamic Data-Race Detection Through the Fine-Grained Lens.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Deciding memory safety for single-pass heap-manipulating programs.
Proc. ACM Program. Lang., 2020

Exact quantitative probabilistic model checking through rational search.
Formal Methods Syst. Des., 2020

What's Decidable About Program Verification Modulo Axioms?
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

The Complexity of Dynamic Data Race Prediction.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Decidable Synthesis of Programs with Uninterpreted Functions.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

Atomicity Checking in Linear Time using Vector Clocks.
Proceedings of the ASPLOS '20: Architectural Support for Programming Languages and Operating Systems, 2020

2019
Decidable verification of uninterpreted programs.
Proc. ACM Program. Lang., 2019

Deciding Memory Safety for Forest Datastructures.
CoRR, 2019

2018
What happens-after the first race? enhancing the predictive power of happens-before based dynamic race detection.
Proc. ACM Program. Lang., 2018

Data race detection on compressed traces.
Proceedings of the 2018 ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2018

A Decidable Fragment of Second Order Logic With Applications to Synthesis.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

Controller Synthesis Made Real: Reach-Avoid Specifications and Linear Dynamics.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Dynamic race prediction in linear time.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

Look for the Proof to Find the Program: Decorated-Component-Based Program Synthesis.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2014
Computing Information Flow Using Symbolic Model-Checking.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Weak Singular Hybrid Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2014


  Loading...