<?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>Umang Mathur</title>
    <link>https://www.comp.nus.edu.sg/~umathur/</link>
    <description>Recent content 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/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Concurrency Testing and Verification</title>
      <link>https://www.comp.nus.edu.sg/~umathur/research-directions/concurrency/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/research-directions/concurrency/</guid>
      <description>&lt;p&gt;This project area includes our work on concurrency testing and verification. This includes our work on runtime predictive analysis such as prediction of data races, deadlocks, atomicity violations and other classes of properties, as well as linearizability monitoring, model checking, and related verification questions for concurrent systems.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Safe, Reliable and Secure Hardware</title>
      <link>https://www.comp.nus.edu.sg/~umathur/research-directions/hardware/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/research-directions/hardware/</guid>
      <description>&lt;p&gt;This project area includes my work on hardware description languages, timing-safe hardware, secure hardware design, and related verification and synthesis questions. See &lt;a href=&#34;https://anvil.kisp-lab.org/&#34;&gt;Anvil playground&lt;/a&gt;.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Program Translation</title>
      <link>https://www.comp.nus.edu.sg/~umathur/research-directions/translation/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/research-directions/translation/</guid>
      <description>&lt;p&gt;This project area includes our work on automated translation of software across programming languages. Also see &lt;a href=&#34;https://kisp.comp.nus.edu.sg/projects/apt/&#34;&gt;related page on KISP lab&amp;rsquo;s website&lt;/a&gt;.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Logic, Decidability and Complexity</title>
      <link>https://www.comp.nus.edu.sg/~umathur/research-directions/theory/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/research-directions/theory/</guid>
      <description>&lt;p&gt;This project area includes our work on decidability, complexity, automata, regular theories, synthesis, and foundational questions in logic and verification.&lt;/p&gt;</description>
    </item>
    <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>
    <item>
      <title>Research Team</title>
      <link>https://www.comp.nus.edu.sg/~umathur/team/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/team/</guid>
      <description>&lt;h2 id=&#34;research-fellows&#34;&gt;Research Fellows&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://apaznikov.github.io/&#34;&gt;Alexey Paznikov&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://michael-schwarz.github.io/&#34;&gt;Michael Schwarz&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id=&#34;phd-students&#34;&gt;PhD Students&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://ang9876.github.io/&#34;&gt;Zhendong Ang&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.comp.nus.edu.sg/~zs357/&#34;&gt;Zheng Shi&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://tianyuli12.github.io/&#34;&gt;Tianyu Li&lt;/a&gt;, co-advised with &lt;a href=&#34;https://www.comp.nus.edu.sg/~prateeks/&#34;&gt;Prateek Saxena&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://zhaohuanqdcn.github.io/&#34;&gt;Huan Zhao&lt;/a&gt;, co-advised with &lt;a href=&#34;https://abhikrc.com/&#34;&gt;Abhik Roychoudhury&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://jsyczzh.github.io/&#34;&gt;Zihan Zhou&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arj4web.github.io/&#34;&gt;Aditya Ranjan Jha&lt;/a&gt;, co-advised with &lt;a href=&#34;https://www.comp.nus.edu.sg/~prateeks/&#34;&gt;Prateek Saxena&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id=&#34;research-assistants&#34;&gt;Research Assistants&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://www.richwill.dev/&#34;&gt;Richard Willie&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id=&#34;masters-students&#34;&gt;Masters Students&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;Hien Huynh&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id=&#34;undergraduate-students&#34;&gt;Undergraduate Students&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;Guk Yi Siong (BComp, 2026)&lt;/li&gt;
&lt;li&gt;Wern Lim (BComp, 2026)&lt;/li&gt;
&lt;li&gt;Hua Jun Teow (BComp, 2026)&lt;/li&gt;
&lt;li&gt;Jeffrey Lee (BComp, 2026)&lt;/li&gt;
&lt;li&gt;Dick Ong (BComp, 2026)&lt;/li&gt;
&lt;li&gt;Ivan Tan (BComp, 2026)&lt;/li&gt;
&lt;li&gt;Hong Jung Woo (BComp, 2026)&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id=&#34;alumni&#34;&gt;Alumni&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;Hongyi Huang (BComp, 2025)&lt;/li&gt;
&lt;li&gt;Zengyan Hao (MComp, 2025)&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://gracetan.neocities.org/&#34;&gt;Grace Tan&lt;/a&gt; †&lt;/li&gt;
&lt;li&gt;Bryan Lim (BComp, 2025)&lt;/li&gt;
&lt;li&gt;Arsyad Kamili (BComp, 2025)&lt;/li&gt;
&lt;li&gt;Jed Koh Jin Keat (BComp, 2025)&lt;/li&gt;
&lt;li&gt;Ramanathan Kumarappan (BComp, 2025)&lt;/li&gt;
&lt;li&gt;David Zhu (BComp, 2025)&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://daniao.ws/&#34;&gt;Daniel Lim&lt;/a&gt; (Research Assistant, 2024-25)&lt;/li&gt;
&lt;li&gt;Dasco Gabriel (BComp, 2024)&lt;/li&gt;
&lt;li&gt;Zheng Han Lee (BComp, 2024)&lt;/li&gt;
&lt;li&gt;Richard Willie (BComp, 2024)&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.linkedin.com/in/ho-wei-haw-635389168/&#34;&gt;Ho Wei Haw&lt;/a&gt; (BComp, 2023)&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.comp.nus.edu.sg/~zs357/&#34;&gt;Zheng Shi&lt;/a&gt; (MComp, 2023)&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.linkedin.com/in/illio-suardi-537b56210/&#34;&gt;Illio Suardi&lt;/a&gt; (BComp, 2023)&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id=&#34;interns&#34;&gt;Interns&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;Thomas Cheeramvelil, IIT Bombay (2024)&lt;/li&gt;
&lt;li&gt;Anish Kulkarni, IIT Bombay (2024)&lt;/li&gt;
&lt;li&gt;Pratik Sahoo, IIT Bombay (2024)&lt;/li&gt;
&lt;li&gt;Arhaan Ahmad, IIT Bombay (2023)&lt;/li&gt;
&lt;li&gt;Arnav Singh, IIT Bombay (2023)&lt;/li&gt;
&lt;li&gt;Aryan Soltani, University of Tehran (2023)&lt;/li&gt;
&lt;li&gt;Abhinav Barnawal, IIT Delhi (2022)&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;em&gt;† Grace Tan passed away in 2025. Remembered for her passion for education and enthusiasm for research.&lt;/em&gt;&lt;/p&gt;</description>
    </item>
    <item>
      <title>Service</title>
      <link>https://www.comp.nus.edu.sg/~umathur/service/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/service/</guid>
      <description>&lt;h2 id=&#34;program-committees&#34;&gt;Program Committees&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://www.setta2026.sg/&#34;&gt;SETTA 2026&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://popl26.sigplan.org/track/POPL-2026-student-research-competition&#34;&gt;POPL 2026 (SRC)&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://conf.researchr.org/track/splash-issta-2026/splash-issta-2026-doctoral-symposium&#34;&gt;SPLASH/ISSTA Doctoral symposium&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://pldi25.sigplan.org/&#34;&gt;PLDI 2025&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://2025.splashcon.org/track/OOPSLA&#34;&gt;OOPSLA 2025&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://conf.researchr.org/home/atva-2025&#34;&gt;ATVA 2025&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://rv25.conf.tuwien.ac.at/&#34;&gt;RV 2025&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.setta2025.uk/&#34;&gt;SETTA 2025&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://conf.researchr.org/home/aplas-2025&#34;&gt;APLAS 2025&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://etaps.org/2025/conferences/tacas/&#34;&gt;TACAS 2025&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://etaps.org/2025/conferences/esop/&#34;&gt;ESOP 2025&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.soundandcomplete.org/vstte2024.html&#34;&gt;VSTTE 2024&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://confest2024.github.io/CONCUR_call_for_papers.html&#34;&gt;CONCUR 2024&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;http://i-cav.org/2024/call-for-papers/&#34;&gt;CAV 2024&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://conf.researchr.org/home/icse-2024&#34;&gt;ICSE 2024&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://conf.researchr.org/home/POPL-2023&#34;&gt;POPL 2023&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://pldi23.sigplan.org/track/pldi-2023-src&#34;&gt;PLDI 2023 (SRC)&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://2022.splashcon.org/home/aplas-2022&#34;&gt;APLAS 2022&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://ppopp20.sigplan.org/track/PPoPP-2020-BriefAnnouncement&#34;&gt;PPoPP 2020 (Brief Announcements)&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://2020.splashcon.org/track/splash-2020-oopsla&#34;&gt;OOPSLA 2020 Artifact Evaluation&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://conf.researchr.org/home/pldi-2020&#34;&gt;PLDI 2020 Artifact Evaluation&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;http://i-cav.org/2020/&#34;&gt;CAV 2020 Artifact Evaluation&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://popl20.sigplan.org/&#34;&gt;POPL 2020 Artifact Evaluation&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://hscc2017.ece.illinois.edu/&#34;&gt;HSCC 2017 Artifact Evaluation&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id=&#34;organizing-committees&#34;&gt;Organizing Committees&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://pldi25.sigplan.org/track/PLMW-PLDI-2024&#34;&gt;PLMW@PLDI&lt;/a&gt; Senior Chair 2025&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://pldi24.sigplan.org/track/PLMW-PLDI-2024&#34;&gt;PLMW@PLDI&lt;/a&gt; Junior Chair 2024&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://i-cav.org/2024/workshops/mentoring/&#34;&gt;VMW@CAV&lt;/a&gt; 2024&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.sigplan.org/LongTermMentoring/&#34;&gt;SIGPLAN Long Term Mentorship Program&lt;/a&gt; 2020–2022&lt;/li&gt;
&lt;/ul&gt;</description>
    </item>
    <item>
      <title>Teaching</title>
      <link>https://www.comp.nus.edu.sg/~umathur/teaching/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://www.comp.nus.edu.sg/~umathur/teaching/</guid>
      <description>&lt;ul&gt;
&lt;li&gt;
&lt;p&gt;&lt;strong&gt;CS4269/CS5469 Foundations of Logic in Computer Science&lt;/strong&gt;&lt;br&gt;
Semester II, 2021–22&lt;br&gt;
Semester II, 2022–23&lt;br&gt;
Semester II, 2023–24&lt;br&gt;
Semester I, 2024–25&lt;br&gt;
Semester II, 2025–26&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;strong&gt;CS4211 Formal Methods for Software Engineering&lt;/strong&gt;&lt;br&gt;
Semester I, 2024–25&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;strong&gt;CS2040 Data Structures and Algorithms&lt;/strong&gt;&lt;br&gt;
Semester I, 2023–24&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;strong&gt;&lt;a href=&#34;https://www.comp.nus.edu.sg/~umathur/teaching/CS6217/&#34;&gt;CS6217 Topics in Programming Languages &amp;amp; Software Engineering&lt;/a&gt;&lt;/strong&gt;&lt;br&gt;
Semester I, 2022–23 (Theme: Automata and Decidability)&lt;br&gt;
Semester I, 2024–25 (Theme: PL for ML and ML for PL)&lt;/p&gt;
&lt;/li&gt;
&lt;/ul&gt;</description>
    </item>
  </channel>
</rss>
