找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Mathematics of Program Construction; 375th Anniversary of J. L. A. Snepscheut Conference proceedings 1989 Springer-Verlag Berlin Heidelberg

[复制链接]
楼主: 水平
发表于 2025-4-1 02:15:48 | 显示全部楼层
Specifications of concurrently accessed data,an be manipulated easily. This allowed us to derive several properties of the buffer (Appendix A) and construct a proof of buffer concatenation (Section 4). Also refinement of the specification with the eventual goal of implementation seems feasible with this scheme.
发表于 2025-4-1 07:51:46 | 显示全部楼层
发表于 2025-4-1 12:27:05 | 显示全部楼层
A lattice-theoretical basis for a specification language,nguage permits unbounded nondeterminism, demonic and angelic nondeterminism and is extended to permit miracles also. It is shown to be complete, in the sense that all monotonic predicate transformers can be constructed in it. The base language provides a unifying framework for various specification
发表于 2025-4-1 18:17:00 | 显示全部楼层
发表于 2025-4-1 21:56:18 | 显示全部楼层
Deriving mixed evaluation from standard evaluation for a simple functional language,cation for mixed evaluation. Using techniques inspired by natural semantics we specify a standard evaluator by a set of inference rules. The evaluation of programs is then performed by a restricted kind of theorem proving in this logic. We then describe a systematic method for extending the proof sy
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-5 21:19
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表