( en | de | ru )

 

Disambiguation of "Bouajjani, Ahmed"

Author of the publication

copydeleteadd this publication to your clipboard
Detecting Fair Non-termination in Multithreaded Programs

, , , and . Computer Aided Verification, page 210--226. Berlin, Heidelberg, Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ahmed Fattah Ahmed Ahmed

Rafiq Ahmed

Hassan cheikh Ahmed

Yasar Luqman Ahmed

Ejaz Ahmed

 

Other publications of authors with the same name

Model Checking Procedural Programs., , and . Handbook of Model Checking, Springer, (2018)Robustness Against Transactional Causal Consistency., , and . CONCUR, volume 140 of LIPIcs, page 30:1-30:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Analyzing Fair Parametric Extended Automata., , , and . SAS, volume 2126 of Lecture Notes in Computer Science, page 335-355. Springer, (2001)Effective Lossy Queue Languages., , and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 639-651. Springer, (2001)On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems., and . RP, volume 5797 of Lecture Notes in Computer Science, page 1-2. Springer, (2009)What's Decidable about Weak Memory Models?, , , and . ESOP, volume 7211 of Lecture Notes in Computer Science, page 26-46. Springer, (2012)Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes., , and . CAV (1), volume 13371 of Lecture Notes in Computer Science, page 282-303. Springer, (2022)TReX: A Tool for Reachability Analysis of Complex Systems., , and . CAV, volume 2102 of Lecture Notes in Computer Science, page 368-372. Springer, (2001)Checking Robustness Between Weak Transactional Consistency Models., , and . ESOP, volume 12648 of Lecture Notes in Computer Science, page 87-117. Springer, (2021)Verifying Reachability for TSO Programs with Dynamic Thread Creation., , , , and . NETYS, volume 13464 of Lecture Notes in Computer Science, page 283-300. Springer, (2022)