Journal: Electronic Notes in Theoretical Computer Science

Volume 119, Issue 2

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

Volume 119, Issue 1

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