5 papers
The complexity of verifying the release-acquire semantics over register machines
Parosh Abdulla, Elli Anastasiadi, Mohamed Faouzi Atig +2
The Release-Acquire (RA) semantics and its variants are some of the most fundamental models of concurrent semantics for architectures, programming languages, and distributed system…
On the Verification Problem of Remote Direct Memory Access programs (Extended Version with Appendix)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Govind Rajanbabu +1
Remote Direct Memory Access (RDMA) is a technology that allows direct memory access from the memory of one computer into that of another without involving either one's operating sy…
Checking Consistency of Event-driven Traces
Parosh Aziz Abdulla, Mohamed Faouzi Atig, R. Govind +2
Event-driven programming is a popular paradigm where the flow of execution is controlled by two features: (1) shared memory and (2) sending and receiving of messages between multip…
When GNNs Met a Word Equations Solver: Learning to Rank Equations (Extended Technical Report)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Julie Cailler +2
Nielsen transformation is a standard approach for solving word equations: by repeatedly splitting equations and applying simplification steps, equations are rewritten until a solut…
Guiding Word Equation Solving using Graph Neural Networks (Extended Technical Report)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Julie Cailler +2
This paper proposes a Graph Neural Network-guided algorithm for solving word equations, based on the well-known Nielsen transformation for splitting equations. The algorithm iterat…