Model verification in λΣ: a type inference approach

E. Kortright
{"title":"Model verification in λΣ: a type inference approach","authors":"E. Kortright","doi":"10.1145/106073.306874","DOIUrl":null,"url":null,"abstract":"In this paper we describe a number of model analysis and verification operations based on type inference in the Xa simulation language. Ag is a simulation language based on the typed X-calculus. Xa entities correspond to typed X-expressions, while Xa activities correspond to subtypes. Thus, entities can be generated by means of type-introduction rules, and operations can be defined on entities by means of type elimination and equality rules. Premises of the form e E r in an introduction rule used to create a new entity can be satisfied by substituting for e any entity of type r in a neighboring activity. It is then possible to perform a number of model analysis and verification operations using type inference algorithms available for the typed X-calculus.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Simulation Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/106073.306874","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper we describe a number of model analysis and verification operations based on type inference in the Xa simulation language. Ag is a simulation language based on the typed X-calculus. Xa entities correspond to typed X-expressions, while Xa activities correspond to subtypes. Thus, entities can be generated by means of type-introduction rules, and operations can be defined on entities by means of type elimination and equality rules. Premises of the form e E r in an introduction rule used to create a new entity can be satisfied by substituting for e any entity of type r in a neighboring activity. It is then possible to perform a number of model analysis and verification operations using type inference algorithms available for the typed X-calculus.
λΣ中的模型验证:一种类型推断方法
在本文中,我们描述了Xa仿真语言中基于类型推断的一些模型分析和验证操作。Ag是一种基于类型化x演算的仿真语言。Xa实体对应类型化的x表达式,而Xa活动对应子类型。因此,实体可以通过类型引入规则生成,操作可以通过类型消除和相等规则在实体上定义。在用于创建新实体的引入规则中,形式e e r的前提可以通过将e替换为相邻活动中类型r的任何实体来满足。然后可以使用类型化x演算可用的类型推断算法执行许多模型分析和验证操作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信