Electronic Notes in Theoretical Computer Science, Volume 185

Volume 185, July 2007

• Stephan Merz, Tobias Nipkow:
  Preface. 1-2
  Electronic Edition (link) BibTeX
• Hasan Amjad:
  Compressing Propositional Refutations. 3-15
  Electronic Edition (link) BibTeX
• Jean-Paul Bodeveix, Mamoun Filali, Julia L. Lawall, Gilles Muller:
  Automatic Verification of Bossa Scheduler Properties. 17-32
  Electronic Edition (link) BibTeX
• Michaël Cadilhac, Thomas Hérault, Richard Lassaigne, Sylvain Peyronnet, Sébastien Tixeuil:
  Evaluating Complex MAC Protocols for Sensor Networks with APMC. 33-46
  Electronic Edition (link) BibTeX
• Dominique Cansell, Dominique Méry:
  Incremental Parametric Development of Greedy Algorithms. 47-62
  Electronic Edition (link) BibTeX
• Alastair F. Donaldson, Alice Miller:
  Extending Symmetry Reduction Techniques to a Realistic Model of Computation. 63-76
  Electronic Edition (link) BibTeX
• Lars-Henrik Eriksson:
  The GTO Toolset and Method. 77-91
  Electronic Edition (link) BibTeX
• Sara Gradara, Antonella Santone, Maria Luisa Villani:
  Formal Verification of Concurrent Systems via Directed Model Checking. 93-105
  Electronic Edition (link) BibTeX
• E. Kleiner, T. Newcomb:
  On the Decidability of the Safety Problem for Access Control Policies. 107-120
  Electronic Edition (link) BibTeX
• Nick Moffat, Michael Goldsmith:
  Assumption-Commitment Support for CSP Model Checking. 121-137
  Electronic Edition (link) BibTeX
• Frank Ortmeier, Gerhard Schellhorn:
  Formal Fault Tree Analysis - Practical Experiences. 139-151
  Electronic Edition (link) BibTeX