A
Ahmed Rezine
Researcher at Linköping University
Publications - 57
Citations - 1252
Ahmed Rezine is an academic researcher from Linköping University. The author has contributed to research in topics: Reachability & Model checking. The author has an hindex of 21, co-authored 55 publications receiving 1140 citations. Previous affiliations of Ahmed Rezine include Uppsala University & University of Paris.
Papers
More filters
Book ChapterDOI
Regular model checking without transducers (on efficient verification of parameterized systems)
TL;DR: A simple and efficient method to prove safety properties for parameterized systems with linear topologies, which derives an over-approximation of the induced transition system, which allows the use of a simple class of regular expressions as a symbolic representation.
Book ChapterDOI
String Constraints for Verification
Parosh Aziz Abdulla,Mohamed Faouzi Atig,Yu-Fang Chen,Lukáš Holík,Ahmed Rezine,Philipp Rümmer,Jari Stenman +6 more
TL;DR: This work has developed a prototypical implementation of the decision procedure, and integrated it into a CEGAR-based model checker for the analysis of programs encoded as Horn clauses, able to automatically establish the correctness of several programs that are beyond the reach of existing methods.
Book ChapterDOI
Parameterized verification of infinite-state processes with global conditions
TL;DR: The algorithm is applied to verify mutual exclusion for complex protocols such as Lamport's bakery algorithm both with and without atomicity conditions, a distributed version of the bakery algorithm, and Ricart-Agrawala's distributed mutual exclusion algorithm.
Book ChapterDOI
Norn: An SMT Solver for String Constraints
Parosh Aziz Abdulla,Mohamed Faouzi Atig,Yu-Fang Chen,Lukáš Holík,Ahmed Rezine,Philipp Rümmer,Jari Stenman +6 more
TL;DR: Norn as discussed by the authors is a solver for an expressive constraint language, including word equations, length constraints, and regular membership queries, which is a decision procedure under the assumption of a set of acyclicity conditions on word equations.
Book ChapterDOI
Counter-Example guided fence insertion under TSO
TL;DR: This work gives a sound and complete fence insertion procedure for concurrent finite-state programs running under the classical TSO memory model, and introduces a novel machine model, called the Single-Buffer (SB) semantics, and shows that the Reachability problem for a program under TSO can be reduced to the reachability problem under SB.