{"title":"Isabelle/HOL下验证JVML/CLDC优化的指称语义模型","authors":"H. Yahyaoui, M. Debbabi, N. Tawbi","doi":"10.1109/QSIC.2007.2","DOIUrl":null,"url":null,"abstract":"The main intent of this paper is to present a semantic framework for the validation of JVML/CLDC optimizations. The semantic style of the framework is denotational and rests on an extension of the resource pomsets semantics of Gastin and Mislove [12]. The resource pomsets is a fully abstract semantic model that is based on true concurrency. However, it does not support non-determinism that emerges while interpreting JVML/CLDC programs. In this paper, we present an extension of this model that aims to support unbounded non-determinism. More precisely, we give an overview of the construction of the process space and exhibit its algebraic properties. The elaborated semantics is embedded in the proof assistant Isabelle [28] in order to validate optimizations of JVML/CLDC programs. A case study for the validation of some optimizations of JVML/CLDC programs is also presented. The studied optimizations are: constant propagation and dead assignment elimination.","PeriodicalId":136227,"journal":{"name":"Seventh International Conference on Quality Software (QSIC 2007)","volume":"2002 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Denotational Semantic Model for Validating JVML/CLDC Optimizations under Isabelle/HOL\",\"authors\":\"H. Yahyaoui, M. Debbabi, N. Tawbi\",\"doi\":\"10.1109/QSIC.2007.2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The main intent of this paper is to present a semantic framework for the validation of JVML/CLDC optimizations. The semantic style of the framework is denotational and rests on an extension of the resource pomsets semantics of Gastin and Mislove [12]. The resource pomsets is a fully abstract semantic model that is based on true concurrency. However, it does not support non-determinism that emerges while interpreting JVML/CLDC programs. In this paper, we present an extension of this model that aims to support unbounded non-determinism. More precisely, we give an overview of the construction of the process space and exhibit its algebraic properties. The elaborated semantics is embedded in the proof assistant Isabelle [28] in order to validate optimizations of JVML/CLDC programs. A case study for the validation of some optimizations of JVML/CLDC programs is also presented. The studied optimizations are: constant propagation and dead assignment elimination.\",\"PeriodicalId\":136227,\"journal\":{\"name\":\"Seventh International Conference on Quality Software (QSIC 2007)\",\"volume\":\"2002 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Seventh International Conference on Quality Software (QSIC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/QSIC.2007.2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh International Conference on Quality Software (QSIC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/QSIC.2007.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Denotational Semantic Model for Validating JVML/CLDC Optimizations under Isabelle/HOL
The main intent of this paper is to present a semantic framework for the validation of JVML/CLDC optimizations. The semantic style of the framework is denotational and rests on an extension of the resource pomsets semantics of Gastin and Mislove [12]. The resource pomsets is a fully abstract semantic model that is based on true concurrency. However, it does not support non-determinism that emerges while interpreting JVML/CLDC programs. In this paper, we present an extension of this model that aims to support unbounded non-determinism. More precisely, we give an overview of the construction of the process space and exhibit its algebraic properties. The elaborated semantics is embedded in the proof assistant Isabelle [28] in order to validate optimizations of JVML/CLDC programs. A case study for the validation of some optimizations of JVML/CLDC programs is also presented. The studied optimizations are: constant propagation and dead assignment elimination.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
