Update news and papers

dwslim · dwslim · commit 55063620a808 · 2025-01-14T17:11:58.000+08:00
diff --git a/config/_default/hugo.yaml b/config/_default/hugo.yaml
@@ -33,7 +33,7 @@ permalinks:
   publication_types: '/publication-type/:slug/'
 disableAliases: true
 outputs:
-  home: [HTML, RSS, JSON, WebAppManifest, headers, redirects]
+  home: [HTML, RSS, JSON, WebAppManifest]
   section: [HTML, RSS]
 imaging:
   resampleFilter: lanczos
diff --git a/content/news/2024-08-12-new-members.md b/content/news/2024-08-12-new-members.md
@@ -0,0 +1,6 @@
+---
+date: 2024-08-16
+---
+
+
+PhD student Zihan Zhou, and undergraduate students Arsyad Kamili, Jed Koh Jin Keat, Ramanathan Kumarappan, Bryan Lim and David Zhu join us!
diff --git a/content/news/2024-08-12-zihan-arnav.md b/content/news/2024-08-12-zihan-arnav.md
diff --git a/content/news/2024-11-19-papers.md b/content/news/2024-11-19-papers.md
@@ -0,0 +1,6 @@
+---
+date: 2024-11-19
+---
+
+
+Papers accepted: [The Decision Problem for Regular First-Order Theories (POPL'25)](https://arxiv.org/pdf/2410.17185), [Selectively Uniform Concurrency Testing (ASPLOS'25)](https://abhikrc.com/pdf/asplos25.pdf)
diff --git a/content/publication/2024/A-faster-FPRAS-for-NFA/index.md b/content/publication/2024/A-faster-FPRAS-for-NFA/index.md
@@ -10,7 +10,7 @@ authors:
   - umang
 
 date: "2024-04-08T00:00:00Z"
-doi: https://doi.org/10.48550/arXiv.2312.13320
+doi: 10.48550/arXiv.2312.13320
 
 
 # Publication type.
diff --git a/content/publication/2024/Coarser Equivalences for Causal Concurrency/index.md b/content/publication/2024/Coarser Equivalences for Causal Concurrency/index.md
@@ -4,7 +4,7 @@ authors:
 - Azadeh Farzan
 - umang
 date: "2024-01-05T00:00:00Z"
-doi: "https://doi.org/10.1145/3632873"
+doi: "10.1145/3632873"
 
 # Publication type.
 # Accepts a single type but formatted as a YAML list (for Hugo requirements).
diff --git a/content/publication/2024/Greybox Fuzzing for Concurrency Testing/index.md b/content/publication/2024/Greybox Fuzzing for Concurrency Testing/index.md
@@ -7,7 +7,7 @@ authors:
 - umang
 - Abhik Roychoudhury
 date: "2024-04-23T00:00:00Z"
-doi: "https://doi.org/10.1145/3620665.3640389"
+doi: "10.1145/3620665.3640389"
 
 # Publication type.
 # Accepts a single type but formatted as a YAML list (for Hugo requirements).
diff --git a/content/publication/2024/How Hard Is Weak-Memory Testing?/index.md b/content/publication/2024/How Hard Is Weak-Memory Testing?/index.md
@@ -6,7 +6,7 @@ authors:
 - umang
 - Andreas Pavlogiannis
 date: "2024-01-05T00:00:00Z"
-doi: "https://doi.org/10.1145/3632908"
+doi: "10.1145/3632908"
 
 # Publication type.
 # Accepts a single type but formatted as a YAML list (for Hugo requirements).
diff --git a/content/publication/2024/Optimistic Prediction of Synchronization-Reversal Data Races/index.md b/content/publication/2024/Optimistic Prediction of Synchronization-Reversal Data Races/index.md
@@ -5,7 +5,7 @@ authors:
 - umang
 - Andreas Pavlogiannis
 date: "2024-01-11T00:00:00Z"
-doi: "https://doi.org/10.48550/arXiv.2401.05642"
+doi: "10.48550/arXiv.2401.05642"
 
 # Publication type.
 # Accepts a single type but formatted as a YAML list (for Hugo requirements).
diff --git a/content/publication/2024/Predictive Monitoring against Pattern Regular Languages/index.md b/content/publication/2024/Predictive Monitoring against Pattern Regular Languages/index.md
@@ -4,7 +4,7 @@ authors:
 - zhendong.ang
 - umang
 date: "2024-01-05T00:00:00Z"
-doi: "https://doi.org/10.1145/3632915"
+doi: "10.1145/3632915"
 
 # Publication type.
 # Accepts a single type but formatted as a YAML list (for Hugo requirements).
diff --git a/content/publication/2024/rooting-for-efficiency/index.md b/content/publication/2024/rooting-for-efficiency/index.md
@@ -7,7 +7,7 @@ authors:
 - umang
 - Ilya Sergey
 date: "2024-01-09T00:00:00Z"
-doi: "https://doi.org/10.1145/3636501.3636944"
+doi: "10.1145/3636501.3636944"
 
 # Publication type.
 # Accepts a single type but formatted as a YAML list (for Hugo requirements).
diff --git a/content/publication/2025/Selective Uniform Concurrency Testing/index.md b/content/publication/2025/Selective Uniform Concurrency Testing/index.md
@@ -0,0 +1,51 @@
+---
+title: "Selectively Uniform Concurrency Testing"
+authors:
+- huan.zhao
+- Dylan Wolff
+- umang
+- Abhik Roychoudhury
+date: "2025-01-14T00:00:00Z"
+
+# Publication type.
+# Accepts a single type but formatted as a YAML list (for Hugo requirements).
+# Enter a publication type from the CSL standard.
+publication_types: ["paper-conference"]
+
+# Publication name and optional abbreviated publication name.
+publication: "International Conference on Architectural Support for Programming Languages and Operating Systems"
+publication_short: "ASPLOS 2025"
+
+abstract: |-
+    Buggy behaviors in concurrent programs are notoriously elusive, as they may manifest only in few of exponentially many possible thread interleavings. Randomized concurrency testing techniques probabilistically sample from (instead of enumerating) the vast search space and have been shown to be both an effective as well as a scalable class of algorithms for automated discovery of concurrency bugs. In this work we focus on the key desirable characteristic of black-box randomized concurrency testing algorithms — uniformity of exploration. Unfortunately, prior randomized algorithms acutely fall short on uniformity and, as a result, struggle to expose bugs that only manifest in few, infrequent interleavings. Towards this, we show that, indeed, a sampling strategy for uniformly sampling over the interleaving space, is eminently achievable with minimal additional information for broad classes of programs. Moreover, when applied to a carefully selected subset of program events, this interleaving-uniformity strategy allows for an effective exploration of program behaviors. We present an online randomized concurrency testing algorithm named Selectively Uniform Random Walk (`SURW`) that builds on these insights. `SURW` is the first of its class to achieve interleaving-uniformity for a wide class of programs, or an arbitrary subset of events thereof. This property translates to effective behavioral exploration should a subset with desirable characteristics be selected. Extensive evaluation on leading concurrency benchmarks suggests `SURW` is able to expose more bugs and significantly faster than comparable randomized algorithms. In addition, we show that `SURW` is able to explore both the space of interleavings and behaviors more uniformly on real-world programs.
+
+tags:
+- fuzzing
+featured: false
+
+# links:
+# - name: ""
+#   url: ""
+url_pdf: https://abhikrc.com/pdf/asplos25.pdf
+url_code:
+url_dataset: ''
+url_poster: ''
+url_project: ''
+url_slides: ''
+url_source: ''
+url_video: ''
+
+# Associated Projects (optional).
+#   Associate this publication with one or more of your projects.
+#   Simply enter your project's folder or file name without extension.
+#   E.g. `internal-project` references `content/project/internal-project/index.md`.
+#   Otherwise, set `projects: []`.
+projects: []
+
+# Slides (optional).
+#   Associate this publication with Markdown slides.
+#   Simply enter your slide deck's filename without extension.
+#   E.g. `slides: "example"` references `content/slides/example/index.md`.
+#   Otherwise, set `slides: ""`.
+slides: ""
+---
diff --git a/content/publication/2025/The Decision Problem for Regular First-Order Theories/cite.bib b/content/publication/2025/The Decision Problem for Regular First-Order Theories/cite.bib
@@ -0,0 +1,18 @@
+@article{10.1145/3704870,
+author = {Mathur, Umang and Mestel, David and Viswanathan, Mahesh},
+title = {The Decision Problem for Regular First Order Theories},
+year = {2025},
+issue_date = {January 2025},
+publisher = {Association for Computing Machinery},
+address = {New York, NY, USA},
+volume = {9},
+number = {POPL},
+url = {https://doi-org.libproxy1.nus.edu.sg/10.1145/3704870},
+doi = {10.1145/3704870},
+abstract = {The Entscheidungsproblem, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order theories, i.e., (infinite) regular sets of formulae. Building on the elegant classification of syntactic classes as decidable or undecidable for the classical decision problem, we show that some classes (specifically, the EPR and Gurevich classes), which are decidable in the classical setting, become undecidable for regular theories. On the other hand, for each of these classes, we identify a subclass that remains decidable in our setting, leaving a complete classification as a challenge for future work. Finally, we observe that our problem generalises prior work on automata-theoretic verification of uninterpreted programs and propose a semantic class of existential formulae for which the problem is decidable.},
+journal = {Proc. ACM Program. Lang.},
+month = jan,
+articleno = {34},
+numpages = {27},
+keywords = {decidability, effectively propositional logic, first order logic, regular theories}
+}
diff --git a/content/publication/2025/The Decision Problem for Regular First-Order Theories/index.md b/content/publication/2025/The Decision Problem for Regular First-Order Theories/index.md
@@ -0,0 +1,63 @@
+---
+title: 'The Decision Problem for Regular First-Order Theories'
+
+# Authors
+# If you created a profile for a user (e.g. the default `admin` user), write the username (folder name) here
+# and it will be replaced with their full name and linked to their profile.
+authors:
+  - umang
+  - David Mestel
+  - Mahesh Viswanathan
+
+date: "2025-01-09T00:00:00Z"
+doi: 10.1145/3704870
+
+
+# Publication type.
+# Accepts a single type but formatted as a YAML list (for Hugo requirements).
+# Enter a publication type from the CSL standard.
+publication_types: ['paper-conference']
+
+# Publication name and optional abbreviated publication name.
+publication: "52nd ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2025)"
+publication_short: "POPL 2025"
+
+abstract: |-
+  The *Entscheidungsproblem*, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order theories, i.e., (infinite) regular sets of formulae. Building on the elegant classification of syntactic classes as decidable or undecidable for the classical decision problem, we show that some classes (specifically, the EPR and Gurevich classes), which are decidable in the classical setting, become undecidable for regular theories. On the other hand, for each of these classes, we identify a subclass that remains decidable in our setting, leaving a complete classification as a challenge for future work. Finally, we observe that our problem generalises prior work on automata-theoretic verification of uninterpreted programs and propose a semantic class of existential formulae for which the problem is decidable.
+
+tags: []
+
+# Display this page in the Featured widget?
+featured: false
+
+# Custom links (uncomment lines below)
+# links:
+# - name: Custom Link
+#   url: http://example.org
+
+url_pdf: 'https://arxiv.org/pdf/2410.17185'
+url_code: ''
+url_dataset: ''
+url_poster: ''
+url_project: ''
+url_slides: ''
+url_source: ''
+url_video: ''
+
+
+# Associated Projects (optional).
+#   Associate this publication with one or more of your projects.
+#   Simply enter your project's folder or file name without extension.
+#   E.g. `internal-project` references `content/project/internal-project/index.md`.
+#   Otherwise, set `projects: []`.
+projects: []
+
+# Slides (optional).
+#   Associate this publication with Markdown slides.
+#   Simply enter your slide deck's filename without extension.
+#   E.g. `slides: "example"` references `content/slides/example/index.md`.
+#   Otherwise, set `slides: ""`.
+slides: ""
+---
+
+
diff --git a/themes/blox-tailwind/node_modules/.package-lock.json b/themes/blox-tailwind/node_modules/.package-lock.json

-Original file line number
+Diff line change
@@ @@ -0,0 +1,6 @@ @@
 +---
 +date: 2024-08-16
 +---
++
++
 +PhD student Zihan Zhou, and undergraduate students Arsyad Kamili, Jed Koh Jin Keat, Ramanathan Kumarappan, Bryan Lim and David Zhu join us!