找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Refinement in Z and Object-Z; Foundations and Adva John Derrick,Eerke A. Boiten Book 2014Latest edition Springer-Verlag London 2014 Formal

[复制链接]
楼主: CRUST
发表于 2025-3-26 21:52:13 | 显示全部楼层
发表于 2025-3-27 03:56:58 | 显示全部楼层
Weak Refinementternal operations. In this, we also consider the possibility of “livelock”, where internal operations are continuously enabled, its impact on refinement conditions, and the related notion of divergence.
发表于 2025-3-27 06:44:31 | 显示全部楼层
发表于 2025-3-27 11:37:50 | 显示全部楼层
Simple Refinementformal motivation of the simplest refinement relation of all, namely operation refinement. Operation refinement can be applied to individual operations without reference to the other operations present in the abstract data type (ADT). The other simple refinement rules presented in this chapter, esta
发表于 2025-3-27 16:00:01 | 显示全部楼层
Data Refinement and Simulationslying these definitions to abstract data types with partial relations are then considered. The central part of this chapter is the standard definition of data refinement for relational data types, the definitions of upward and downward simulations, and the statement of their soundness and joint comp
发表于 2025-3-27 20:21:02 | 显示全部楼层
Refinement in Zlar attention is given to the role of inputs and outputs in Z..In this chapter, we formulate the theory of data refinement for Z. This is done systematically: a relational interpretation will be given for the standard Z ADT as defined in Chap. .. We apply the simulation based refinement rules from C
发表于 2025-3-27 21:56:47 | 显示全部楼层
发表于 2025-3-28 02:11:55 | 显示全部楼层
Promotionomposing specifications in order to build multiple indexed instances of a single component. To do so the component is described as a local state together with operations acting on that state, a global state is then defined which consists of multiple instances of this local state together with global
发表于 2025-3-28 09:07:32 | 显示全部楼层
发表于 2025-3-28 11:33:53 | 显示全部楼层
A Single Simulation Rulean be proved using a combination of upward and downward simulation steps. This chapter presents an alternative in the form of powersimulations which provide for a single complete refinement rule for Z. This requires a change in the underlying framework, moving from relations to possibility mappings.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-20 02:55
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表