Titlebook: Certified Programs and Proofs; Third International Georges Gonthier,Michael Norrish Conference proceedings 2013 Springer International Pub

終端

Computational Verification of Network Programs in Coqts programs written in NetCore, a new declarative network programming language. Our work builds on a recent effort by Guha, Reitblatt, and Foster to build a machine-verified compiler from NetCore to OpenFlow, a new protocol for software-defined networking.

BRIBE

Congruous

盟軍

祖?zhèn)髫敭a(chǎn)

STERN

Reflecting on Theoretical Context, representations and show that equivalence of representations is decidable. We also establish the usual closure properties, give a minimization algorithm for DFAs, and prove that minimal DFAs are unique up to state renaming. Our development profits much from Ssreflect’s support for finite types and graphs.

可觸知

違抗

過濾

cuticle

, ,(, ,) in Homotopy Type Theorynsions are interesting both from a computer science perspective, where they imbue the equality apparatus of type theory with new computational meaning, and from a mathematical perspective, where they allow higher-dimensional mathematics to be expressed cleanly and elegantly in type theory.