Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs最新文献

Towards Verified Scalable Parallel Computing with Coq and Spark 用Coq和Spark实现可扩展并行计算

Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs Pub Date : 2023-07-18 DOI: 10.1145/3605156.3606450

F. Loulergue, Jolan Philippe

引用次数: 0

Runtime Verification of Hash Code in Mutable Classes 可变类中哈希码的运行时验证

Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs Pub Date : 2023-07-18 DOI: 10.1145/3605156.3606452

D. Ancona, Angelo Ferrando, V. Mascardi

引用次数: 0

Verifying Well-Typedness Preservation of Refactorings using Scope Graphs 用作用域图验证重构的良好类型保存

Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs Pub Date : 2023-07-18 DOI: 10.1145/3605156.3606455

L. Miljak, Casper Bach Poulsen, Flip van Spaendonck

{"title":"Verifying Well-Typedness Preservation of Refactorings using Scope Graphs","authors":"L. Miljak, Casper Bach Poulsen, Flip van Spaendonck","doi":"10.1145/3605156.3606455","DOIUrl":"https://doi.org/10.1145/3605156.3606455","url":null,"abstract":"The goal of automated refactoring is to reduce maintenance effort. To realize this, programmers need to be able to trust or manually check that refactorings actually preserve behavior. To allow programmers to focus on such checks, automated refactorings should preserve program well-typedness. However, historically automated refactorings in popular IDEs could break well-typedness. The reason is that modern languages have complex name binding semantics which makes it hard to guarantee well-typedness in general. In recent work, scope graphs have been proposed as a uniform model for name binding. The model supports complex name binding patterns, and its uniformity makes it attractive to consider for verifying that refactorings preserve well-typedness. This paper explores how to prove that refactorings preserve well-typedness, using scope graphs. We consider a simple refactoring for merging modules in a toy module language, and prove that this refactoring preserves well-typedness. We give a generic template for proving well-typedness preservation using scope graphs, and discuss how this template relates to refactorings more generally.","PeriodicalId":254071,"journal":{"name":"Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs","volume":"510 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122216571","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

Points-to Analysis for Context-Oriented JavaScript Programs 指向面向上下文的JavaScript程序的分析

Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs Pub Date : 2023-07-18 DOI: 10.1145/3605156.3606451

S. Cárdenas, Paul Leger, Hiroaki Fukuda, Nicolás Cardozo

{"title":"Points-to Analysis for Context-Oriented JavaScript Programs","authors":"S. Cárdenas, Paul Leger, Hiroaki Fukuda, Nicolás Cardozo","doi":"10.1145/3605156.3606451","DOIUrl":"https://doi.org/10.1145/3605156.3606451","url":null,"abstract":"Static analyses, as points-to analysis, are useful to determine and assure different properties about a program, such as security or type safety. While existing analyses are effective in programs restricted to static features, precision declines in the presence of dynamic language features, and even further when the system behavior changes dynamically. As a consequence, improved points-to sets algorithms taking into account such language features and uses are required. In this paper, we present and extension of the point-to sets analysis to incorporate the language abstractions introduced by context-oriented programming adding the capability for programs to adapt their behavior dynamically to the system’s execution context. To do this, we extend WALA to detect the context-oriented language abstractions, and their representation within the system, to capture the dynamic behavior, in the particular case of the Context Traits JavaScript language extension. To prove the effectiveness of our extension, we evaluate the precision of the points-to set analysis with respect to the state of the art, over a set of context-oriented programs taken from the literature.","PeriodicalId":254071,"journal":{"name":"Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133883758","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

Dependency-Free Capture Tracking 无依赖捕获跟踪

Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs Pub Date : 2023-07-18 DOI: 10.1145/3605156.3606454

Edward Lee, Kavin Satheeskumar, O. Lhoták

引用次数: 0

Correctness-by-Construction Meets Refinement Types 构造正确性满足精化类型

Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs Pub Date : 2023-07-18 DOI: 10.1145/3605156.3606449

Baber Rehman

引用次数: 0

Gradual Guarantee for FJ with lambda-Expressions 带lambda表达式的FJ的渐进保证

Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs Pub Date : 2023-07-18 DOI: 10.1145/3605156.3606453

Pedro Ângelo, V. Bono, M. Dezani-Ciancaglini, Mário Florido

引用次数: 0

Constructing Structured SSA from FJ 从FJ构造结构化SSA

Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs Pub Date : 2023-07-18 DOI: 10.1145/3605156.3606457

Kenny Zhuo Ming Lu, Daniel Yu Hian Low

引用次数: 0

Using Rewrite Strategies for Efficient Functional Automatic Differentiation 利用重写策略实现高效的功能自动区分

Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs Pub Date : 2023-07-05 DOI: 10.1145/3605156.3606456

Timon Böhler, D. Richter, M. Mezini

{"title":"Using Rewrite Strategies for Efficient Functional Automatic Differentiation","authors":"Timon Böhler, D. Richter, M. Mezini","doi":"10.1145/3605156.3606456","DOIUrl":"https://doi.org/10.1145/3605156.3606456","url":null,"abstract":"Automatic Differentiation (AD) has become a dominant technique in ML. AD frameworks have first been implemented for imperative languages using tapes. Meanwhile, functional implementations of AD have been developed, often based on dual numbers, which are close to the formal specification of differentiation and hence easier to prove correct. But these papers have focussed on correctness not efficiency. Recently, it was shown how an approach using dual numbers could be made efficient through the right optimizations. Optimizations are highly dependent on order, as one optimization can enable another. It can therefore be useful to have fine-grained control over the scheduling of optimizations. One method expresses compiler optimizations as rewrite rules, whose application can be combined and controlled using strategy languages. Previous work describes the use of term rewriting and strategies to generate high-performance code in a compiler for a functional language. In this work, we implement dual numbers AD in a functional array programming language using rewrite rules and strategy combinators for optimization. We aim to combine the elegance of differentiation using dual numbers with a succinct expression of the optimization schedule using a strategy language. We give preliminary evidence suggesting the viability of the approach on a micro-benchmark.","PeriodicalId":254071,"journal":{"name":"Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132333199","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

Verifying C++ Dynamic Binding 验证c++动态绑定

Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs Pub Date : 2023-06-03 DOI: 10.1145/3605156.3606448

Niels Mommen, Bart Jacobs

引用次数: 0