Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs最新文献

Towards verified construction of correct and optimised GPU software 朝向验证构建正确且优化的GPU软件

Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs Pub Date : 2020-07-23 DOI: 10.1145/3427761.3428344

M. Huisman, Anton Wijs

引用次数: 0

ConSysT: tunable, safe consistency meets object-oriented programming ConSysT:可调的、安全的一致性符合面向对象编程

Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs Pub Date : 2020-07-23 DOI: 10.1145/3427761.3428346

M. Köhler, Nafise Eskandani Masoule, Alessandro Margara, G. Salvaneschi

引用次数: 0

An inductive abstract semantics for coFJ coFJ的归纳抽象语义

Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs Pub Date : 2020-07-23 DOI: 10.1145/3427761.3428342

Pietro Barbieri, Francesco Dagnino, E. Zucca

引用次数: 0

Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs 第22届ACM SIGPLAN类java程序正式技术国际研讨会论文集

Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs Pub Date : 2020-07-23 DOI: 10.1145/3427761

引用次数: 0

History-based specification and verification of Java collections in KeY (keynote) 基于历史的Java集合规范和验证(主题演讲)

Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs Pub Date : 2020-07-23 DOI: 10.1145/3427761.3432349

F. S. Boer, Hans-Dieter A. Hiep

引用次数: 0

Salsa: static analysis of serialization features Salsa:序列化特征的静态分析

Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs Pub Date : 2020-07-23 DOI: 10.1145/3427761.3428343

Joanna C. S. Santos, Reese A. Jones, Mehdi Mirakhorli

{"title":"Salsa: static analysis of serialization features","authors":"Joanna C. S. Santos, Reese A. Jones, Mehdi Mirakhorli","doi":"10.1145/3427761.3428343","DOIUrl":"https://doi.org/10.1145/3427761.3428343","url":null,"abstract":"Static analysis has the advantage of reasoning over multiple possible paths. Thus, it has been widely used for verification of program properties. Property verification often requires inter-procedural analysis, in which control and data flow are tracked across methods. At the core of inter-procedural analyses is the call graph, which establishes relationships between caller and callee methods. However, it is challenging to perform static analysis and compute the call graph of programs with dynamic features. Dynamic features are widely used in software systems; not supporting them makes it difficult to reason over properties related to these features. Although state-of-the-art research had explored certain types of dynamic features, such as reflection and RMI-based programs, serialization-related features are still not very well supported, as demonstrated in a recent empirical study. Therefore, in this paper, we introduce Salsa (Static AnaLyzer for SeriAlization features), which aims to enhance existing points-to analysis with respect to serialization-related features. The goal is to enhance the resulting call graph's soundness, while not greatly affecting its precision. In this paper, we report our early effort in developing Salsa and its early evaluation using the Java Call Graph Test Suite (JCG).","PeriodicalId":433231,"journal":{"name":"Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127171245","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

Prusti: deductive verification for Rust (keynote) Rust的演绎验证(主题演讲)

Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs Pub Date : 2020-07-23 DOI: 10.1145/3427761.3432348

Alexander J. Summers

{"title":"Prusti: deductive verification for Rust (keynote)","authors":"Alexander J. Summers","doi":"10.1145/3427761.3432348","DOIUrl":"https://doi.org/10.1145/3427761.3432348","url":null,"abstract":"Producing reliable systems software is a major challenge, plagued by the ubiquitous problems of shared mutable state, pointer aliasing, dynamic memory management, and subtle concurrency issues such as race conditions; even expert programmers struggle to tame the wide variety of reasons why their programs may not behave as they intended. Formal verification offers potential solutions to many of these problems, but typically at a very high price: the mathematical techniques employed are highly-complex, and difficult for even expert researchers to understand and apply. The relatively-new Rust programming language is designed to help with the former problem: a powerful ownership type system requires programmers to specify and restrict their discipline for referencing heap locations, providing in return the strong guarantee (almost; we’ll discuss this..) that code type-checked by this system will be free from dangling pointers, unexpected aliasing, race conditions and the like. While this rules out a number of common errors, the question of whether a program behaves as intended remains. This tutorial provides an introduction to the Prusti project, which leverages Rust’s type system and compiler analyses for formal verification of Rust code. By combining the rich information available about a type-checked Rust program with separate user-specification of intended behaviour, Prusti enables a user to verify functional correctness of their code without interacting with a complex program logic; in particular, specifications and all interactions with our implemented tool are at the level of abstraction of Rust expressions. The tutorial includes live demos with the tool, and audience participation is strongly encouraged!","PeriodicalId":433231,"journal":{"name":"Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121659700","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

A separation logic to verify termination of busy-waiting for abrupt program exit 一个分离逻辑，用于验证繁忙等待程序突然退出的终止

Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs Pub Date : 2020-07-20 DOI: 10.1145/3427761.3428345

Tobias Reinhard, Amin Timany, B. Jacobs

引用次数: 3