Ahmed Bouajjani

From MaRDI portal
Person:537949

Available identifiers

zbMath Open bouajjani.ahmedMaRDI QIDQ537949

List of research outcomes





PublicationDate of PublicationType
Gradual consistency checking2024-02-16Paper
Checking robustness against snapshot isolation2024-02-16Paper
Automated synthesis of asynchronizations2023-07-28Paper
Constrained properties, semilinear systems, and Petri nets2023-06-28Paper
Reachability analysis of pushdown automata: Application to model-checking2023-05-17Paper
Reasoning about TSO programs using reduction and abstraction2023-05-05Paper
On the completeness of verifying message passing programs under bounded asynchrony2023-05-05Paper
Robustness Against Transactional Causal Consistency.2023-02-03Paper
Boosting Sequential Consistency Checking Using Saturation2022-12-22Paper
Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes2022-12-07Paper
Checking causal consistency of distributed databases2022-09-27Paper
Proving linearizability using forward simulations2022-08-12Paper
Checking robustness between weak transactional consistency models2021-10-18Paper
Verifying quantitative temporal properties of procedural programs2021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q58564162021-03-26Paper
Verification of Asynchronous Programs with Nested Locks2020-11-25Paper
Formalizing and checking multilevel consistency2020-08-05Paper
https://portal.mardi4nfdi.de/entity/Q51116292020-05-27Paper
Abstract Semantic Diffing of Evolving Concurrent Programs2019-09-16Paper
Abstract semantic diffing of evolving concurrent programs2019-09-04Paper
Model Checking Procedural Programs2018-07-20Paper
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations2018-07-04Paper
On reducing linearizability to state reachability2018-06-14Paper
The Benefits of Duality in Verifying Concurrent Programs under TSO2018-03-21Paper
https://portal.mardi4nfdi.de/entity/Q31305502018-01-23Paper
On verifying causal consistency2017-10-20Paper
Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency2017-05-19Paper
https://portal.mardi4nfdi.de/entity/Q29785512017-04-25Paper
Tractable refinement checking for concurrent objects2016-09-29Paper
On reducing linearizability to state reachability2015-11-04Paper
A generic approach to the static analysis of concurrent programs with procedures2015-09-11Paper
Analysis of recursively parallel programs2015-09-11Paper
On the verification problem for weak memory models2015-06-11Paper
Context-Bounded Analysis of TSO Systems2014-07-24Paper
Verifying eventual consistency of optimistic replication systems2014-04-10Paper
On symbolic verification of weakly extended PAD2013-12-13Paper
Abstract regular tree model checking2013-10-07Paper
Handling liveness properties in (\(\omega\)-)regular model checking2013-10-02Paper
Reachability analysis of synchronized PA systems2013-10-02Paper
Checking and Enforcing Robustness against TSO2013-08-05Paper
Verifying Concurrent Programs against Sequential Specifications2013-08-05Paper
Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data2012-11-21Paper
Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding2012-11-21Paper
Analyzing Asynchronous Programs with Preemption2012-10-19Paper
Rewriting systems over nested data words2012-09-28Paper
Bounded Phase Analysis of Message-Passing Programs2012-06-29Paper
What’s Decidable about Weak Memory Models?2012-06-22Paper
Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data2012-06-15Paper
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads2012-04-02Paper
Deciding Robustness against Total Store Ordering2011-07-07Paper
Programs with lists are counter automata2011-05-23Paper
Parametric verification of a group membership algorithm2011-04-08Paper
Verification of parametric concurrent systems with prioritized FIFO resource management.2010-03-30Paper
A Logic-Based Framework for Reasoning about Composite Data Structures2009-10-22Paper
COMPOSED BISIMULATION FOR TREE AUTOMATA2009-08-21Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science2009-08-06Paper
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes2009-06-30Paper
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads2009-03-31Paper
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures2009-03-12Paper
Composed Bisimulation for Tree Automata2009-02-12Paper
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata2009-02-12Paper
On the Reachability Analysis of Acyclic Networks of Pushdown Systems2008-11-25Paper
Rewriting Models of Boolean Programs2008-09-25Paper
Monotonic Abstraction for Programs with Dynamic Memory Heaps2008-07-15Paper
An efficient automata approach to some problems on context-free grammars.2008-06-27Paper
Computing Simulations over Tree Automata2008-04-11Paper
Verification of parametric concurrent systems with prioritised FIFO resource management2008-04-11Paper
Monotonic and Downward Closed Games2008-03-12Paper
Rewriting Systems with Data2008-02-26Paper
Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures2007-11-29Paper
Programs with Lists Are Counter Automata2007-09-05Paper
A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes2007-09-03Paper
A logic of reachable patterns in linked data-structures2007-08-23Paper
Computer Science Logic2007-06-21Paper
Computer Science Logic2007-06-21Paper
Foundations of Software Science and Computation Structures2007-05-02Paper
Permutation rewriting and algorithmic verification2007-02-20Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science2006-11-14Paper
CONCUR 2005 – Concurrency Theory2006-11-01Paper
Parametric Verification of a Group Membership Algorithm2006-07-14Paper
Checking timed Büchi automata emptiness efficiently2006-02-20Paper
Term Rewriting and Applications2005-11-11Paper
Tools and Algorithms for the Construction and Analysis of Systems2005-11-10Paper
A Generic Approach to the Static Analysis of Concurrent Programs with Procedures2005-10-19Paper
Computer Aided Verification2005-08-25Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science2005-08-12Paper
https://portal.mardi4nfdi.de/entity/Q48175392004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q48175402004-09-24Paper
Using forward reachability analysis for verification of lossy channel systems2004-09-09Paper
Automatic verification of recursive procedures with one integer parameter.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q48049242003-05-01Paper
https://portal.mardi4nfdi.de/entity/Q47791182003-02-25Paper
https://portal.mardi4nfdi.de/entity/Q47854602003-01-01Paper
https://portal.mardi4nfdi.de/entity/Q45511652002-09-04Paper
https://portal.mardi4nfdi.de/entity/Q45350532002-06-12Paper
https://portal.mardi4nfdi.de/entity/Q45350072002-06-12Paper
https://portal.mardi4nfdi.de/entity/Q27541022001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q27541042001-11-11Paper
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations2000-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42510601999-11-29Paper
Property preserving abstractions for the verification of concurrent systems1995-04-10Paper
https://portal.mardi4nfdi.de/entity/Q40373841993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40370921993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q47333831989-01-01Paper

Research outcomes over time

This page was built for person: Ahmed Bouajjani