Parameterized Systems
|
Parameterized Systems |
[Abdulla et al., 1996] 
|
Parosh Aziz Abdulla and Karlis Cerans and Bengt Jonsson and Yih-Kuen Tsay (1996). General Decidability Theorems for Infinite-State Systems. In: Proc. LICS '96-11th IEEE Int. Symp. on Logic in Computer Science. pp. 313--321. |
| [Abdulla et al., 2000]
|
Parosh Aziz Abdulla and Karlis Cerans and Bengt Jonsson and Yih-Kuen Tsay (2000). Algorithmic Analysis of Programs with Well Quasi-Ordered Domains. In: Information and Computation, 160:109--127. |
| [Abdulla et al., 2006]
|
Parosh Aziz Abdulla and Bengt Jonsson and Ahmed Rezine and Mayank Saksena (2006). Proving Liveness by Backwards Reachability.. In: Proc. CONCUR '06-17th Int. Conf. on Concurrency Theory. pp. 95--109. |
| [Abdulla and Jonsson, 1998]
|
Parosh Aziz Abdulla and Bengt Jonsson (1998). Verifying Networks of Timed Processes. In: Bernhard Steffen (ed.), Proc. TACAS '98-4th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems. Volume 1384 of Lecture Notes in Computer Science. pp. 298--312. |
| [Abdulla et al., 1999]
|
Parosh Aziz Abdulla and Ahmed Bouajjani and Bengt Jonsson and Marcus Nilsson (1999). Handling Global Conditions in Parameterized System Verification. In: Proc. CAV '99-11th Int. Conf. on Computer Aided Verification. Volume 1633 of Lecture Notes in Computer Science. pp. 134--145. |
| [Abdulla et al., 2004]
|
Parosh Aziz Abdulla and Johann Deneux and Pritha Mahata and Aletta Nylén (2004). Downward Closed Language Generators. Technical Report. Dept. of Information Technology, Uppsala University, Sweden. |
| [Abdulla et al., 2003]
|
Parosh Aziz Abdulla and Johann Deneux and Pritha Mahata and Aletta Nylén (2003). Forward Reachability Analysis of Timed Petri Nets. Technical Report Nr. 2003-056. Dept. of Information Technology, Uppsala University, Sweden. |
| [Abdulla et al., 2002]
|
Parosh Aziz Abdulla and Bengt Jonsson and Marcus Nilsson and Julien d'Orso (2002). Regular Model Checking Made Simple and Efficient. In: Proc. CONCUR 2000-12th Int. Conf. on Concurrency Theory. Volume 2421 of Lecture Notes in Computer Science. pp. 116--130. |
| [Abdulla et al., 2003]
|
Parosh Aziz Abdulla and Bengt Jonsson and Marcus Nilsson and Julien d'Orso (2003). Algorithmic Improvements in Regular Model Checking.. In: Proc. CAV '03-15th Int. Conf. on Computer Aided Verification. Volume 2725 of Lecture Notes in Computer Science. pp. 236--248. |
| [Abdulla et al., 2004]
|
Parosh Aziz Abdulla and Bengt Jonsson and Marcus Nilsson and Julien d'Orso and Mayank Saksena (2004). Regular Model Checking for S1S + LTL. In: Proc. CAV '04-16th Int. Conf. on Computer Aided Verification. Lecture Notes in Computer Science. Boston, pp. 348--360. Published by Springer Verlag. |
| [Abdulla et al., 2005]
|
Parosh Aziz Abdulla and Axel Legay and Julien d'Orso and Ahmed Rezine (2005). Simulation-Based Iteration of Tree Transducers. In: Proc. TACAS '05-11th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems. Volume 3440 of Lecture Notes in Computer Science. |
| [Abdulla et al., 2006]
|
Parosh Aziz Abdulla and Axel Legay and Julien d'Orso and Ahmed Rezine (2006). Tree Regular Model Checking: A Simulation-based Approach.. In: The Journal of Logic and Algebraic Programming, . To appear. |
| [Abdulla et al., 2004]
|
Parosh Aziz Abdulla and Bengt Jonsson and Marcus Nilsson and Mayank Saksena (2004). A Survey of Regular Model Checking. In: Proc. CONCUR 2004-15th Int. Conf. on Concurrency Theory. Volume 3170 of Lecture Notes in Computer Science. pp. 348--360. |
| [Abdulla et al., 2002]
|
Parosh Aziz Abdulla and Bengt Jonsson and Pritha Mahata and Julien d'Orso (2002). Regular Tree Model Checking. In: Proc. CAV '02-14th Int. Conf. on Computer Aided Verification. Volume 2404 of Lecture Notes in Computer Science. |
| [Abdulla et al., 2000]
|
Parosh Aziz Abdulla and Purushothaman Iyer and Aletta Nylén (2000). SAT-solving the Coverability Problem for Unbounded Petri Net. Technical Report. Dept. of Information Technology, Uppsala University, Sweden. |
| [Abdulla and Nylén, 2000]
|
Parosh Aziz Abdulla and Aletta Nylén (2000). Better is Better than Well: On Efficient Verification of Infinite-State Systems. In: Proc. LICS '00-15th IEEE Int. Symp. on Logic in Computer Science. pp. 132--140. |
| [Abdulla and Nylén, 2001]
|
Parosh Aziz Abdulla and Aletta Nylén (2001). Timed Petri Nets and BQOs. In: Proc. ICATPN'2001: 22nd Int. Conf. on application and theory of Petri nets. Volume 2075 of Lecture Notes in Computer Science. pp. 53--70. |
| [Abdulla and Jonsson, 2001]
|
Parosh Aziz Abdulla and Bengt Jonsson (2001). Ensuring Completeness of Symbolic Verification Methods for Infinite-State Systems. In: Theoretical Computer Science, 256:145--167. |
| [Abdulla and Jonsson, 2001]
|
Parosh Aziz Abdulla and Bengt Jonsson (2001). Verification of parametrized (timed) systems using (timed) Petri nets. Invited Contribution for VEPAS'01, Workshop on Verification of Parametrized Systems. |
| [Abdulla and Jonsson, 2003]
|
Parosh Aziz Abdulla and Bengt Jonsson (2003). Model checking of systems with many identical timed processes. In: Theoretical Computer Science, 290(1):241--264. |
| [Abdulla et al., 2004]
|
Parosh Aziz Abdulla and Johann Deneux and Pritha Mahata (2004). Multi-Clock Timed Networks. In: Proc. LICS '04-20th IEEE Int. Symp. on Logic in Computer Science. pp. 345--354. |
| [Abdulla et al., 2004]
|
Parosh Aziz Abdulla and Johann Deneux and Pritha Mahata (2004). Open, Closed and Robust Timed Networks. In: Proc. INFINITY '04-6th International Workshop on Verification of Infinite-State Systems. |
| [Abdulla et al., 2004]
|
P. A. Abdulla and J. Deneux and P. Mahata and A. Nylén (2004). Forward Reachability Analysis of Timed Petri Nets. In: Proc. FORMATS-FTRTFT '04. Volume 3253 of Lecture Notes in Computer Science. pp. 343--362. |
| [Abdulla et al., 2004]
|
Parosh Aziz Abdulla and Pritha Mahata and Richard Mayr (2004). Zenoness, Token-Liveness and Boundedness for Timed Petri Nets. In: Proc. FSTTCS '04-24-th Conf. on Foundations of Software Technology and Theoretical Computer Science. Volume 3328 of Lecture Notes in Computer Science. pp. 59--71. |
| [Abdulla, 2005]
|
Parosh Aziz Abdulla (2005). Verification of Parameterized Timed Systems. In: Proc. FORMATS'05, International Conference on Formal Modelling and Analysis of Timed Systems. |
| [Abdulla et al., 2005]
|
P. A. Abdulla and A. Legay and J. d'Orso and A. Rezine (2005). Tree Regular Model Checking: A Simulation-Based Approach. Technical Report Nr. 42. Centre Federe en Verification. available at http://www.montefiore.ulg.ac.be/\~legay/papers/paper-tree.ps. |
| [Abdulla et al., 2006]
|
Parosh Aziz Abdulla and Noomene Ben Henda and Giorgio Delzanno and Ahmed Rezine (2006). Regular Model Checking without Transducers (On Efficient Verification of Parameterized Systems). Technical Report Nr. 2006-052. Dept. of Information Technology, Uppsala University, Sweden. |
| [Abdulla et al., 2007]
|
Parosh Aziz Abdulla and Noomene Ben Henda and Giorgio Delzanno and Ahmed Rezine (2007). Regular Model Checking without Transducers (On Efficient Verification of Parameterized Systems). In: Proc. TACAS '07-13th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems. |
| [Bouajjani et al., 2000]
|
Ahmed Bouajjani and Bengt Jonsson and Marcus Nilsson and Tayssir Touili (2000). Regular Model Checking.. In: Proc. CAV '00-12th Int. Conf. on Computer Aided Verification. pp. 403--418. |
| [Jonsson and Nilsson, 2000]
|
Bengt Jonsson and Marcus Nilsson (2000). Transitive Closures of Regular Relations for Verifying Infinite-State Systems.. In: Proc. TACAS '00-6th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems. pp. 220--234. |