10 citations · 13 across the 12 of their papers we have counts for
4 papers · 1 filter
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…
On the Separability Problem of String Constraints
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Vrunda Dave +1
We address the separability problem for straight-line string constraints. The separability problem for languages of a class C by a class S asks: given two languages A and B in C, d…
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…
Revisiting Underapproximate Reachability for Multipushdown Systems
S. Akshay, Paul Gastin, S Krishna +1
Boolean programs with multiple recursive threads can be captured as pushdown automata with multiple stacks. This model is Turing complete, and hence, one is often interested in ana…