Showing cs.PLShow all
3 papers · 1 filter
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.PL2024
Hal: A Language-General Framework for Analysis of User-Specified Monotone Frameworks [DRAFT]
Abdullah Rasheed
Writing dataflow analyzers requires both language and domain-specificity. That is to say, each programming language and each program property requires its own analyzer. To enable a…