必须别名分析的Datalog模型

Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis Pub Date : 2017-06-18 DOI:10.1145/3088515.3088517

G. Balatsouras, Kostas Ferles, George Kastrinis, Y. Smaragdakis

{"title":"必须别名分析的Datalog模型","authors":"G. Balatsouras, Kostas Ferles, George Kastrinis, Y. Smaragdakis","doi":"10.1145/3088515.3088517","DOIUrl":null,"url":null,"abstract":"We give a declarative model of a rich family of must-alias analyses. Our emphasis is on careful and compact modeling, while exposing the key points where the algorithm can adjust its inference power. The model is executable, in the Datalog language, and forms the basis of a full-fledged must-alias analysis of Java bytecode in the Doop framework.","PeriodicalId":368102,"journal":{"name":"Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A Datalog model of must-alias analysis\",\"authors\":\"G. Balatsouras, Kostas Ferles, George Kastrinis, Y. Smaragdakis\",\"doi\":\"10.1145/3088515.3088517\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give a declarative model of a rich family of must-alias analyses. Our emphasis is on careful and compact modeling, while exposing the key points where the algorithm can adjust its inference power. The model is executable, in the Datalog language, and forms the basis of a full-fledged must-alias analysis of Java bytecode in the Doop framework.\",\"PeriodicalId\":368102,\"journal\":{\"name\":\"Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis\",\"volume\":\"116 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3088515.3088517\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3088515.3088517","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

我们给出了一个丰富的必须别名分析家族的声明模型。我们的重点是仔细和紧凑的建模，同时暴露算法可以调整其推理能力的关键点。该模型是可执行的，使用Datalog语言，并构成了框架中对Java字节码进行完整的必须别名分析的基础。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Datalog model of must-alias analysis

We give a declarative model of a rich family of must-alias analyses. Our emphasis is on careful and compact modeling, while exposing the key points where the algorithm can adjust its inference power. The model is executable, in the Datalog language, and forms the basis of a full-fledged must-alias analysis of Java bytecode in the Doop framework.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis

自引率

0.00%

发文量