终端 发表于 2025-3-30 09:31:23

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 发表于 2025-3-30 14:43:48

http://reply.papertrans.cn/23/2234/223357/223357_52.png

Congruous 发表于 2025-3-30 20:18:12

http://reply.papertrans.cn/23/2234/223357/223357_53.png

盟军 发表于 2025-3-30 21:43:21

http://reply.papertrans.cn/23/2234/223357/223357_54.png

祖传财产 发表于 2025-3-31 03:13:31

http://reply.papertrans.cn/23/2234/223357/223357_55.png

STERN 发表于 2025-3-31 05:56:14

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.

可触知 发表于 2025-3-31 09:46:03

http://reply.papertrans.cn/23/2234/223357/223357_57.png

违抗 发表于 2025-3-31 15:32:26

http://reply.papertrans.cn/23/2234/223357/223357_58.png

过滤 发表于 2025-3-31 19:37:36

http://reply.papertrans.cn/23/2234/223357/223357_59.png

cuticle 发表于 2025-3-31 23:15:17

, ,(, ,) 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.
页: 1 2 3 4 5 [6] 7
查看完整版本: Titlebook: Certified Programs and Proofs; Third International Georges Gonthier,Michael Norrish Conference proceedings 2013 Springer International Pub