发布求助
文献互助 智能选刊 最新文献

Asian Symposium on Programming Languages and Systems最新文献

筛选
英文 中文
Inferring Region Types via an Abstract Notion of Environment Transformation 通过环境转换的抽象概念推断区域类型
Asian Symposium on Programming Languages and Systems Pub Date : 2022-09-05 DOI: 10.48550/arXiv.2209.02147
Ulrich Schöpp, Chuangjie Xu
{"title":"Inferring Region Types via an Abstract Notion of Environment Transformation","authors":"Ulrich Schöpp, Chuangjie Xu","doi":"10.48550/arXiv.2209.02147","DOIUrl":"https://doi.org/10.48550/arXiv.2209.02147","url":null,"abstract":"Region-based type systems are a powerful tool for various kinds of program analysis. We introduce a new inference algorithm for region types based on an abstract notion of environment transformation. It analyzes the code of a method only once, even when there are multiple invocations of the method of different region types in the program. Elements of such an abstract transformation are essentially constraints for equality and subtyping that capture flow information of the program. In particular, we work with access graphs in the definition of abstract transformations to guarantee the termination of the inference algorithm, because they provide a finite representation of field access paths.","PeriodicalId":186570,"journal":{"name":"Asian Symposium on Programming Languages and Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122530082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Decoupling the ascending and descending phases in Abstract Interpretation 抽象解释中上升和下降阶段的解耦
Asian Symposium on Programming Languages and Systems Pub Date : 2022-06-22 DOI: 10.48550/arXiv.2206.10893
Vincenzo Arceri, Isabella Mastroeni, E. Zaffanella
{"title":"Decoupling the ascending and descending phases in Abstract Interpretation","authors":"Vincenzo Arceri, Isabella Mastroeni, E. Zaffanella","doi":"10.48550/arXiv.2206.10893","DOIUrl":"https://doi.org/10.48550/arXiv.2206.10893","url":null,"abstract":". Abstract Interpretation approximates the semantics of a program by mimicking its concrete fixpoint computation on an abstract domain A . The abstract (post-) fixpoint computation is classically divided into two phases: the ascending phase, using widenings as extrapolation operators to enforce termination, is followed by a descending phase, using narrowings as interpolation operators, so as to mitigate the effect of the precision losses introduced by widenings. In this paper we propose a simple variation of this classical approach where, to more effectively recover precision, we decouple the two phases: in particular, before starting the descending phase, we replace the domain A with a more precise abstract domain D . The correctness of the approach is justified by casting it as an instance of the A 2 I framework. After demonstrating the new technique on a simple example, we summarize the results of a preliminary experimental evaluation, showing that it is able to obtain significant precision improvements for several choices of the domains A and D .","PeriodicalId":186570,"journal":{"name":"Asian Symposium on Programming Languages and Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122677056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Hybrid Quantum-Classical Circuit Simplification with the ZX-Calculus 混合量子-经典电路简化与zx微积分
Asian Symposium on Programming Languages and Systems Pub Date : 2021-09-13 DOI: 10.1007/978-3-030-89051-3_8
Agust'in Borgna, S. Perdrix, B. Valiron
{"title":"Hybrid Quantum-Classical Circuit Simplification with the ZX-Calculus","authors":"Agust'in Borgna, S. Perdrix, B. Valiron","doi":"10.1007/978-3-030-89051-3_8","DOIUrl":"https://doi.org/10.1007/978-3-030-89051-3_8","url":null,"abstract":"","PeriodicalId":186570,"journal":{"name":"Asian Symposium on Programming Languages and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128414045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Termination Analysis for the π-Calculus by Reduction to Sequential Program Termination π-演算的终止分析，简化为顺序程序终止
Asian Symposium on Programming Languages and Systems Pub Date : 2021-09-01 DOI: 10.1007/978-3-030-89051-3_15
Tsubasa Shoshi, T. Ishikawa, N. Kobayashi, K. Sakayori, Ryosuke Sato, Takeshi Tsukada
{"title":"Termination Analysis for the π-Calculus by Reduction to Sequential Program Termination","authors":"Tsubasa Shoshi, T. Ishikawa, N. Kobayashi, K. Sakayori, Ryosuke Sato, Takeshi Tsukada","doi":"10.1007/978-3-030-89051-3_15","DOIUrl":"https://doi.org/10.1007/978-3-030-89051-3_15","url":null,"abstract":"","PeriodicalId":186570,"journal":{"name":"Asian Symposium on Programming Languages and Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127378719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Choice Construct in the Souffle Language 蛋奶酥语言中的选择结构
Asian Symposium on Programming Languages and Systems Pub Date : 2021-08-25 DOI: 10.1007/978-3-030-89051-3_10
Xiaowen Hu, Josh Karp, David Zhao, Abdul Zreika, Xi Wu, Bernhard Scholz
{"title":"The Choice Construct in the Souffle Language","authors":"Xiaowen Hu, Josh Karp, David Zhao, Abdul Zreika, Xi Wu, Bernhard Scholz","doi":"10.1007/978-3-030-89051-3_10","DOIUrl":"https://doi.org/10.1007/978-3-030-89051-3_10","url":null,"abstract":"","PeriodicalId":186570,"journal":{"name":"Asian Symposium on Programming Languages and Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134174571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A Dictionary-Passing Translation of Featherweight Go 轻量级围棋的符合字典的翻译
Asian Symposium on Programming Languages and Systems Pub Date : 2021-06-28 DOI: 10.1007/978-3-030-89051-3_7
Martin Sulzmann, Stefan Wehr
{"title":"A Dictionary-Passing Translation of Featherweight Go","authors":"Martin Sulzmann, Stefan Wehr","doi":"10.1007/978-3-030-89051-3_7","DOIUrl":"https://doi.org/10.1007/978-3-030-89051-3_7","url":null,"abstract":"","PeriodicalId":186570,"journal":{"name":"Asian Symposium on Programming Languages and Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127760688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Proving LTL Properties of Bitvector Programs and Decompiled Binaries 证明位向量程序和反编译二进制文件的LTL属性
Asian Symposium on Programming Languages and Systems Pub Date : 2021-05-11 DOI: 10.1007/978-3-030-89051-3_16
Y. Liu, Chengbin Pang, Daniel Dietsch, Eric Koskinen, T. Le, G. Portokalidis, Jun Xu Stevens Institute of Technology, U. Freiburg
{"title":"Proving LTL Properties of Bitvector Programs and Decompiled Binaries","authors":"Y. Liu, Chengbin Pang, Daniel Dietsch, Eric Koskinen, T. Le, G. Portokalidis, Jun Xu Stevens Institute of Technology, U. Freiburg","doi":"10.1007/978-3-030-89051-3_16","DOIUrl":"https://doi.org/10.1007/978-3-030-89051-3_16","url":null,"abstract":"","PeriodicalId":186570,"journal":{"name":"Asian Symposium on Programming Languages and Systems","volume":"304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122416504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Counterexample-Guided Debugger for Non-recursive Datalog 非递归数据记录的反例引导调试器
Asian Symposium on Programming Languages and Systems Pub Date : 2020-11-30 DOI: 10.1007/978-3-030-64437-6_17
Van-Dang Tran, H. Kato, Zhenjiang Hu
{"title":"A Counterexample-Guided Debugger for Non-recursive Datalog","authors":"Van-Dang Tran, H. Kato, Zhenjiang Hu","doi":"10.1007/978-3-030-64437-6_17","DOIUrl":"https://doi.org/10.1007/978-3-030-64437-6_17","url":null,"abstract":"","PeriodicalId":186570,"journal":{"name":"Asian Symposium on Programming Languages and Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117351849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Parameterized Synthesis with Safety Properties 具有安全性能的参数化合成
Asian Symposium on Programming Languages and Systems Pub Date : 2020-09-28 DOI: 10.1007/978-3-030-64437-6_14
Oliver Markgraf, Chih-Duo Hong, A. Lin, Muhammad Najib, D. Neider
{"title":"Parameterized Synthesis with Safety Properties","authors":"Oliver Markgraf, Chih-Duo Hong, A. Lin, Muhammad Najib, D. Neider","doi":"10.1007/978-3-030-64437-6_14","DOIUrl":"https://doi.org/10.1007/978-3-030-64437-6_14","url":null,"abstract":"","PeriodicalId":186570,"journal":{"name":"Asian Symposium on Programming Languages and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129724965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Neural Networks, Secure by Construction - An Exploration of Refinement Types 构造安全的神经网络——改进类型的探索
Asian Symposium on Programming Languages and Systems Pub Date : 2020-09-20 DOI: 10.1007/978-3-030-64437-6_4
W. Kokke, Ekaterina Komendantskaya, Daniel Kienitz, R. Atkey, David Aspinall
{"title":"Neural Networks, Secure by Construction - An Exploration of Refinement Types","authors":"W. Kokke, Ekaterina Komendantskaya, Daniel Kienitz, R. Atkey, David Aspinall","doi":"10.1007/978-3-030-64437-6_4","DOIUrl":"https://doi.org/10.1007/978-3-030-64437-6_4","url":null,"abstract":"","PeriodicalId":186570,"journal":{"name":"Asian Symposium on Programming Languages and Systems","volume":"10 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130191432","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信