{"title":"c++ 2.0的ASM语义","authors":"Horatiu Jula","doi":"10.3929/ETHZ-A-006787658","DOIUrl":null,"url":null,"abstract":"The Abstract State Machines (ASMs) theory has been applied to formalize in a rigorous mathematical manner the semantics of the C] programming language. We have extended the C] ASM model, in order to handle C] 2.0 specific features like generics, anonymous methods and iterator blocks. We found out that the existing operational model (the dynamic semantics) can be reused entirely (it is not altered after the integration of the new constructions). But, obviously, the static semantics suffered some important modifications.","PeriodicalId":136402,"journal":{"name":"Abstract State Machines","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"ASM Semantics for C++ 2.0\",\"authors\":\"Horatiu Jula\",\"doi\":\"10.3929/ETHZ-A-006787658\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Abstract State Machines (ASMs) theory has been applied to formalize in a rigorous mathematical manner the semantics of the C] programming language. We have extended the C] ASM model, in order to handle C] 2.0 specific features like generics, anonymous methods and iterator blocks. We found out that the existing operational model (the dynamic semantics) can be reused entirely (it is not altered after the integration of the new constructions). But, obviously, the static semantics suffered some important modifications.\",\"PeriodicalId\":136402,\"journal\":{\"name\":\"Abstract State Machines\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Abstract State Machines\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3929/ETHZ-A-006787658\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Abstract State Machines","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3929/ETHZ-A-006787658","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Abstract State Machines (ASMs) theory has been applied to formalize in a rigorous mathematical manner the semantics of the C] programming language. We have extended the C] ASM model, in order to handle C] 2.0 specific features like generics, anonymous methods and iterator blocks. We found out that the existing operational model (the dynamic semantics) can be reused entirely (it is not altered after the integration of the new constructions). But, obviously, the static semantics suffered some important modifications.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
