logo
List of all Publications

[Abdulla and Jonsson, 1993]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Bengt Jonsson (1993).
Verifying Programs with Unreliable Channels.
In: Proc. LICS '93-8th IEEE Int. Symp. on Logic in Computer Science. pp. 160--170.
[Abdulla and Jonsson, 1996]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Bengt Jonsson (1996).
Verifying Programs with Unreliable Channels.
In: Information and Computation, 127(2):91--101.
[Abdulla and Jonsson, 1994]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Bengt Jonsson (1994).
Undecidable Verification Problems for Programs with Unreliable Channels.
In: Abiteboul and Shamir (eds.), Proc. ICALP '94-21st International Colloquium on Automata, Languages, and Programming. Volume 820 of Lecture Notes in Computer Science. pp. 316--327. Published by Springer Verlag.
[Abdulla and Jonsson, 1996]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Bengt Jonsson (1996).
Undecidable Verification Problems for Programs with Unreliable Channels.
In: Information and Computation, 130(1):71--90.
[Abdulla and Kindahl, 1994]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Mats Kindahl (1994).
On decidability of simulation and bisimulation for Lossy Channel Systems.
In: 6th Nordic Workshop on Programming Theory, Aarhus, Denmark. pp. 67--77.
[Abdulla and Kindahl, 1995]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Mats Kindahl (1995).
Decidability of simulation and bisimulation between Lossy Channel Systems and Finite State Systems.
In: Lee and Smolka (eds.), Proc. CONCUR '95-6th Int. Conf. on Concurrency Theory. Volume 962 of Lecture Notes in Computer Science. pp. 333--347. Published by Springer Verlag.
[Abdulla et al., 1996]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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, 1997]
 
Show BibTeX entry
Parosh Aziz Abdulla (1997).
Model Checking through Constraint Solving.
Invited contribution for the Grenoble-Alpe d'Huez European School of Computer Science - Methods and Tools for the Verification of Infinite State Systems.
[Abdulla et al., 2006]
 
Show BibTeX entryDownload Article
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 et al., 1997]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Mats Kindahl and Doron Peled (1997).
An Improved Search Strategy for Lossy Channel Systems.
In: Tadanori Mizuno and Nori Shiratori and Teruo Hegashino and Atsushi Togashi (eds.), FORTE X/PSTV XVII '97. pp. 251--264. Published by Chapman and Hall.
[Abdulla et al., 1997]
 
Show BibTeX entry
Parosh Aziz Abdulla and Bengt Jonsson and Aletta Nylén (1997).
Modelling and Automated Verification of Authentication Protocols.
In: Proceedings of Dimacs workshop on design and formal verification of security protocols.
[Abdulla and Jonsson, 1998]
 
Show BibTeX entryDownload Article
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., 1998]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Ahmed Bouajjani and Bengt Jonsson (1998).
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels.
In: Proc. 10th Int. Conf. on Computer Aided Verification. Volume 1427 of Lecture Notes in Computer Science. pp. 305--318.
[Abdulla et al., 2004]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Aurore Annichini and Ahmed Bouajjani (2004).
Using Forward Reachability Analysis for Verification of Lossy Channel Systems.
In: Formal Methods in System Design, 25(1):39--65.
[Abdulla et al., 1998]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Bengt Jonsson and Mats Kindahl and Doron Peled (1998).
A General Approach to Partial Order Reductions in Symbolic Verification.
In: Proc. 10th Int. Conf. on Computer Aided Verification. Volume 1427 of Lecture Notes in Computer Science. pp. 379--390.
[Abdulla and Cerans, 1998]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Karlis Cerans (1998).
Simulation is Decidable for One-counter Nets.
In: Proc. CONCUR '95-9th Int. Conf. on Concurrency Theory. Volume 1466 of Lecture Notes in Computer Science. pp. 253--268.
[Abdulla and Jonsson, 1999]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Bengt Jonsson (1999).
On the Existence of Network Invariants for Verifying Parameterized Systems.
In: Olderog and Steffen (eds.), Correct System Design -- Recent Insights and Advances. Volume 1710 of Lecture Notes in Computer Science. pp. 180--197. Springer Verlag.
[Abdulla et al., 1999]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Aurore Annichini and Ahmed Bouajjani (1999).
Symbolic Verification of Lossy Channel Systems: An Application to the Bounded Retransmission Protocol.
In: Proc. TACAS '99-5th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems. Volume 1579 of Lecture Notes in Computer Science.
[Kindahl, 1999]
 
Show BibTeX entryVisit the webpage of the author
M. Kindahl (1999).
Verification of Infinite-State Systems: Decision Problems and Efficient Algorithms.
PhD thesis, Dept. of Computer Systems, Uppsala University, Swden.
[Abdulla et al., 1999]
 
Show BibTeX entryDownload Article
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., 1999]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Aurore Annichini and Saddek Bensalem and Ahmed Bouajjani and Peter Habermehl and Yassine Lakhnech (1999).
Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis.
In: Proc. CAV '99-11th Int. Conf. on Computer Aided Verification. Volume 1633 of Lecture Notes in Computer Science. pp. 146--160.
[Abdulla et al., 2004]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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 and Nylén, 2004]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Aletta Nylén (2004).
Better-Structured Transition Systems.
Technical Report Nr. 2004-017. Dept. of Information Technology, Uppsala University, Sweden.
[Abdulla et al., 2000]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Christel Baier and Purushothaman Iyer and Bengt Jonsson (2000).
Reasoning about Probabilistic Lossy Channel Systems.
In: Proc. CONCUR 2000-11th Int. Conf. on Concurrency Theory. Volume 1877 of Lecture Notes in Computer Science. pp. 320--333.
[Abdulla et al., 2005]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Christel Baier and Purushothaman Iyer and Bengt Jonsson (2005).
Simulating Perfect Channels with Probabilistic Lossy Channels.
In: Information and Computation, 197(1-2):22--40.
[Abdulla et al., 2000]
 
Show BibTeX entryDownload Article (pdf-file)
Parosh Aziz Abdulla and Per Bjesse and Niklas Eén (2000).
Symbolic Reachability Analysis Based on SAT Solvers.
In: S. Graf and M. Schwartzbach (eds.), Proc. TACAS '00-6th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems. Volume 1785 of Lecture Notes in Computer Science.
[Abdulla et al., 2000]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Purushothaman Iyer and Aletta Nylén (2000).
Unfoldings of Unbounded Petri Nets.
In: Proc. 12th Int. Conf. on Computer Aided Verification. Volume 1855 of Lecture Notes in Computer Science. pp. 495--507.
[Abdulla and Jonsson, 2000]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Bengt Jonsson (2000).
Model Checking of Infinite-State Systems.
In: Proc. CAV '00-12th Int. Conf. on Computer Aided Verification. Volume 1855 of Lecture Notes in Computer Science. Published by Springer Verlag. Invited Contribution.
[Abdulla et al., 2002]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Bengt Jonsson and Marcus Nilsson and Julien d'Orso and Mayank Saksena (2004).
Regular Model Checking for LTL(MSO).
In: Proc. CAV '04-16th Int. Conf. on Computer Aided Verification. pp. 348--360.
[Abdulla et al., 2004]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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 Nylén, 2002]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Aletta Nylén (2002).
Undecidability of LTL for Timed Petri Nets.
In: INFINITY 2002, 4th International Workshop on Verification of Infinite-State Systems.
[Abdulla et al., 2001]
 
Show BibTeX entry
Parosh Aziz Abdulla and Aletta Nylén and Julien d'Orso (2001).
SAT-Based Analysis of Symbolic Unfoldings.
Technical Report. Department of Information Technology, Uppsala University.
[Abdulla et al., 2001]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Luc Boasson and Ahmed Bouajjani (2001).
Effective Lossy Queue Languages.
In: Proc. ICALP '01-28nd International Colloquium on Automata, Languages, and Programming. Volume 2076 of Lecture Notes in Computer Science. pp. 639--651.
[Abdulla and Jonsson, 2001]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Bengt Jonsson (2001).
Channel Representations in Protocol Verification.
In: Proc. CONCUR 2001-12th Int. Conf. on Concurrency Theory. Volume 2154 of Lecture Notes in Computer Science. pp. 1--15.
[Abdulla and Jonsson, 2001]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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 Nylén, 2002]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Aletta Nylén (2002).
Undecidability of LTL for Timed Petri Nets.
In: Proc. 4th Int. Workshop on Verification of Infinite-State Systems.
[Abdulla and Jonsson, 2003]
 
Show BibTeX entryDownload Article
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 and Rabinovich, 2003]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Alexander Rabinovich (2003).
Verification of Probabilistic Systems with Faulty Communication.
In: Proc. FOSSACS '03, Conf. on Foundations of Software Science and Computation Structures. Volume 2620 of Lecture Notes in Computer Science. pp. 39--53.
[Abdulla et al., 2003]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Ahmed Bouajjani and Juilen d'Orso (2003).
Deciding Monotonic Games.
In: Proc. CSL 2003. Volume 2803 of Lecture Notes in Computer Science. pp. 1--14.
[Abdulla et al., 2004]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and S. Purushothaman Iyer and Aletta Nylén (2004).
SAT-Solving the Coverability Problem for Petri Nets.
In: Formal Methods in System Design, 24(1):25--43.
[Abdulla et al., 2004]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Juilen d'Orso and Ahmed Rezine (2004).
Quantitative Analysis of Infinite Markov Chains.
In: QAPL'04-2nd Workshop on Quantitative Aspects of Programming Languages.
[Abdulla et al., 2004]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Johann Deneux and Ove Akerlund (2004).
Designing Safe, Reliable Systems using Scade.
In: Proc. ISoLA '04-1st International Symposium on Leveraging Applications of Formal Methods.
[Abdulla et al., 2004]
 
Show BibTeX entryDownload Article
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.
[Mahata, 2005]
 
Show BibTeX entryVisit the webpage of the author
P. Mahata (2005).
Model Checking Parameterized Timed Systems.
PhD thesis, Dept. of Information Technology, Uppsala University, Sweden, Uppsala, Sweden.
[Abdulla et al., 2004]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Aurore Collomb-Annichini and Ahmed Bouajjani and Bengt Jonsson (2004).
Using Forward Reachability Analysis for Verification of Lossy Channel Systems.
In: Formal Methods in System Design, 25(1):39--65.
[Abdulla et al., 2005]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Johann Deneux and Joël Ouaknine and James Worrell (2005).
Decidability and Complexity Results for Timed Automata via Channel Machines.
In: Proc. ICALP '05-32nd International Colloquium on Automata, Languages, and Programming. Volume 3580 of Lecture Notes in Computer Science.
[Abdulla et al., 2005]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Noomene Ben Henda and Richard Mayr (2005).
Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property.
In: Proc. LICS '05-21th IEEE Int. Symp. on Logic in Computer Science. pp. 127--136.
[Abdulla et al., 2006]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Noomene Ben Henda and Richard Mayr and Sven Sandberg (2006).
Eager Markov Chains.
In: Proc. ATVA '06-4th Int. Symp. on Automated Technology for Verification and Analysis. Volume 4218 of Lecture Notes in Computer Science. pp. 24--38. Published by Springer Verlag.
[Abdulla et al., 2006]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Noomene Ben Henda and Richard Mayr and Sven Sandberg (2006).
Eager Markov Chains.
Technical Report Nr. 2006-009. Dept. of Information Technology, Uppsala University, Sweden.
[Abdulla et al., 2006]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Noomene Ben Henda and Richard Mayr and Sven Sandberg (2006).
Limiting Behavior of Markov Chains with Eager Attractors.
In: Pedro R. D'Argentio and Andrew Milner and Gerardo Rubino (eds.), Proc. QEST '06-3rd International Conference on the Quantitative Evaluation of SysTems. pp. 253--262.
[Abdulla et al., 2006]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Noomene Ben Henda and Richard Mayr and Sven Sandberg (2006).
Limiting Behavior of Markov Chains with Eager Attractors.
Technical Report Nr. 2006-033. Dep. of Information Technology, Uppsala University, Sweden.
[Abdulla et al., 2005]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Lisa Kaati and Marcus Nilsson (2005).
Minimization of Non-Deterministic Automata with Large Alphabets.
In: Proc. CIAA'05-10th International Conference on Implementation and Application of Automata, .
[Abdulla et al., 2006]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Lisa Kaati and Johanna Högberg (2006).
Bisimulation Minimization of Tree automata.
In: Proc. CIAA'06-11th International Conference on Implementation and Application of Automata, .
[Abdulla et al., 2005]
 
Show BibTeX entryDownload Article
Parosh Aziz Abdulla and Nathalie Bertrand and Alexander Rabinovich and Ph (2005).
Verification of Probabilistic Systems with Faulty Communication.
In: Information and Computation, 202(2):105--228.
[Abdulla, 2005]
 
Show BibTeX entryDownload Article
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., 2006]
 
Show BibTeX entry
Parosh Aziz Abdulla and Christel Baier and Purushothaman Iyer and Bengt Jonsson (2006).
Software Verification: INfinite-State Model Checking and Static Program Analysis.
Dagstuhl seminar series.
[Abdulla et al., 2005]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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.
[Abdulla and Delzanno, 2006]
 
Show BibTeX entry
Parosh Aziz Abdulla and Giorgio Delzanno (2006).
On the Coverability Problem for Constrained Multiset Rewriting.
In: Proc. AVIS'06-5th Int. Workshop on on Automated Verification of Infinite-State Systems.
[Bouajjani et al., 2000]
 
Show BibTeX entryDownload Article
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]
 
Show BibTeX entryDownload Article
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.
[Jonsson and Saksena, 2007]
 
Show BibTeX entry
Bengt Jonsson and Mayank Saksena (2007).
Systematic Acceleration in Regular Model Checking.
In: Proc. CAV '07-19th Int. Conf. on Computer Aided Verification. Lecture Notes in Computer Science. Published by Springer Verlag.