Mohamed Faouzi Atig

According to our database1, Mohamed Faouzi Atig
  • authored at least 74 papers between 2008 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
What is Decidable about Perfect Timed Channels?
CoRR, 2017

On the Upward/Downward Closures of Petri Nets.
CoRR, 2017

Context-Bounded Analysis for POWER.
CoRR, 2017

The Benefits of Duality in Verifying Concurrent Programs under TSO.
CoRR, 2017

Stateless model checking for TSO and PSO.
Acta Inf., 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

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

2016
Complexity of regular abstractions of one-counter languages.
CoRR, 2016

Mending Fences with Self-Invalidation and Self-Downgrade.
CoRR, 2016

Stateless Model Checking for POWER.
CoRR, 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
Stateless Model Checking for TSO and PSO.
CoRR, 2015

Stateless Model Checking for TSO and PSO.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 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 in System Design, 2014

Infinite-State Energy Games.
CoRR, 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

Adjacent Ordered Multi-Pushdown Systems.
Proceedings of the Developments in Language Theory - 17th International Conference, 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
Logical Methods in Computer Science, 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
Logical Methods in Computer Science, 2011

Approximating Petri Net Reachability Along Context-free Traces
CoRR, 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
Verifying Parallel Programs with Dynamic Communication Structures.
Proceedings of the Implementation and Application of Automata, 2009

Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2009

On Yen's Path Logic for Petri Nets.
Proceedings of the Reachability Problems, 3rd International Workshop, 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...