Search

• < Previous
• 1
• Next >

---

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility

Anthony W. Lin ; Rupak Majumdar.

Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables and constants. Its solution amounts to a function mapping variables to constant strings that equate the left and right hand sides of the&nbsp;[&hellip;]

---

General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond

Rupak Majumdar ; Ramanathan S. Thinniyam ; Georg Zetzsche.

The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that capture all known results as well as show&nbsp;[&hellip;]

---