|
Search the dblp DataBase
Tayssir Touili:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson, Tayssir Touili
Regular Model Checking. [Citation Graph (0, 0)][DBLP] CAV, 2000, pp:403-418 [Conf]
- Ahmed Bouajjani, Tayssir Touili
Extrapolating Tree Transformations. [Citation Graph (0, 0)][DBLP] CAV, 2002, pp:539-554 [Conf]
- Ahmed Bouajjani, Markus Müller-Olm, Tayssir Touili
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. [Citation Graph (0, 0)][DBLP] CONCUR, 2005, pp:473-487 [Conf]
- Edmund M. Clarke, Muralidhar Talupur, Tayssir Touili, Helmut Veith
Verification by Network Decomposition. [Citation Graph (0, 0)][DBLP] CONCUR, 2004, pp:276-291 [Conf]
- Ahmed Bouajjani, Tayssir Touili
Reachability Analysis of Process Rewrite Systems. [Citation Graph (0, 0)][DBLP] FSTTCS, 2003, pp:74-87 [Conf]
- Sagar Chaki, Edmund M. Clarke, Orna Grumberg, Joël Ouaknine, Natasha Sharygina, Tayssir Touili, Helmut Veith
State/Event Software Verification for Branching-Time Specifications. [Citation Graph (0, 0)][DBLP] IFM, 2005, pp:53-69 [Conf]
- Ahmed Bouajjani, Anca Muscholl, Tayssir Touili
Permutation Rewriting and Algorithmic Verification. [Citation Graph (0, 0)][DBLP] LICS, 2001, pp:- [Conf]
- Ahmed Bouajjani, Javier Esparza, Tayssir Touili
A generic approach to the static analysis of concurrent programs with procedures. [Citation Graph (0, 0)][DBLP] POPL, 2003, pp:62-73 [Conf]
- Ahmed Bouajjani, Tayssir Touili
On Computing Reachability Sets of Process Rewrite Systems. [Citation Graph (0, 0)][DBLP] RTA, 2005, pp:484-499 [Conf]
- Sagar Chaki, Edmund M. Clarke, Nicholas Kidd, Thomas W. Reps, Tayssir Touili
Verifying Concurrent Message-Passing C Programs with Recursive Calls. [Citation Graph (0, 0)][DBLP] TACAS, 2006, pp:334-349 [Conf]
- Tayssir Touili
Dealing with Communication for Dynamic Multithreaded Recursive Programs. [Citation Graph (0, 0)][DBLP] VISSAS, 2005, pp:213-227 [Conf]
- Ahmed Bouajjani, Javier Esparza, Tayssir Touili
Reachability Analysis of Synchronized PA Systems. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:153-178 [Journal]
- Tayssir Touili
Regular Model Checking using Widening Techniques. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2001, v:50, n:4, pp:- [Journal]
- Ahmed Bouajjani, Anca Muscholl, Tayssir Touili
Permutation rewriting and algorithmic verification. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:2, pp:199-224 [Journal]
- Ahmed Bouajjani, Javier Esparza, Tayssir Touili
A Generic Approach to the Static Analysis of Concurrent Programs with Procedures. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2003, v:14, n:4, pp:551-0 [Journal]
- Gaël Patin, Mihaela Sighireanu, Tayssir Touili
Spade: Verification of Multithreaded Dynamic and Recursive Programs. [Citation Graph (0, 0)][DBLP] CAV, 2007, pp:254-257 [Conf]
- Akash Lal, Nicholas Kidd, Thomas W. Reps, Tayssir Touili
Abstract Error Projection. [Citation Graph (0, 0)][DBLP] SAS, 2007, pp:200-217 [Conf]
- Eugene Asarin, Thierry Cachat, Alexander Seliverstov, Tayssir Touili, Vassily A. Lyubetsky
Attenuation Regulation as a Term Rewriting System. [Citation Graph (0, 0)][DBLP] AB, 2007, pp:81-94 [Conf]
- Ahmed Bouajjani, Jan Strejcek, Tayssir Touili
On Symbolic Verification of Weakly Extended PAD. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:175, n:3, pp:47-64 [Journal]
On the Reachability Analysis of Acyclic Networks of Pushdown Systems. [Citation Graph (, )][DBLP]
Analyzing Asynchronous Programs with Preemption. [Citation Graph (, )][DBLP]
Constrained Reachability of Process Rewrite Systems. [Citation Graph (, )][DBLP]
Regular Hedge Model Checking. [Citation Graph (, )][DBLP]
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks. [Citation Graph (, )][DBLP]
Interprocedural Analysis of Concurrent Programs Under a Context Bound. [Citation Graph (, )][DBLP]
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. [Citation Graph (, )][DBLP]
Verifying Parallel Programs with Dynamic Communication Structures. [Citation Graph (, )][DBLP]
Verifying Multithreaded Recursive Programs with Integer Variables. [Citation Graph (, )][DBLP]
Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism. [Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs
|