Modern computer networks use states to store temporary status of the network. This allows to enforce complicated forwarding policies and to enhance networks in a modular way. However, this can lead to subtle errors and makes network verification hard. I will survey current techniques for dealing with statefull networks and show a system for verifying networks using SMT solvers.
Track: NetPL invited talk.
Mooly serves as Member of the Advisory Board at Panaya Inc. He is a Senior Member of staff in the Computer Sciences Department School of Mathematical Sciences Tel-Aviv University. A leading scientist in large scale (inter-procedural) program analysis, his fields of interests include Programming Languages, Compilers, Abstract interpretation, Profiling, Pointer Analysis, Shape Analysis, Inter-procedural dataflow analysis, Program Slicing, Language-based programming environments.