找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Rigorous Methods for Software Construction and Analysis; Essays Dedicated to Jean-Raymond Abrial,Uwe Gl?sser Book 2009 Springer-Verlag Ber

[復(fù)制鏈接]
樓主: subcutaneous
11#
發(fā)表于 2025-3-23 10:36:07 | 只看該作者
12#
發(fā)表于 2025-3-23 15:49:45 | 只看該作者
13#
發(fā)表于 2025-3-23 18:23:16 | 只看該作者
14#
發(fā)表于 2025-3-24 00:37:35 | 只看該作者
Relaxing Restrictions on Invariant Composition in the , Method by Ownership Control ,,,nsure soundness of component compositions with a few additional proof obligations. On the other hand, in the context of the verification of object oriented programs, . proposes a more expressive approach, but at the price of more complex specifications, and more numerous proof obligations. In this p
15#
發(fā)表于 2025-3-24 06:02:48 | 只看該作者
Designing Old and New Distributed Algorithms by Replaying an Incremental Proof-Based Development,plex to verify in practice. Using the event B method, we develop a famous distributed algorithm, namely the leader election protocol for an acyclic network, generally known as the IEEE 1394. The algorithm exists and the refinement helps us to model it entirely in an elegant way. The final model is v
16#
發(fā)表于 2025-3-24 09:12:15 | 只看該作者
17#
發(fā)表于 2025-3-24 13:45:26 | 只看該作者
An ASM-Characterization of a Class of Distributed Algorithms,etc. Gurevich’s . take a more liberal position: . first-order structure may serve as a state. In [7] Gurevich characterizes the expressive power of .: he defines the class of . by means of only a few, amazingly general requirements and proves this class to be equivalent to sequential ASMs..In this p
18#
發(fā)表于 2025-3-24 16:30:49 | 只看該作者
Using Abstract State Machines for the Design of Multi-level Transaction Schedulers,vel conflicts to be ignored by taking higher-level application semantics into account. In this paper, we approach the formal specification of a multi-level transaction scheduler using Abstract State Machines. We are particularly interested in showing that concrete protocols for multi-level transacti
19#
發(fā)表于 2025-3-24 19:46:44 | 只看該作者
Validating and Animating Higher-Order Recursive Functions in B, complicated functions which cannot be represented explicitly by a tool. We present a scheme with which higher-order recursive functions can be encoded in B, and establish soundness of this scheme. We then describe a symbolic representation for such functions. This representation enables . to succes
20#
發(fā)表于 2025-3-25 00:27:28 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-5 15:13
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
郑州市| 阿拉善右旗| 九江市| 岐山县| 大化| 团风县| 客服| 齐河县| 江安县| 莒南县| 云梦县| 镇平县| 博客| 康乐县| 康保县| 金塔县| 喀什市| 东城区| 南阳市| 哈巴河县| 新营市| 龙陵县| 安远县| 焉耆| 武胜县| 丹东市| 佛坪县| 都昌县| 资源县| 河北区| 双桥区| 巴彦淖尔市| 浠水县| 边坝县| 和林格尔县| 射洪县| 合作市| 麟游县| 屯昌县| 嘉鱼县| 修水县|