A Simple Semantics and Static Analysis for Stack Inspection

A. Banerjee, D. Naumann
{"title":"A Simple Semantics and Static Analysis for Stack Inspection","authors":"A. Banerjee, D. Naumann","doi":"10.4204/EPTCS.129.17","DOIUrl":null,"url":null,"abstract":"The Java virtual machine and the .NET common language runtime feature an access control mechanism specified operationally in terms of run-time stack inspection. We give a denotational semantics in \"eager\" form, and show that it is equivalent to the \"lazy\" semantics using stack inspection. We give a static analysis of safety, i.e., the absence of security errors, that is simpler than previous proposals. We identify several program transformations that can be used to remove run-time checks. We give complete, detailed proofs for safety of the analysis and for the transformations, exploiting compositionality of the eager semantics.","PeriodicalId":411813,"journal":{"name":"Festschrift for Dave Schmidt","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Festschrift for Dave Schmidt","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.129.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The Java virtual machine and the .NET common language runtime feature an access control mechanism specified operationally in terms of run-time stack inspection. We give a denotational semantics in "eager" form, and show that it is equivalent to the "lazy" semantics using stack inspection. We give a static analysis of safety, i.e., the absence of security errors, that is simpler than previous proposals. We identify several program transformations that can be used to remove run-time checks. We give complete, detailed proofs for safety of the analysis and for the transformations, exploiting compositionality of the eager semantics.
堆栈检查的简单语义和静态分析
Java虚拟机和。net公共语言运行库具有访问控制机制,该机制是根据运行时堆栈检查在操作上指定的。我们给出了“急切”形式的指称语义,并使用堆栈检查证明了它等同于“懒惰”语义。我们给出了安全性的静态分析,即不存在安全错误,这比以前的建议更简单。我们确定了几个可用于删除运行时检查的程序转换。我们给出了完整的、详细的证明,证明了分析和转换的安全性,利用了渴望语义的组合性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信