找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Certified Programs and Proofs; First International Jean-Pierre Jouannaud,Zhong Shao Conference proceedings 2011 Springer-Verlag GmbH Berli

[復(fù)制鏈接]
樓主: 乳缽
31#
發(fā)表于 2025-3-26 21:42:14 | 只看該作者
Modular SMT Proofs for Fast Reflexive Checking Inside Coqe relatively small and their proof is obtained with a modest overhead by our proof-producing prover. We present experiments assessing the feasibility of the approach for benchmarks obtained from the SMT competition.
32#
發(fā)表于 2025-3-27 04:40:09 | 只看該作者
https://doi.org/10.1007/978-94-011-0605-4sent the structure of proof evidence captured by a particular class of computational logic systems. While such proof certificates can capture a wide variety of proof structures, a proof checker can remain simple since it must only understand the micro-rules and the discipline of focusing. Since proo
33#
發(fā)表于 2025-3-27 05:19:00 | 只看該作者
34#
發(fā)表于 2025-3-27 10:59:33 | 只看該作者
35#
發(fā)表于 2025-3-27 17:19:41 | 只看該作者
36#
發(fā)表于 2025-3-27 19:04:13 | 只看該作者
37#
發(fā)表于 2025-3-27 22:07:22 | 只看該作者
Proof-Carrying Code in a Session-Typed Process Calculusw how to exploit dependent session types to express proof-carrying communication. We further introduce two modal operators into the type theory to provide detailed control about how much information is communicated: one based on traditional proof irrelevance and one integrating digital signatures.
38#
發(fā)表于 2025-3-28 04:52:37 | 只看該作者
Automated Certification of Implicit Induction Proofs certify properties about conditional specifications that are proved using automated proof techniques like those employed by the Spike prover, a rewrite-based implicit induction proof system. The certification methodology is based on a new representation of the implicit induction proofs for which th
39#
發(fā)表于 2025-3-28 06:29:27 | 只看該作者
A Proposal for Broad Spectrum Proof Certificates the construction of “macro” level inference rules based on the “micro” inference rules which introduce single logical connectives. After presenting focused proof systems for first-order classical logics (one with and one without fixed points and equality) we illustrate several examples of proof cer
40#
發(fā)表于 2025-3-28 13:34:02 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 10:37
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
昌黎县| 饶河县| 镇平县| 屏东市| 磐石市| 平遥县| 黄骅市| 运城市| 溆浦县| 东阳市| 海阳市| 浦县| 台北县| 嵩明县| 驻马店市| 隆子县| 昌都县| 句容市| 延寿县| 望奎县| 哈尔滨市| 当雄县| 简阳市| 嘉荫县| 道孚县| 乌审旗| 湘潭市| 峡江县| 玛曲县| 灵川县| 马公市| 长治县| 于都县| 峨山| 天门市| 柯坪县| 繁昌县| 延吉市| 应用必备| 鄂托克前旗| 海林市|