找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: 水平
发表于 2025-3-27 00:22:16 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626968.jpg
发表于 2025-3-27 01:38:17 | 显示全部楼层
0302-9743 The conference was organized by the Department of Computing Science, Groningen University, The Netherlands, at the occasion of the University‘s 375th anniversary. The creative inspiration of the modern computer has led to the development of new mathematics, the mathematics of program construction. I
发表于 2025-3-27 08:31:38 | 显示全部楼层
Conference proceedings 1989ence was organized by the Department of Computing Science, Groningen University, The Netherlands, at the occasion of the University‘s 375th anniversary. The creative inspiration of the modern computer has led to the development of new mathematics, the mathematics of program construction. Initially c
发表于 2025-3-27 10:11:45 | 显示全部楼层
Networks of communicating processes and their (De-)composition,ract space turns out to be the space of delay-insensitive specifications. As operator we study composition of networks. The composition operator on the resulting space is shown to have a surprisingly simple factorization property, the prove of which turns out to be very simple due to the approach taken.
发表于 2025-3-27 14:34:45 | 显示全部楼层
发表于 2025-3-27 20:27:28 | 显示全部楼层
发表于 2025-3-27 23:17:59 | 显示全部楼层
Towards totally verified systems,o show how a simple application could be verified. An application is implemented in a simple language and verified to be correct. This program is then compiled for a simple instruction set by a verified compiler. This instruction set is then implemented on a simple verified processor.
发表于 2025-3-28 04:00:36 | 显示全部楼层
A lattice-theoretical basis for a specification language,e sense that all monotonic predicate transformers can be constructed in it. The base language provides a unifying framework for various specification languages; we show how two Dijkstra-style specification languages can be embedded in the base language.
发表于 2025-3-28 08:12:00 | 显示全部楼层
Searching by elimination,eneral scheme is refined — depending on the mathematical properties of the objects involved — to a particular program. This is illustrated by some examples, varying from elementary problems to more advanced problems.
发表于 2025-3-28 10:50:10 | 显示全部楼层
Realizability models for program construction,recursion equations. Our aim is to ensure that, when constructive reasoning is harnessed for the derivation of programs from proofs of specifications, the programs we obtain are expressed in a natural way.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-5 23:20
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表