找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Higher Order Logic Theorem Proving and Its Applications; 8th International Wo E. Thomas Schubert,Philip J. Windley,James Alves-F Conference

[复制链接]
楼主: 落后的煤渣
发表于 2025-3-25 03:37:45 | 显示全部楼层
Formal verification of counterflow pipeline architecture,Some properties of the Sproull counterflow pipeline architecture are formally verified using automata theory and higher order logic in the HOL theorem prover. The proof steps are presented. Despite the pipeline being a non-deterministic asynchronous system, the verification proceeded with minimal time and effort.
发表于 2025-3-25 08:44:31 | 显示全部楼层
发表于 2025-3-25 14:28:49 | 显示全部楼层
发表于 2025-3-25 17:28:28 | 显示全部楼层
Floating point verification in HOL,nsive and rigorous theory of real analysis. We explain how it can be used in floating point verification, illustrating our remarks with complete verifications of simple square-root and (natural) logarithm algorithms.
发表于 2025-3-25 23:24:42 | 显示全部楼层
978-3-540-60275-0Springer-Verlag Berlin Heidelberg 1995
发表于 2025-3-26 03:12:20 | 显示全部楼层
Higher Order Logic Theorem Proving and Its Applications978-3-540-44784-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-26 06:36:30 | 显示全部楼层
发表于 2025-3-26 11:08:06 | 显示全部楼层
0302-9743 n Aspen Grove, Utah, USA in September 1995..The 26 papers selected by the program committee for inclusion in this volume document the advances in the field achieved since the predecessor conference. The papers presented fall into three general categories: representation of formalisms in higher order
发表于 2025-3-26 13:00:00 | 显示全部楼层
Combining decision procedures in the HOL system,ables are the only information that need be communicated between them. Thus, code for deciding the component theories can be reused in a combined procedure and the latter can easily be extended. In addition, efficiency techniques used in the component procedures can be retained in the combined procedure.
发表于 2025-3-26 16:54:45 | 显示全部楼层
A practical method for reasoning about distributed systems in a theorem prover,in the system LAMBDA is described. Motivated by the importance of practicality in an industrial setting, a simple representation of TLA is combined with extended reasoning functions. Translation of user programs, safety, liveness, and refinement proofs are depicted by way of a parametric mutual exclusion algorithm.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-25 03:29
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表