MOCHART 2008 - Program
MOCHART-2008 - Program
21 July 2008, ROOM I-13
9.00am - 10.00am -- SESSION 1: VERIFYING AI SYSTEMS
- Clara Benac Earle, Lars-Ake Fredlund, Jose Antonio Iglesias and Agapito Ledezma
Verifying Robocup Teams
- Natasha Alechina, Brian Logan, Hoang Nga Nguyen and Abdur Rakib
Verifying time and communication costs of rule-based reasoners
10.00am - 10.30am COFFEE BREAK
10.30am - 12.30pm SESSION 2: SEARCH
- Alessio Lomuscio and Hongyang Qu
Towards partial order reduction for model checking temporal epistemic logic
- Stefan Edelkamp, Shahid Jabbar and Peter Kissmann
Scaling Search with Symbolic Abstraction Databases
- Jan-Georg Smaus and Joerg Hoffmann
Relaxation Refinement: A New Method to Generate Heuristic Functions
- Doron Peled
On Heuristic Search for Correct Programs
12.30pm - 2.00pm LUNCH BREAK
2.00pm - 3.30pm SESSION 3: VERIFYING AI SYSTEMS
- Klaus Havelund, Alex Groce, Gerard Holzmann, Rajeev Joshi and Margaret Smith
Automated Testing of Planning Models
- Radu Siminiceanu, Ricky Butler and Cesar Munoz
Experimental Evaluation of a Planning Language Suitable for Formal Verification
- Marco Bakera, Stefan Edelkamp, Peter Kissmann and Clemens D. Renner
Solving mu-calculus Parity Games by Symbolic Planning
3.30pm - 4.00pm COFFEE BREAK
4.00pm - 5.00pm INVITED TALK
- Toby Walsh (NICTA - UNSW, Australia)
Decision Diagrams and other Knowledge Compilation
Techniques for Constraint Programing
5.00 - 5.30pm DISCUSSION SESSION
5.30 CLOSE