52 citations · 155 across the 40 of their papers we have counts for
10 papers · 1 filter
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…
Verification under TSO with an infinite Data Domain
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Florian Furbach +1
We examine verification of concurrent programs under the total store ordering (TSO) semantics used by the x86 architecture. In our model, threads manipulate variables over infinite…
Chain-Free String Constraints (Technical Report)
Parosh Aziz Abdulla, Mohamed Faouzi Atig Bui Phi Diep, Lukáš Holík +1
We address the satisfiability problem for string constraints that combine relational constraints represented by transducers, word equations, and string length constraints. This pro…
Parameterized Verification under TSO with Data Types
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Florian Furbach +4
We consider parameterized verification of systems executing according to the total store ordering (TSO) semantics. The processes manipulate abstract data types over potentially inf…
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…
Communicating Timed Processes with Perfect Timed Channels
Parosh Aziz Abdulla, Mohamed Faouzi Atig, S. Krishna
We introduce the model of communicating timed automata (CTA) that extends the classical models of finite-state processes communicating through FIFO perfect channels and timed autom…