3 papers
cs.PL2022
Probabilistic Total Store Ordering
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Raj Aryan Agarwal +2
We present -- a probabilistic extension of the classical TSO semantics. For a given (finite-state) program, the operational sem…
cs.PL2020
The Decidability of Verification under Promising 2.0
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole +2
In PLDI'20, Lee et al. introduced the \emph{promising } semantics PS 2.0 of the C++ concurrency that captures most of the common program transformations while satisfying the DRF gu…
cs.AI2020
Containment of Simple Regular Path Queries
Diego Figueira, Adwait Godbole, S. Krishna +3
Testing containment of queries is a fundamental reasoning task in knowledge representation. We study here the containment problem for Conjunctive Regular Path Queries (CRPQs), a na…