Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis最新文献

MetaCG: annotated call-graphs to facilitate whole-program analysis MetaCG:带注释的调用图，便于整个程序分析

Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis Pub Date : 2020-11-17 DOI: 10.1145/3427764.3428320

Jan-Patrick Lehr, Alexander Hück, Yannic Fischler, C. Bischof

引用次数: 5

Online verification of commutativity 交换性的在线验证

Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis Pub Date : 2020-11-17 DOI: 10.1145/3427764.3428322

Aditi Kabra, Dietrich Geisler, Adrian Sampson

{"title":"Online verification of commutativity","authors":"Aditi Kabra, Dietrich Geisler, Adrian Sampson","doi":"10.1145/3427764.3428322","DOIUrl":"https://doi.org/10.1145/3427764.3428322","url":null,"abstract":"Systems of transformations arise in many programming systems, such as in graphs of implicit type conversion functions. It is important to ensure that these diagrams commute: that composing any path of transformations from the same source to the same destination yields the same result. However, a straightforward approach to verifying commutativity must contend with cycles, and even so it runs in exponential time. Previous work has shown how to verify commutativity in the special case of acyclic diagrams in O(|V|4|E|2) time, but this is a batch algorithm: the entire diagram must be known ahead of time. We present an online algorithm that efficiently verifies that a commutative diagram remains commutative when adding a new edge. The new incremental algorithm runs in O(|V|2(|E| + |V|)) time. For the case when checking the equality of paths is expensive, we also present an optimization that runs in O(|V|4) time but reduces to the minimum possible number of equality checks. We implement the algorithms and compare them to batch baselines, and we demonstrate their practical application in the compiler of a domain-specific language for geometry types. To study the algorithms’ scalability to large diagrams, we apply them to discover discrepancies in currency conversion graphs.","PeriodicalId":175862,"journal":{"name":"Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis","volume":"405 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113995850","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

API analytics for curating static analysis rules 用于管理静态分析规则的API分析

Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis Pub Date : 2020-11-15 DOI: 10.1145/3427764.3428318

Vineeth Kashyap, Roger Scott, Joseph Ranieri, David Melski, Lucja Kot

引用次数: 0

Towards checkpoint placement for dynamic memory allocation in intermittent computing 间歇计算中动态内存分配的检查点设置研究

Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis Pub Date : 2020-11-15 DOI: 10.1145/3427764.3428323

Nicholas Shoemaker, R. Piskac, Mark Santolucito

引用次数: 1

Type checking beyond type checkers, via slice & run 类型检查超越类型检查，通过切片和运行

Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis Pub Date : 2020-11-15 DOI: 10.1145/3427764.3428324

Justus Adam, Stephen Kell

引用次数: 0

Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis 第11届ACM SIGPLAN自动程序分析工具国际研讨会论文集

Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis Pub Date : 1900-01-01 DOI: 10.1145/3427764

引用次数: 0