找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: subcutaneous
发表于 2025-3-23 10:36:07 | 显示全部楼层
发表于 2025-3-23 15:49:45 | 显示全部楼层
发表于 2025-3-23 18:23:16 | 显示全部楼层
发表于 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
发表于 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
发表于 2025-3-24 09:12:15 | 显示全部楼层
发表于 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
发表于 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
发表于 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
发表于 2025-3-25 00:27:28 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-1 16:29
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表