Mohamed Faouzi Atig

According to our database1, Mohamed Faouzi Atig authored at least 102 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Verification under TSO with an infinite Data Domain.
CoRR, 2024

2023
Chain-Free String Constraints (Technical Report).
CoRR, 2023

Overcoming Memory Weakness with Unified Fairness.
CoRR, 2023

Optimal Stateless Model Checking for Causal Consistency.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Parameterized Verification under TSO with Data Types.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Overcoming Memory Weakness with Unified Fairness - Systematic Verification of Liveness in Weak Memory Models.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs.
Proceedings of the Automated Technology for Verification and Analysis, 2023

2022
Optimal SMC for Transactional Programs.
CoRR, 2022

The Computing Journal gratefully acknowledges the editorial work of the scientists listed below on the special issue entitled "S.I. : NETYS 2019".
Computing, 2022

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

Probabilistic Total Store Ordering.
Proceedings of the Programming Languages and Systems, 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

The Decidability of Verification under PS 2.0.
Proceedings of the Programming Languages and Systems, 2021

Solving Not-Substring Constraint withFlat Abstraction.
Proceedings of the Programming Languages and Systems - 19th Asian Symposium, 2021

2020
What is decidable under the TSO memory model?
ACM SIGLOG News, 2020

Parameterized verification under TSO is PSPACE-complete.
Proc. ACM Program. Lang., 2020

Preface to the VECoS 2018 special issue of ISSE.
Innov. Syst. Softw. Eng., 2020

The Decidability of Verification under Promising 2.0.
CoRR, 2020

Efficient handling of string-number conversion.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

On the Formalization of Decentralized Contact Tracing Protocols.
Proceedings of the 2nd Workshop on Artificial Intelligence and Formal Verification, 2020

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

On the Separability Problem of String Constraints.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

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

2019
Optimal stateless model checking for reads-from equivalence under sequential consistency.
Proc. ACM Program. Lang., 2019

Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Verification of programs under the release-acquire semantics.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial).
Proceedings of the Networked Systems - 7th International Conference, 2019

Chain-Free String Constraints.
Proceedings of the Automated Technology for Verification and Analysis, 2019

2018
Optimal stateless model checking under the release-acquire semantics.
Proc. ACM Program. Lang., 2018

Mending Fences with Self-Invalidation and Self-Downgrade.
Log. Methods Comput. Sci., 2018

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

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

Verification of Timed Asynchronous Programs.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Perfect Timed Communication Is Hard.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2018

Trau: SMT solver for string constraints.
Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018

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

Universal Safety for Timed Petri Nets is PSPACE-complete.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

Complexity of Reachability for Data-Aware Dynamic Systems.
Proceedings of the 18th International Conference on Application of Concurrency to System Design, 2018

2017
Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete.
Int. J. Found. Comput. Sci., 2017

What is Decidable about Perfect Timed Channels?
CoRR, 2017

Stateless model checking for TSO and PSO.
Acta Informatica, 2017

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

Flatten and conquer: a framework for efficient analysis of string constraints.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

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

On the Upward/Downward Closures of Petri Nets.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 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

Data Multi-Pushdown Automata.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Recency-Bounded Verification of Dynamic Database-Driven Systems (Extended Version).
CoRR, 2016

Acceleration in Multi-PushDown Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Recency-Bounded Verification of Dynamic Database-Driven Systems.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

The complexity of regular abstractions of one-counter languages.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Data Communicating Processes with Unreliable Channels.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Fencing Programs with Self-Invalidation and Self-Downgrade.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2016

Counter-Example Guided Program Verification.
Proceedings of the FM 2016: Formal Methods, 2016

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

Stateless Model Checking for POWER.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Precise and Sound Automatic Fence Insertion Procedure under PSO.
Proceedings of the Networked Systems - Third International Conference, 2015

Verification of Buffered Dynamic Register Automata.
Proceedings of the Networked Systems - Third International Conference, 2015

What's Decidable about Availability Languages?.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Verification of Cache Coherence Protocols wrt. Trace Filters.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO.
Proceedings of the Programming Languages and Systems, 2015

Norn: An SMT Solver for String Constraints.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
Adjacent Ordered Multi-Pushdown Systems.
Int. J. Found. Comput. Sci., 2014

Budget-bounded model-checking pushdown systems.
Formal Methods Syst. Des., 2014

Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata.
Proceedings of the Language and Automata Theory and Applications, 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

Verification of Dynamic Register Automata.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

MPass: An Efficient Tool for the Analysis of Message-Passing Programs.
Proceedings of the Formal Aspects of Component Software - 11th International Symposium, 2014

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

Infinite-state energy games.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

String Constraints for Verification.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Activity profiles in online social media.
Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2014

2013
Zenoness for Timed Pushdown Automata.
Proceedings of the Proceedings 15th International Workshop on Verification of Infinite-State Systems, 2013

Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Push-Down Automata with Gap-Order Constraints.
Proceedings of the Fundamentals of Software Engineering - 5th International Conference, 2013

Verification of Directed Acyclic Ad Hoc Networks.
Proceedings of the Formal Techniques for Distributed Systems, 2013

Analysis of Message Passing Programs Using SMT-Solvers.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2012
Adding Time to Pushdown Automata
Proceedings of the Proceedings Quantities in Formal Methods, 2012

Model-Checking of Ordered Multi-Pushdown Automata
Log. Methods Comput. Sci., 2012

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

Counter-Example Guided Fence Insertion under TSO.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Automatic Fence Insertion in Integer Programs via Predicate Abstraction.
Proceedings of the Static Analysis - 19th International Symposium, 2012

Dense-Timed Pushdown Automata.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems.
Proceedings of the Language and Automata Theory and Applications, 2012

Timed Lossy Channel Systems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Multi-pushdown systems with budgets.
Proceedings of the Formal Methods in Computer-Aided Design, 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

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

2011
On Yen's Path Logic for Petri Nets.
Int. J. Found. Comput. Sci., 2011

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

Approximating Petri Net Reachability Along Context-free Traces.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

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

2010
Verifying parallel programs with dynamic communication structures.
Theor. Comput. Sci., 2010

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

Global Model Checking of Ordered Multi-Pushdown Systems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

From Multi to Single Stack Automata.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

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

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

Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

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


  Loading...