<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Publications on Umang Mathur</title>
    <link>https://www.comp.nus.edu.sg/~umathur/publications/</link>
    <description>Recent content in Publications on Umang Mathur</description>
    <generator>Hugo -- 0.148.2</generator>
    <language>en-us</language>
    <lastBuildDate>Sat, 04 Apr 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.comp.nus.edu.sg/~umathur/publications/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Fixed Parameter Tractable Linearizability Monitoring</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2026-pldi-lee-fpt-linearizability-monitoring/</link>
      <pubDate>Sat, 04 Apr 2026 00:00:00 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2026-pldi-lee-fpt-linearizability-monitoring/</guid>
      <description></description>
    </item>
    <item>
      <title>State Space Estimation for DPOR-based Model Checkers</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2026-pldi-balasubramanian-dpor-estimation/</link>
      <pubDate>Sat, 04 Apr 2026 00:00:00 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2026-pldi-balasubramanian-dpor-estimation/</guid>
      <description></description>
    </item>
    <item>
      <title>Anvil: A General-Purpose Timing-Safe Hardware Description Language</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2026-asplos-yu-anvil-hdl/</link>
      <pubDate>Sun, 22 Mar 2026 00:00:00 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2026-asplos-yu-anvil-hdl/</guid>
      <description></description>
    </item>
    <item>
      <title>Counting and Sampling Traces in Regular Languages</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2026-popl-decolnet-counting-sampling-traces/</link>
      <pubDate>Thu, 08 Jan 2026 00:00:00 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2026-popl-decolnet-counting-sampling-traces/</guid>
      <description></description>
    </item>
    <item>
      <title>The Complexity of Testing Message-Passing Concurrency</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2026-popl-shi-message-passing-consistency/</link>
      <pubDate>Thu, 08 Jan 2026 00:00:00 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2026-popl-shi-message-passing-consistency/</guid>
      <description></description>
    </item>
    <item>
      <title>Efficient Decrease-And-Conquer Linearizability Monitoring</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2025-oopsla-lee-decrease-and-conquer-linearizability-monitoring/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2025-oopsla-lee-decrease-and-conquer-linearizability-monitoring/</guid>
      <description></description>
    </item>
    <item>
      <title>Efficient Timestamping for Sampling-based Race Detection</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2025-pldi-zhang-sampling-timestamping/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2025-pldi-zhang-sampling-timestamping/</guid>
      <description></description>
    </item>
    <item>
      <title>Program Skeletons for Automated Program Translation</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2025-pldi-wang-skel-program-translation/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2025-pldi-wang-skel-program-translation/</guid>
      <description></description>
    </item>
    <item>
      <title>Selectively Uniform Concurrency Testing</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2025-asplos-zhao-surw-concurrency-testing/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2025-asplos-zhao-surw-concurrency-testing/</guid>
      <description></description>
    </item>
    <item>
      <title>The Decision Problem for Regular First-Order Theories</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2025-popl-mathur-regular-theories/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2025-popl-mathur-regular-theories/</guid>
      <description></description>
    </item>
    <item>
      <title>Predictive Monitoring with Strong Trace Prefixes</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2024-cav-ang-strong-trace-prefixes/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2024-cav-ang-strong-trace-prefixes/</guid>
      <description></description>
    </item>
    <item>
      <title>Predictive Monitoring against Pattern Regular Languages</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2024-popl-ang-pattern-languages/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2024-popl-ang-pattern-languages/</guid>
      <description>&lt;p&gt;Note: The ArXiv version of the paper corrects an error in the published version.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Coarser Equivalences for Causal Concurrency</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2024-popl-farzan-grain-equivalence/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2024-popl-farzan-grain-equivalence/</guid>
      <description></description>
    </item>
    <item>
      <title>How Hard is Weak-Memory Testing?</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2024-popl-chakraborty-hardness-weak-memory/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2024-popl-chakraborty-hardness-weak-memory/</guid>
      <description></description>
    </item>
    <item>
      <title>A Faster FPRAS for #NFA</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2024-pods-meel-fpras-sharpe-nfa/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2024-pods-meel-fpras-sharpe-nfa/</guid>
      <description></description>
    </item>
    <item>
      <title>Greybox Fuzzing for Concurrency Testing</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2024-asplos-wolff-rff-greybox-concurrency-fuzzing/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2024-asplos-wolff-rff-greybox-concurrency-fuzzing/</guid>
      <description></description>
    </item>
    <item>
      <title>Optimistic Prediction of Synchronization-Reversal Data Races</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2024-icse-shi-osr-race-prediction/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2024-icse-shi-osr-race-prediction/</guid>
      <description></description>
    </item>
    <item>
      <title>Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2024-cpp-zhao-arboreta/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2024-cpp-zhao-arboreta/</guid>
      <description></description>
    </item>
    <item>
      <title>Dynamic Race Detection With O(1) Samples</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2023-popl-thokair-rpt-sampling-race-detection/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2023-popl-thokair-rpt-sampling-race-detection/</guid>
      <description></description>
    </item>
    <item>
      <title>Optimal Reads-From Consistency Checking for C11-Style Memory Models</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2023-pldi-tunc-ra-reads-from/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2023-pldi-tunc-ra-reads-from/</guid>
      <description></description>
    </item>
    <item>
      <title>Sound Dynamic Deadlock Prediction in Linear Time</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2023-pldi-tunc-syncp-deadlock-prediction/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2023-pldi-tunc-syncp-deadlock-prediction/</guid>
      <description></description>
    </item>
    <item>
      <title>A Tree Clock Data Structure for Causal Orderings in Concurrent Executions</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2022-asplos-mathur-tree-clocks/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2022-asplos-mathur-tree-clocks/</guid>
      <description></description>
    </item>
    <item>
      <title>Controller Synthesis for Linear Systems With Reach-Avoid Specifications</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2022-tac-fan-controller-synthesis/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2022-tac-fan-controller-synthesis/</guid>
      <description></description>
    </item>
    <item>
      <title>Dynamic Data-Race Detection through the Fine-Grained Lens</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2021-concur-kulkarni-fine-grained-complexity-race-detection/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2021-concur-kulkarni-fine-grained-complexity-race-detection/</guid>
      <description></description>
    </item>
    <item>
      <title>Checking LTL[F,G,X] on Compressed Traces in Polynomial Time</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2021-fse-zhang-compressed-ltl/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2021-fse-zhang-compressed-ltl/</guid>
      <description></description>
    </item>
    <item>
      <title>Optimal Prediction of Synchronization-Preserving Races</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2021-popl-mathur-syncp-race-prediction/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2021-popl-mathur-syncp-race-prediction/</guid>
      <description></description>
    </item>
    <item>
      <title>Scalable Statistical Root Cause Analysis on App Telemetry</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2021-icse-murali-root-cause-analysis/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2021-icse-murali-root-cause-analysis/</guid>
      <description></description>
    </item>
    <item>
      <title>Decidable Synthesis of Programs with Uninterpreted Functions</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2020-cav-krogmeier-synthesis-of-coherent-programs/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2020-cav-krogmeier-synthesis-of-coherent-programs/</guid>
      <description></description>
    </item>
    <item>
      <title>Atomicity Checking in Linear Time using Vector Clocks</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2020-asplos-mathur-aerodrome-atomicity-checking/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2020-asplos-mathur-aerodrome-atomicity-checking/</guid>
      <description></description>
    </item>
    <item>
      <title>Deciding Memory Safety for Single-Pass Heap-Manipulating Programs</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2020-popl-mathur-decidable-memory-safety/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2020-popl-mathur-decidable-memory-safety/</guid>
      <description></description>
    </item>
    <item>
      <title>Exact Quantitative Probabilistic Model Checking Through Rational Search</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2020-fmsd-mathur-rationalsearch/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2020-fmsd-mathur-rationalsearch/</guid>
      <description></description>
    </item>
    <item>
      <title>The Complexity of Data Race Prediction</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2020-lics-mathur-complexity-race-prediction/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2020-lics-mathur-complexity-race-prediction/</guid>
      <description></description>
    </item>
    <item>
      <title>What&#39;s Decidable About Program Verification Modulo Axioms?</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2020-tacas-mathur-decidable-verification-modulo-axioms/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2020-tacas-mathur-decidable-verification-modulo-axioms/</guid>
      <description></description>
    </item>
    <item>
      <title>Decidable Verification of Uninterpreted Programs</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2019-popl-mathur-verification-of-coherent-programs/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2019-popl-mathur-verification-of-coherent-programs/</guid>
      <description></description>
    </item>
    <item>
      <title>Data Race Detection on Compressed Traces</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2018-fse-kini-compressed-race-detection/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2018-fse-kini-compressed-race-detection/</guid>
      <description></description>
    </item>
    <item>
      <title>Controller Synthesis Made Real: Reach-avoid Specifications and Linear Dynamics</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2018-cav-fan-controller-synthesis/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2018-cav-fan-controller-synthesis/</guid>
      <description></description>
    </item>
    <item>
      <title>Decidable Fragment of Second Order Logic With Applications to Program Synthesis</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2018-csl-madhusudan-eqsmt/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2018-csl-madhusudan-eqsmt/</guid>
      <description></description>
    </item>
    <item>
      <title>What Happens-After the First Race? Enhancing the Predictive Power of Happens-Before Based Dynamic Race Detection</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2018-oopsla-mathur-shb-race-detection/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2018-oopsla-mathur-shb-race-detection/</guid>
      <description></description>
    </item>
    <item>
      <title>Exact Quantitative Probabilistic Model Checking Through Rational Search</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2017-fmcad-bauer-rationalsearch/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2017-fmcad-bauer-rationalsearch/</guid>
      <description></description>
    </item>
    <item>
      <title>Look for the Proof to Find the Program: Decorated-Component-Based Program Synthesis</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2017-cav-gascon-proof-search/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2017-cav-gascon-proof-search/</guid>
      <description></description>
    </item>
    <item>
      <title>Dynamic Race Prediction in Linear Time</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2017-pldi-kini-wcp-race-prediction/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2017-pldi-kini-wcp-race-prediction/</guid>
      <description></description>
    </item>
    <item>
      <title>Computing Information Flow Using Symbolic Model-Checking</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2014-fsttcs-chadha-information-flow/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2014-fsttcs-chadha-information-flow/</guid>
      <description></description>
    </item>
    <item>
      <title>Weak Singular Hybrid Automata</title>
      <link>https://www.comp.nus.edu.sg/~umathur/publications/2014-formats-krishna-weak-singular-hybrid-automata/</link>
      <pubDate>Sat, 23 Aug 2025 16:46:18 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/publications/2014-formats-krishna-weak-singular-hybrid-automata/</guid>
      <description></description>
    </item>
  </channel>
</rss>
