See presentationsWe are building a new logic engine, called Network Logic Solver, to support the verification of Microsoft networks. In addition to dealing with the large scale of the problem, our engine must cope with a logic extended with operations used to model routing protocols: specifically, aggregation (min, max) and non-monotonic negation. These features make the problem significantly harder to solve, and are not tackled by tools currently developed in (software) verification community. This is a joint work with Nuno Lopes.
