- Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008. Editors: R. Hariharan, M. Mukund, V. Vinay; pp
- Bounded Communication Reachability Analysis of Process Rewrite Systems with
- Theoretical Computer Science 411 (2010) 34603468 Contents lists available at ScienceDirect
- On Computing Reachability Sets of Process Rewrite Systems
- Lecture Notes in Computer Science 6174 Commenced Publication in 1973
- Interprocedural Analysis of Concurrent Programs Under a Context Bound #
- Regular Hedge Model Checking Julien d'Orso 1 and Tayssir Touili 2
- Abstract Error Projection Akash Lal 1 , Nicholas Kidd 1 , Thomas Reps 1 , and Tayssir Touili 2
- Verifying Parallel Programs with Dynamic Communication Structures
- M'emoire de DEA V'erification de r'eseaux param'etr'es bas'ee sur des
- EXPRESS 2006 On Symbolic Verification of
- Reachability Analysis of Process Rewrite Systems ? Ahmed Bouajjani and Tayssir Touili
- Electronic Notes in Theoretical Computer Science 50 No. 4 (2001) URL: http://www.elsevier.nl/locate/entcs/volume50.html 16 pages
- Regular Model Checking Ahmed Bouajjani 1 , Bengt Jonsson 2 , Marcus Nilsson ?2 , and Tayssir Touili 1
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems #
- Permutation Rewriting and Algorithmic Verification # Ahmed Bouajjani, Anca Muscholl, and Tayssir Touili
- Verification by Network Decomposition # Edmund Clarke 1 , Muralidhar Talupur 1 , Tayssir Touili 1 , and Helmut Veith 2
- Permutation Rewriting and Algorithmic Veri cation Ahmed Bouajjani Anca Muscholl Tayssir Touili
- Bounded Communication Reachability Analysis of Process Rewrite Systems with
- UNIVERSIT E PARIS 7 DENIS DIDEROT
- SPADE: Verification of Multithreaded Dynamic and Recursive Programs #
- Extrapolating Tree Transformations # Ahmed Bouajjani and Tayssir Touili
- Consent to Publish Lecture Notes in Computer Science 123
- Constrained Reachability of Process Rewrite Tayssir Touili
- Book Editors IOS Press, 2003
- Widening Techniques for Regular Model Tayssir Touili
- Antichainbased Universality and Inclusion Testing over Nondeterministic Finite Tree Automata #
- Computing Transitive Closures of Hedge Transformations
- Verifying Multithreaded Recursive Programs with Integer Variables
- Attenuation Regulation as a Term Rewriting System #
- Verifying Multithreaded Recursive Programs with Integer Variables
- A Decision Procedure for Detecting Atomicity Violations
- Efficient CTL Model-Checking for Pushdown Systems Fu Song and Tayssir Touili
