Volume 239, July 2009

Joint Proceedings of the 8th, 9th, and 10th International Workshops on Verification of Infinite-State Systems (INFINITY 2006, 2007, 2008)

• 
  Peter Habermehl, Tomás Vojnar: Preface. 1-3
• 
  Giorgio Delzanno, Roberto Montagna: Deciding Reachability in Mobile Ambients with Name Restriction. 5-15
• 
  Sibylle B. Fröschle, Slawomir Lasota: Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences. 17-42
• 
  Mihaela Sighireanu, Tayssir Touili: Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism. 43-56
• 
  Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko: Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. 57-72
• 
  Tomás Brázdil, Václav Brozek, Vojtech Forejt: Branching-Time Model-Checking of Probabilistic Pushdown Automata. 73-83
• 
  Emmanuelle Encrenaz, Alain Finkel: Automatic Verification of Counter Systems With Ranking Function. 85-103
• 
  Mojmír Kretínský, Vojtech Rehák, Jan Strejcek: On Decidability of LTL+Past Model Checking for Process Rewrite Systems. 105-117
• 
  Franck Pommereau, Raymond R. Devillers, Hanna Klaudel: Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters. 119-129
• 
  Parosh Aziz Abdulla, Pavel Krcál, Wang Yi: Universality of R-automata with Value Copying. 131-141
• 
  Narjes Ben Rajeb, Brahim Nasraoui, Riadh Robbana, Tayssir Touili: Verifying Multithreaded Recursive Programs with Integer Variables. 143-154
• 
  Hanifa Boucheneb, Kamel Barkaoui: Covering Steps Graphs of Time Petri Nets. 155-165
• 
  Florent Bouchy, Alain Finkel, Arnaud Sangnier: Reachability in Timed Counter Systems. 167-178
• 
  Ulrich Fahrenberg, Kim Guldstrand Larsen: Discount-Optimal Infinite Runs in Priced Timed Automata. 179-191
• 
  Régis Gascon: An Automata-based Approach for CTL^* With Constraints. 193-211