Abstract is missing.
- Verifying Time and Communication Costs of Rule-Based ReasonersNatasha Alechina, Brian Logan, Nguyen Hoang Nga, Abdur Rakib. 1-14 [doi]
- Solving µ-Calculus Parity Games by Symbolic PlanningMarco Bakera, Stefan Edelkamp, Peter Kissmann, Clemens D. Renner. 15-33 [doi]
- Verifying Robocup TeamsClara Benac Earle, Lars-Åke Fredlund, José Antonio Iglesias, Agapito Ledezma. 34-48 [doi]
- Scaling Search with Pattern DatabasesStefan Edelkamp, Shahid Jabbar, Peter Kissmann. 49-64 [doi]
- Survey on Directed Model CheckingStefan Edelkamp, Viktor Schuppan, Dragan Bosnacki, Anton Wijs, Ansgar Fehnker, Husain Aljazzar. 65-89 [doi]
- Automated Testing of Planning ModelsKlaus Havelund, Alex Groce, Gerard J. Holzmann, Rajeev Joshi, Margaret H. Smith. 90-105 [doi]
- Towards Partial Order Reduction for Model Checking Temporal Epistemic LogicAlessio Lomuscio, Wojciech Penczek, Hongyang Qu. 106-121 [doi]
- Model Checking Driven Heuristic Search for Correct ProgramsGal Katz, Doron Peled. 122-131 [doi]
- Experimental Evaluation of a Planning Language Suitable for Formal VerificationRadu Siminiceanu, Rick W. Butler, César A. Muñoz. 132-146 [doi]
- Relaxation Refinement: A New Method to Generate Heuristic FunctionsJan-Georg Smaus, Jörg Hoffmann. 147-165 [doi]
- Model Checking Strategic EquilibriaNicolas Troquard, Wiebe van der Hoek, Michael Wooldridge. 166-188 [doi]