Network Software Verification

The EPFL Network Architecture Lab is developing a tool to verify network dataplane software (such as middlebox functions: NAT, DPI, application acceleration, etc.)
    Crash freedom: prove that the software cannot crash under any circumstances (e.g., no null pointer dereference, no segfault, no division by 0, etc.)
    Liveness: prove that every packet is eventually processed
    Worst-case execution time: compute the upper bound on the number of instructions executed per packet
    Worst case energy consumption: compute the upper bound on the max amount of energy consumed per packet
    Correctness wrt a spec: prove that the code conforms to a spec. written in a formal language
    Other: specify below
    Please enter one response per row
    This is a required question
    This is a required question

    We would like to keep you updated on our progress. [optional]

    Please provide your contact information, and we will notify you when the tool is ready to try out. We promise not to send more than a couple of messages a year.
    This is a required question
    This is a required question
    This is a required question
Screen reader support enabled.