S. Banerjee, "Automatic synthesis of NF models by program analysis," in Proceedings of the 15th ACM Workshop on Hot Topics in Networks, HotNets '16, pp. 29-35, 2016. 58 M. Weiser, "Program slicing," in Proceedings of the 5th Interna- tional Conference on Software Engineering, pp. 439-449, IEEE Press, 1981. References 59 H. Agrawal and J. R. Horgan, "Dynamic program slicing," in ACM SIGPLAN Notices, vol. 25, pp. 246-256, ACM, 1990. 60 S. Horwitz, T. Reps, and D. Binkley, "Interprocedural slicing using dependence graphs," ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 12, no. 1, pp. 26-60, 1990. 61 J. Ferrante, K. J. Ottenstein, and J. D. Warren, "The program dependence graph and its use in optimization," ACM Transac- tions on Programming Languages and Systems (TOPLAS), vol. 9, no. 3, pp. 319-349, 1987. 62 V. Chipounov, V. Kuznetsov, and G. Candea, "S2E: a platform for in-vivo multi-path analysis of software systems," ACM SIGPLAN Notices, vol. 46, no. 3, pp. 265-278, 2011. 63 C. Cadar, D. Dunbar, D. R. Engler, et al., "KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs," in OSDI, vol. 8, pp. 209-224, 2008. 64 M. Dobrescu and K. Argyraki, "Software dataplane verification," in 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14), pp. 101-114, 2014. 65 D. Joseph and I. Stoica, "Modeling middleboxes," IEEE Network - The Magazine of Global Internetworking, 2008. 66 A. Panda, K. Argyraki, M. Sagiv, M. Schapira, and S. Shenker, "New directions for network verification," in LIPIcs-Leibniz International Proceedings in Informatics, vol. 32, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015. 67 A. Panda, O. Lahav, K. Argyraki, M. Sagiv, and S. Shenker, "Verifying reachability in networks with mutable datapaths," in Proceedings of USENIX NSDI, 2017. 68 S. Zhu, J. Bi, C. Sun, and C. Wu, "SDPA: Enhancing stateful for- warding for software-defined networking," in Proceedings of IEEE ICNP, 2015. 69 M. Moshref, A. Bhargava, A. Gupta, M. 