找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Mathematics of Program Construction; Third International Bernhard M?ller Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 199

[復制鏈接]
31#
發(fā)表于 2025-3-26 21:36:36 | 只看該作者
32#
發(fā)表于 2025-3-27 02:00:08 | 只看該作者
33#
發(fā)表于 2025-3-27 09:11:11 | 只看該作者
A compositional proof system for asynchronously communicating processes,formalism serves well as a basis for refinement and top-down development of distributed systems composed of asynchronously communicating processes. Moreover, we show that the first-order logic underlying the interface-specification language is decidable, which makes (semi-) automated verification more feasible.
34#
發(fā)表于 2025-3-27 11:51:19 | 只看該作者
35#
發(fā)表于 2025-3-27 17:34:06 | 只看該作者
,Angelic termination in Dijkstra’s calculus,on proposal, the semantics are given by monotonic predicate transformers and monotonic operations on them. In this way the semantics of recursion is completely standard. The paper concludes with proof rules for recursive procedures and a small example of their applications.
36#
發(fā)表于 2025-3-27 20:53:04 | 只看該作者
37#
發(fā)表于 2025-3-28 00:10:59 | 只看該作者
Conference proceedings 1995missions. The general theme is the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software and hardware; among the topics addressed are program transformation, program analysis, program verification, as well as convincing case studies.
38#
發(fā)表于 2025-3-28 03:23:50 | 只看該作者
Towards automatic parallelization of logic programs,gram by generating the appropriate delay declarations, so that correctness is maintained and deadlock avoided. To this end we identify the crucial properties that the original Prolog program should satisfy and analyze which aspects of the parallelization process and of the correctness proof could be automated.
39#
發(fā)表于 2025-3-28 06:59:00 | 只看該作者
A simple, efficient, and flexible implementation of flexible arrays,without affecting time complexities. The standard flexible array operations take .(log . time, where . is the size of the flexible array. Additional operations, such as minimum and maximum take .(1) time.
40#
發(fā)表于 2025-3-28 12:56:26 | 只看該作者
An action system specification of the caltech asynchronous microprocessor,ecification. We propose a specification strategy that is based on the idea of . of the program variable space. Applying this strategy we give a completely formal derivation of a high level specification for the Caltech microprocessor. We also demonstrate the suitability of action systems and the stepwise refinement paradigm for ..
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-21 04:39
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復 返回頂部 返回列表
芷江| 安乡县| 黄大仙区| 图们市| 门头沟区| 巴林左旗| 铅山县| 堆龙德庆县| 余姚市| 桐梓县| 梁山县| 孟州市| 珲春市| 九龙县| 开化县| 宁城县| 灌阳县| 梅河口市| 义乌市| 措勤县| 霍邱县| 师宗县| 忻州市| 绥滨县| 宁南县| 精河县| 南昌市| 瑞丽市| 化德县| 将乐县| 澄城县| 西盟| 金门县| 江安县| 新竹市| 东乡族自治县| 科尔| 大丰市| 神农架林区| 井研县| 凤翔县|