Institute of Information Science, Academia Sinica



Press Ctrl+P to print from browser


Netlog, Part 2: Proving Netlog Programs

  • LecturerDr. Jean-Francois Monin (LIAMA/Formes)
    Host: Dr. Tyng-Ruey Chuang
  • Time2010-12-21 (Tue.) 15:00 – 16:00
  • LocationAuditorium 107 at new IIS Building
Abstract: Netlog is a high-level language for distributed systems based on datalog, which was recently designed and implemented by Stephane Grumbach and his group at LIAMA. Key features of Netlog are locality of moves, conciseness and simplicity, opening the route to a new approach for proving correctness of distributed algorithms. We present here our formalization of Netlog in Coq, with an application to a distributed algorithm generating a breadth-first spanning tree over an arbitrary topology. The main novelty of this approach is the way we deal with global (e.g. topological) properties of a system which evolves according to local decisions. Joint work wuth Y Deng and S Grumbach.