Abstract is missing.
- SMT-Based Software Model CheckingAlessandro Cimatti. 1-3 [doi]
- Symbolic Object Code AnalysisJan Tobias Mühlberg, Gerald Lüttgen. 4-21 [doi]
- Experimental Comparison of Concolic and Random Testing for Java Card AppletsKari Kähkönen, Roland Kindermann, Keijo Heljanko, Ilkka Niemelä. 22-39 [doi]
- Combining SPIN with ns-2 for Protocol OptimizationPedro Merino, Alberto Salmeron. 40-57 [doi]
- Automatic Generation of Model Checking Scripts Based on Environment ModelingKenro Yatake, Toshiaki Aoki. 58-75 [doi]
- Model Checking: Cleared for Take OffDarren D. Cofer. 76-87 [doi]
- Context-Enhanced Directed Model CheckingMartin Wehrle, Sebastian Kupferschmid. 88-105 [doi]
- Efficient Explicit-State Model Checking on General Purpose Graphics ProcessorsStefan Edelkamp, Damian Sulewski. 106-123 [doi]
- The SpinJa Model CheckerMarc de Jonge, Theo C. Ruys. 124-128 [doi]
- On the Virtue of Patience: Minimizing Büchi AutomataRüdiger Ehlers, Bernd Finkbeiner. 129-145 [doi]
- Enacting Declarative Languages Using LTL: Avoiding Errors and Improving PerformanceMaja Pesic, Dragan Bosnacki, Wil M. P. van der Aalst. 146-161 [doi]
- Nevertrace Claims for Model CheckingZhe Chen, Gilles Motet. 162-179 [doi]
- Analysing Mu-Calculus Properties of Pushdown SystemsMatthew Hague, C.-H. Luke Ong. 187-192 [doi]
- Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic ChainsGeorgel Calin, Pepijn Crouzen, Pedro R. D Argenio, Ernst Moritz Hahn, Lijun Zhang. 193-211 [doi]
- An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory ModelsAlexander Linden, Pierre Wolper. 212-226 [doi]
- Context-Bounded Translations for Concurrent Software: An Empirical EvaluationNaghmeh Ghafari, Alan J. Hu, Zvonimir Rakamaric. 227-244 [doi]
- One Stack to Run Them All - Reducing Concurrent Analysis to Sequential Analysis under Priority SchedulingNicholas Kidd, Suresh Jagannathan, Jan Vitek. 245-261 [doi]