We present a model checking approach for the verification of data flow correctness in
networks during concurrent updates of the network configuration. This verification problem is …

The correctness of networks is often described in terms of the individual data flow of
components instead of their global behavior. In software-defined networks, it is far more …

We introduce a formal language for specifying dynamic updates for Software Defined
Networks. Our language builds upon Network Kleene Algebra with Tests (NetKAT) and adds …

Despite great advances in program synthesis techniques, they remain algorithmic black
boxes. Although they guarantee that when synthesis is successful, the implementation …

The paper is devoted to the verification of Software Defined Networking (SDN) components
and their compositions. We focus on the interaction between three basic entities, an …

The hope of allowing programmers to more freely express themselves has led to a
proliferation of program synthesis techniques. These tools automatically derive …

The paper is devoted to detecting output races in distributed systems. We perform such
detection through testing their implementations. As an underlying model for our test …

Regular expressions are pervasive in modern systems. Many real-world regular expressions
are inefficient, sometimes to the extent that they are vulnerable to complexity-based attacks …

We present a technique for automatic synthesis of efficient and provably correct
synchronization in GPU kernels. Our technique relies on an off-the-shelf correctness oracle …

Debugging imperative network programs is a difficult task for operators as it requires
understanding various network modules and complicated data structures. For this purpose …