52 citations · 155 across the 40 of their papers we have counts for
44 papers
Parameterized Reachability for Register Machines with Data
Parosh Aziz Abdulla, Mohammed Faouzi Atig, Abhijith R Nair +2
We investigate the parameterized reachability problem for concurrent register machines over infinite data domains. In this framework, each machine is a program equipped with a set…
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…
Parameterized Verification of Quantum Circuits (Technical Report)
Parosh Aziz Abdulla, Yu-Fang Chen, Michal Hečko +4
We present the first fully automatic framework for verifying relational properties of parameterized quantum programs, i.e., a program that, given an input size, generates a corresp…
Efficient Linearizability Monitoring
Parosh Aziz Abdulla, Samuel Grahn, Bengt Jonsson +2
This paper revisits the fundamental problem of monitoring the linearizability of concurrent stacks, queues, sets, and multisets. Given a history of a library implementing one of th…
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…