Ahmed Bouajjani

Affiliations:
  • University Paris Diderot (Paris 7)


According to our database1, Ahmed Bouajjani authored at least 147 papers between 1988 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Dynamic Partial Order Reduction for Checking Correctness against Transaction Isolation Levels.
Proc. ACM Program. Lang., 2023

Comparing Causal Convergence Consistency Models.
Proceedings of the Networked Systems - 11th International Conference, 2023

On Verifying Concurrent Programs Under Weakly Consistent Models (Invited Talk).
Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022
Checking causal consistency of distributed databases.
Computing, 2022

Automated Synthesis of Asynchronizations.
Proceedings of the Static Analysis - 29th International Symposium, 2022

Varda: A Framework for Compositional Distributed Programming.
Proceedings of the Networked Systems - 10th International Conference, 2022

Verifying Reachability for TSO Programs with Dynamic Thread Creation.
Proceedings of the Networked Systems - 10th International Conference, 2022

Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

Consistency and Persistency in Program Verification: Challenges and Opportunities.
Proceedings of the Principles of Systems Design, 2022

2021
Deciding reachability under persistent x86-TSO.
Proc. ACM Program. Lang., 2021

Robustness Against Transactional Causal Consistency.
Log. Methods Comput. Sci., 2021

Checking Robustness Between Weak Transactional Consistency Models.
Proceedings of the Programming Languages and Systems, 2021

2020
Formalizing and Checking Multilevel Consistency.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

On the State Reachability Problem for Concurrent Programs Under Power.
Proceedings of the Networked Systems - 8th International Conference, 2020

Boosting Sequential Consistency Checking Using Saturation.
Proceedings of the Automated Technology for Verification and Analysis, 2020

2019
Abstract semantic diffing of evolving concurrent programs.
Formal Methods Syst. Des., 2019

Editorial, special issue of NETYS 2015.
Computing, 2019

Gradual Consistency Checking.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

Checking Robustness Against Snapshot Isolation.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018
Model Checking Procedural Programs.
Proceedings of the Handbook of Model Checking., 2018

A Load-Buffer Semantics for Total Store Ordering.
Log. Methods Comput. Sci., 2018

On reducing linearizability to state reachability.
Inf. Comput., 2018

Replacing Store Buffers by Load Buffers in TSO.
Proceedings of the Verification and Evaluation of Computer and Communication Systems, 2018

On Verifying TSO Robustness for Event-Driven Asynchronous Programs.
Proceedings of the Networked Systems - 6th International Conference, 2018

Verifying Quantitative Temporal Properties of Procedural Programs.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

Reasoning About TSO Programs Using Reduction and Abstraction.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Context-Bounded Analysis for POWER.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

On verifying causal consistency.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Parity Games on Bounded Phase Multi-pushdown Systems.
Proceedings of the Networked Systems - 5th International Conference, 2017

Verification of Asynchronous Programs with Nested Locks.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency.
Proceedings of the Programming Languages and Systems, 2017

Checking Linearizability of Concurrent Priority Queues.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Proving Linearizability Using Forward Simulations.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
2014 CAV award announcement.
Formal Methods Syst. Des., 2016

The Benefits of Duality in Verifying Concurrent Programs under TSO.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Tractable Refinement Checking for Concurrent Objects.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk).
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Lazy TSO Reachability.
Proceedings of the Fundamental Approaches to Software Engineering, 2015

2014
Bounded phase analysis of message-passing programs.
Int. J. Softw. Tools Technol. Transf., 2014

Robustness against Relaxed Memory Models.
Proceedings of the Software Engineering 2014, Fachtagung des GI-Fachbereichs Softwaretechnik, 25. Februar, 2014

Verifying eventual consistency of optimistic replication systems.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

On Bounded Reachability Analysis of Shared Memory Systems.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Context-Bounded Analysis of TSO Systems.
Proceedings of the From Programs to Systems. The Systems perspective in Computing, 2014

2013
Analysis of Recursively Parallel Programs.
ACM Trans. Program. Lang. Syst., 2013

Verifying Concurrent Programs against Sequential Specifications.
Proceedings of the Programming Languages and Systems, 2013

Checking and Enforcing Robustness against TSO.
Proceedings of the Programming Languages and Systems, 2013

2012
Widening techniques for regular tree model checking.
Int. J. Softw. Tools Technol. Transf., 2012

Editorʼs foreword.
J. Comput. Syst. Sci., 2012

Robustness Checking against TSO: Attacks and Defence
CoRR, 2012

Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard
CoRR, 2012

Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

What's Decidable about Weak Memory Models?
Proceedings of the Programming Languages and Systems, 2012

Detecting Fair Non-termination in Multithreaded Programs.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.
Proceedings of the Automated Technology for Verification and Analysis, 2012

Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding.
Proceedings of the Automated Technology for Verification and Analysis, 2012

2011
Programs with lists are counter automata.
Formal Methods Syst. Des., 2011

Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
Log. Methods Comput. Sci., 2011

On Sequentializing Concurrent Programs.
Proceedings of the Static Analysis - 18th International Symposium, 2011

On inter-procedural analysis of programs with lists and data.
Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, 2011

Deciding Robustness against Total Store Ordering.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Getting Rid of Store-Buffers in TSO Analysis.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
On the verification problem for weak memory models.
Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2010

Invariant Synthesis for Programs Manipulating Lists with Unbounded Data.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009
Composed Bisimulation for Tree Automata.
Int. J. Found. Comput. Sci., 2009

A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
Log. Methods Comput. Sci., 2009

A Framework to Handle Linear Temporal Properties in (\omega-)Regular Model Checking
CoRR, 2009

On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems.
Proceedings of the Reachability Problems, 3rd International Workshop, 2009

Rewriting Systems over Nested Data Words.
Proceedings of the Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2009

A Logic-Based Framework for Reasoning about Composite Data Structures.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Monotonic and Downward Closed Games.
J. Log. Comput., 2008

Verification of parametric concurrent systems with prioritised FIFO resource management.
Formal Methods Syst. Des., 2008

Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata.
Proceedings of the Implementation and Applications of Automata, 2008

SDSIrep: A Reputation System Based on SDSI.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Computing Simulations over Tree Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Analyzing Asynchronous Programs with Preemption.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Shape Analysis via Monotonic Abstraction.
Proceedings of the Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04., 2008

On the Reachability Analysis of Acyclic Networks of Pushdown Systems.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Monotonic Abstraction for Programs with Dynamic Memory Heaps.
Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007
A logic of reachable patterns in linked data-structures.
J. Log. Algebraic Methods Program., 2007

Permutation rewriting and algorithmic verification.
Inf. Comput., 2007

A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

Rewriting Systems with Data.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

2006
Parametric Verification of a Group Membership Algorithm.
Theory Pract. Log. Program., 2006

On Symbolic Verification of Weakly Extended PAD.
Proceedings of the 13th International Workshop on Expressiveness in Concurrency, 2006

Abstract Regular Tree Model Checking of Complex Dynamic Data Structures.
Proceedings of the Static Analysis, 13th International Symposium, 2006

Rewriting Models of Boolean Programs.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

Reachability analysis of multithreaded software with asynchronous communication.
Proceedings of the Software Verification: Infinite-State Model Checking and Static Program Analysis, 19.02., 2006

06081 Abstracts Collection -- Software Verification: Infinite-State Model Checking and Static Program Analysis.
Proceedings of the Software Verification: Infinite-State Model Checking and Static Program Analysis, 19.02., 2006

06081 Executive Summary -- Software Verification: Infinite-State Model Checking and Static Program Analysis.
Proceedings of the Software Verification: Infinite-State Model Checking and Static Program Analysis, 19.02., 2006

2005
Checking Timed Büchi Automata Emptiness Efficiently.
Formal Methods Syst. Des., 2005

Abstract Regular Tree Model Checking.
Proceedings of the 7th International Workshop on Verification of Infinite-State Systems, 2005

Regular Model Checking for Programs with Dynamic Memory.
Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005

Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

On Computing Reachability Sets of Process Rewrite Systems.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Using Forward Reachability Analysis for Verification of Lossy Channel Systems.
Formal Methods Syst. Des., 2004

Handling Liveness Properties in (<i>omega</i>-)Regular Model Checking.
Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, 2004

Reachability Analysis of Synchronized PA Systems.
Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, 2004

Symbolic Reachability Analysis of Higher-Order Context-Free Processes.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Abstract Regular Model Checking.
Proceedings of the Computer Aided Verification, 16th International Conference, 2004

2003
Automatic verification of recursive procedures with one integer parameter.
Theor. Comput. Sci., 2003

A Generic Approach to the Static Analysis of Concurrent Programs with Procedures.
Int. J. Found. Comput. Sci., 2003

Reachability Analysis of Process Rewrite Systems.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Verification of Infinite State Systems (Tutorial).
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

Deciding Monotonic Games.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management.
Proceedings of the CONCUR 2003, 2003

2002
Extrapolating Tree Transformations.
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2001
Preface.
Theor. Comput. Sci., 2001

Analyzing Fair Parametric Extended Automata.
Proceedings of the Static Analysis, 8th International Symposium, 2001

Perturbed Turing Machines and Hybrid Systems.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

Languages, Rewriting Systems, and Verification of Infinite-State Systems.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Effective Lossy Queue Languages.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

TReX: A Tool for Reachability Analysis of Complex Systems.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001

2000
An efficient automata approach to some problems on context-free grammars.
Inf. Process. Lett., 2000

Regular Model Checking.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations.
Theor. Comput. Sci., 1999

Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1999

Model Checking Lossy Vector Addition Systems.
Proceedings of the STACS 99, 1999

Handling Global Conditions in Parameterized System Verification.
Proceedings of the Computer Aided Verification, 11th International Conference, 1999

Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis.
Proceedings of the Computer Aided Verification, 11th International Conference, 1999

1998
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1997
On-the-fly symbolic model checking for real-time systems.
Proceedings of the 18th IEEE Real-Time Systems Symposium (RTSS '97), 1997

Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Reachability Analysis of Pushdown Automata: Application to Model-Checking.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996
Model-Checking for Extended Timed Temporal Logics.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

Constrained Properties, Semilinear Systems, and Petri Nets.
Proceedings of the CONCUR '96, 1996

1995
Property Preserving Abstractions for the Verification of Concurrent Systems.
Formal Methods Syst. Des., 1995

Verifying Infinite State Processes with Sequential and Parallel Composition.
Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995

On the Verification Problem of Nonregular Properties for Nonregular Processes
Proceedings of the Proceedings, 1995

Logics vs. Automata: The Hybrid Case.
Proceedings of the Hybrid Systems III: Verification and Control, 1995

Temporal Logic + Timed Automata: Expressiveness and Decidability.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

Verifying omega-Regular Properties for a Subclass of Linear Hybrid Systems.
Proceedings of the Computer Aided Verification, 1995

From Duration Calculus To Linear Hybrid Automata.
Proceedings of the Computer Aided Verification, 1995

1994
On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures.
Proceedings of the Hybrid Systems II, 1994

Verfying Invariance Properties of Timed Systems with Duration Variables.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, Third International Symposium Organized Jointly with the Working Group Provably Correct Systems, 1994

Verification of Nonregular Temporal Properties for Context-Free Processes.
Proceedings of the CONCUR '94, 1994

Verification of Context-Free Timed Systems Using Linear Hybrid Observers.
Proceedings of the Computer Aided Verification, 6th International Conference, 1994

1993
On Model Checking for Real-Time Properties with Durations
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

1992
Minimal State Graph Generation.
Sci. Comput. Program., 1992

Property Preserving Simulations.
Proceedings of the Computer Aided Verification, Fourth International Workshop, 1992

1991
Verification for Finite Systems (Extended Abstract).
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

Safety for Branching Time Semantics.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Minimal Model Generation.
Proceedings of the Computer Aided Verification, 2nd International Workshop, 1990

1988
A logig for the description of behaviours and properties of concurrent systems.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988


  Loading...