I have been invited to give a talk at the 5th CSPSAT2 meeting in Kobe University on the challenges of model-checking and its connection with Constraint Satisfaction Problem and Boolean satisfiability. This was really enriching to give such a presentation to an audience expert with CSP and SAT approaches. This raised many interesting questions, especially with regard to the applicability of these methods to large-scale industrial cases studies.
This talk was part of my activity as JSPS invited researcher at Inoue Lab, National Institute of Informatics (Tokyo).
- Place: Kobe, Kobe University, Rokko campus
- Date: 2014/08/21
- Duration: 1 hour
- Attendance: 20+ persons (researchers, PhD students)