{"title":"λΣ中的模型验证:一种类型推断方法","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":"{\"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}","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
摘要
在本文中,我们描述了Xa仿真语言中基于类型推断的一些模型分析和验证操作。Ag是一种基于类型化x演算的仿真语言。Xa实体对应类型化的x表达式,而Xa活动对应子类型。因此,实体可以通过类型引入规则生成,操作可以通过类型消除和相等规则在实体上定义。在用于创建新实体的引入规则中,形式e e r的前提可以通过将e替换为相邻活动中类型r的任何实体来满足。然后可以使用类型化x演算可用的类型推断算法执行许多模型分析和验证操作。
Model verification in λΣ: a type inference approach
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.