3 papers
cs.PL2026
Bounding Fixed Points of Non-Monotone Processes: Theory to Practice
Abdullah H. Rasheed, Vijay K. Garg
Many modern solvers and program analyzers rely on non-monotone reasoning (e.g. negation-as-failure, speculative updates, backtracking) for which classical monotone fixed-point meth…
cs.PL2026
Static Analysis Under Non-Deterministic Program Assumptions
Abdullah H. Rasheed
Static analyses overwhelmingly trade precision for soundness and automation. For this reason, their use-cases are restricted to situations where imprecision isn't prohibitive. In t…
cs.DC2025
Bounding Distance Between Outputs in Distributed Lattice Agreement
Abdullah Rasheed, Nidhi Dubagunta
This paper studies the lattice agreement problem and proposes a stronger form, -bounded lattice agreement, that enforces an additional tightness constraint on the outp…