A Formally Verified NAT Stack

Pirelli, S; Zaostrovnykh, A; Candea, G

Pirelli, S (reprint author), Ecole Polytech Fed Lausanne, Lausanne, Switzerland.

ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2018; 48 (5): 77

Abstract

Prior work proved a stateful NAT network function to be, crash-free, memory safe and semantically correct [29]. Their toolchain verifies the network f......

Full Text Link