Electronic Notes in Theoretical Computer Science, Volume 119

Volume 119, Number 1, February 2005

• Luca de Alfaro:
  Preface. 1-2
  
• Hugo Gimbert, Wieslaw Zielonka:
  Discounting Infinite Games But How and Why? 3-9
  
• Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen:
  Synthesis of Optimal Strategies Using HyTech. 11-31
  
• Christian Dax, Martin Lange:
  Game Over: The Foci Approach to LTL Satisfiability and Model Checking. 33-49
  
• Rafal Somla:
  New Algorithms for Solving Simple Stochastic Games. 51-65
  
• Irfan Zakiuddin, Tim Hawkins, Nick Moffat:
  Towards A Game Theoretic Understanding of Ad-Hoc Routing. 67-92
  
• Loïc Hélouët, Marc Zeitoun, Aldric Degorre:
  Scenarios and Covert Channels: Another Game... 93-116
  

Volume 119, Number 2, March 2005

• Armin Biere, Ofer Strichman:
  Preface. 1-
  
• Roy Armoni, Limor Fix, Ranan Fraer, Scott Huddleston, Nir Piterman, Moshe Y. Vardi:
  SAT-based Induction for Temporal Safety Properties. 3-16
  
• Gilles Audemard, Marco Bozzano, Alessandro Cimatti, Roberto Sebastiani:
  Verifying Industrial Hybrid Systems with MathSAT. 17-32
  
• Gabriel P. Bischoff, Karl S. Brace, Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
  Exploiting Target Enlargement and Dynamic Abstraction within Mixed BDD and SAT Invariant Checking. 33-49
  
• HoonSang Jin, Fabio Somenzi:
  An Incremental Algorithm to Check Satisfiability for Bounded Model Checking. 51-65
  
• Alex Groce, Daniel Kroening:
  Making the Most of BMC Counterexamples. 67-81
  
• Daniel Sheridan:
  Bounded Model Checking with SNF, Alternating Automata, and Bu"chi Automata. 83-101