ACM Transactions on Programming Languages and Systems最新文献_第2页

Capturing Types 捕捉类型

2区计算机科学

ACM Transactions on Programming Languages and Systems Pub Date : 2023-09-13 DOI: 10.1145/3618003

Aleksander Boruch-Gruszecki, Martin Odersky, Edward Lee, Ondřej Lhoták, Jonathan Brachthäuser

引用次数: 0

Exploiting Partially Context-Sensitive Profiles to Improve Performance of Hot Code 利用部分上下文敏感的配置文件来提高热代码的性能

2区计算机科学

ACM Transactions on Programming Languages and Systems Pub Date : 2023-09-13 DOI: 10.1145/3612937

Maja Vukasovic, Aleksandar Prokopec

{"title":"Exploiting Partially Context-Sensitive Profiles to Improve Performance of Hot Code","authors":"Maja Vukasovic, Aleksandar Prokopec","doi":"10.1145/3612937","DOIUrl":"https://doi.org/10.1145/3612937","url":null,"abstract":"Availability of profiling information is a major advantage of just-in-time (JIT) compilation. Profiles guide the compilation order and optimizations, thus substantially improving program performance. Ahead-of-time (AOT) compilation can also utilize profiles, obtained during separate profiling runs of the programs. Profiles can be context-sensitive, i.e., each profile entry is associated with a call-stack. To ease profile collection and reduce overheads, many systems collect partially context-sensitive profiles, which record only a call-stack suffix. Despite prior related work, partially context-sensitive profiles have the potential to further improve compiler optimizations. In this paper, we describe a novel technique that exploits partially context-sensitive profiles to determine which portions of code are hot, and compile them with additional compilation budget. This technique is applicable to most AOT compilers that can access partially context-sensitive profiles, and its goal is to improve program performance without significantly increasing code size. The technique relies on a new hot-code-detection algorithm to reconstruct hot regions based on the partial profiles. The compilation ordering and the inlining of the compiler are modified to exploit the information about the hot code. We formally describe the proposed algorithm and its heuristics, and then describe our implementation inside GraalVM Native Image, a state-of-the-art AOT compiler for Java. Evaluation of the proposed technique on 16 benchmarks from DaCapo, Scalabench and Renaissance suites shows a performance improvement between (22% ) and (40% ) on 4 benchmarks, and between (2.5% ) and (10% ) on 5 benchmarks. Code-size increase ranges from (0.8-9% ) , where 10 benchmarks exhibit an increase of less than (2.5% ) .","PeriodicalId":50939,"journal":{"name":"ACM Transactions on Programming Languages and Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135736414","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Model Checker for Operator Precedence Languages 运算符优先语言的模型检查器

IF 1.3 2区计算机科学

ACM Transactions on Programming Languages and Systems Pub Date : 2023-08-02 DOI: 10.1145/3608443

M. Chiari, D. Mandrioli, Francesco Pontiggia, Matteo Pradella

引用次数: 0

Optimizing Homomorphic Evaluation Circuits by Program Synthesis and Time-bounded Exhaustive Search 用程序综合和有界穷举搜索优化同态求值电路

IF 1.3 2区计算机科学

ACM Transactions on Programming Languages and Systems Pub Date : 2023-08-02 DOI: 10.1145/3591622

Dongkwon Lee, Woosuk Lee, Hakjoo Oh, K. Yi

{"title":"Optimizing Homomorphic Evaluation Circuits by Program Synthesis and Time-bounded Exhaustive Search","authors":"Dongkwon Lee, Woosuk Lee, Hakjoo Oh, K. Yi","doi":"10.1145/3591622","DOIUrl":"https://doi.org/10.1145/3591622","url":null,"abstract":"We present a new and general method for optimizing homomorphic evaluation circuits. Although fully homomorphic encryption (FHE) holds the promise of enabling safe and secure third party computation, building FHE applications has been challenging due to their high computational costs. Domain-specific optimizations require a great deal of expertise on the underlying FHE schemes and FHE compilers that aim to lower the hurdle, generate outcomes that are typically sub-optimal, as they rely on manually-developed optimization rules. In this article, based on the prior work of FHE compilers, we propose a method for automatically learning and using optimization rules for FHE circuits. Our method focuses on reducing the maximum multiplicative depth, the decisive performance bottleneck, of FHE circuits by combining program synthesis, term rewriting, and equality saturation. It first uses program synthesis to learn equivalences of small circuits as rewrite rules from a set of training circuits. Then, we perform term rewriting on the input circuit to obtain a new circuit that has lower multiplicative depth. Our rewriting method uses the equational matching with generalized version of the learned rules, and its soundness property is formally proven. Our optimizations also try to explore every possible alternative order of applying rewrite rules by time-bounded exhaustive search technique called equality saturation. Experimental results show that our method generates circuits that can be homomorphically evaluated 1.08×–3.17× faster (with the geometric mean of 1.56×) than the state-of-the-art method. Our method is also orthogonal to existing domain-specific optimizations.","PeriodicalId":50939,"journal":{"name":"ACM Transactions on Programming Languages and Systems","volume":" ","pages":"1 - 37"},"PeriodicalIF":1.3,"publicationDate":"2023-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44448403","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq SSProve: Coq中模块化密码证明的基本框架

IF 1.3 2区计算机科学

ACM Transactions on Programming Languages and Systems Pub Date : 2023-07-20 DOI: https://dl.acm.org/doi/10.1145/3594735

Philipp G. Haselwarter, Exequiel Rivas, Antoine Van Muylder, Théo Winterhalter, Carmine Abate, Nikolaj Sidorenco, Cătălin Hriţcu, Kenji Maillard, Bas Spitters

{"title":"SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq","authors":"Philipp G. Haselwarter, Exequiel Rivas, Antoine Van Muylder, Théo Winterhalter, Carmine Abate, Nikolaj Sidorenco, Cătălin Hriţcu, Kenji Maillard, Bas Spitters","doi":"https://dl.acm.org/doi/10.1145/3594735","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3594735","url":null,"abstract":"State-separating proofs (SSP) is a recent methodology for structuring game-based cryptographic proofs in a modular way, by using algebraic laws to exploit the modular structure of composed protocols. While promising, this methodology was previously not fully formalized and came with little tool support. We address this by introducing SSProve, the first general verification framework for machine-checked state-separating proofs. SSProve combines high-level modular proofs about composed protocols, as proposed in SSP, with a probabilistic relational program logic for formalizing the lower-level details, which together enable constructing machine-checked cryptographic proofs in the Coq proof assistant. Moreover, SSProve is itself fully formalized in Coq, including the algebraic laws of SSP, the soundness of the program logic, and the connection between these two verification styles.To illustrate SSProve, we use it to mechanize the simple security proofs of ElGamal and pseudo-random-function–based encryption. We also validate the SSProve approach by conducting two more substantial case studies: First, we mechanize an SSP security proof of the key encapsulation mechanism–data encryption mechanism (KEM-DEM) public key encryption scheme, which led to the discovery of an error in the original paper proof that has since been fixed. Second, we use SSProve to formally prove security of the sigma-protocol zero-knowledge construction, and we moreover construct a commitment scheme from a sigma-protocol to compare with a similar development in CryptHOL. We instantiate the security proof for sigma-protocols to give concrete security bounds for Schnorr’s sigma-protocol.","PeriodicalId":50939,"journal":{"name":"ACM Transactions on Programming Languages and Systems","volume":"263 9","pages":""},"PeriodicalIF":1.3,"publicationDate":"2023-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138508356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Multiple Input Parsing and Lexical Analysis 多输入解析和词法分析

IF 1.3 2区计算机科学

ACM Transactions on Programming Languages and Systems Pub Date : 2023-07-19 DOI: https://dl.acm.org/doi/10.1145/3594734

Elizabeth Scott, Adrian Johnstone, Robert Walsh

引用次数: 0

Prisma: A Tierless Language for Enforcing Contract-Client Protocols in Decentralized Applications Prisma:一种用于在分散应用程序中执行合约-客户端协议的无层语言

IF 1.3 2区计算机科学

ACM Transactions on Programming Languages and Systems Pub Date : 2023-07-18 DOI: https://dl.acm.org/doi/10.1145/3604629

David Richter, David Kretzler, Pascal Weisenburger, Guido Salvaneschi, Sebastian Faust, Mira Mezini

{"title":"Prisma: A Tierless Language for Enforcing Contract-Client Protocols in Decentralized Applications","authors":"David Richter, David Kretzler, Pascal Weisenburger, Guido Salvaneschi, Sebastian Faust, Mira Mezini","doi":"https://dl.acm.org/doi/10.1145/3604629","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3604629","url":null,"abstract":"Decentralized applications (dApps) consist of smart contracts that run on blockchains and clients that model collaborating parties. dApps are used to model financial and legal business functionality. Today, contracts and clients are written as separate programs – in different programming languages – communicating via send and receive operations. This makes distributed program flow awkward to express and reason about, increasing the potential for mismatches in the client-contract interface, which can be exploited by malicious clients, potentially leading to huge financial losses. In this paper, we present <sans-serif>Prisma</sans-serif>, a language for tierless decentralized applications, where the contract and its clients are defined in one unit and pairs of send and receive actions that “belong together” are encapsulated into a single direct-style operation, which is executed differently by sending and receiving parties. This enables expressing distributed program flow via standard control flow and renders mismatching communication impossible. We prove formally that our compiler preserves program behavior in presence of an attacker controlling the client code. We systematically compare <sans-serif>Prisma</sans-serif> with mainstream and advanced programming models for dApps and provide empirical evidence for its expressiveness and performance.","PeriodicalId":50939,"journal":{"name":"ACM Transactions on Programming Languages and Systems","volume":"265 10","pages":""},"PeriodicalIF":1.3,"publicationDate":"2023-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138508337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Verified Optimizer for Quantum Circuits 量子电路的验证优化器

IF 1.3 2区计算机科学

ACM Transactions on Programming Languages and Systems Pub Date : 2023-07-12 DOI: https://dl.acm.org/doi/10.1145/3604630

Kesha Hietala, Robert Rand, Liyi Li, Shih-Han Hung, Xiaodi Wu, Michael Hicks

引用次数: 0

A Verified Optimizer for Quantum Circuits 量子电路的验证优化器

IF 1.3 2区计算机科学

ACM Transactions on Programming Languages and Systems Pub Date : 2023-07-12 DOI: 10.1145/3604630

K. Hietala, Robert Rand, Liyi Li, S. Hung, Xiaodi Wu, Michael Hicks

引用次数: 0

Synchronous Deterministic Parallel Programming for Multi-Cores with ForeC 基于ForeC的多核同步确定性并行编程

IF 1.3 2区计算机科学

ACM Transactions on Programming Languages and Systems Pub Date : 2023-06-26 DOI: https://dl.acm.org/doi/10.1145/3591594

Eugene Yip, Alain Girault, Partha S. Roop, Morteza Biglari-Abhari

{"title":"Synchronous Deterministic Parallel Programming for Multi-Cores with ForeC","authors":"Eugene Yip, Alain Girault, Partha S. Roop, Morteza Biglari-Abhari","doi":"https://dl.acm.org/doi/10.1145/3591594","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3591594","url":null,"abstract":"Embedded real-time systems are tightly integrated with their physical environment. Their correctness depends both on the outputs and timeliness of their computations. The increasing use of multi-core processors in such systems is pushing embedded programmers to be parallel programming experts. However, parallel programming is challenging because of the skills, experiences, and knowledge needed to avoid common parallel programming traps and pitfalls. This article proposes the ForeC synchronous multi-threaded programming language for the deterministic, parallel, and reactive programming of embedded multi-cores. The synchronous semantics of ForeC is designed to greatly simplify the understanding and debugging of parallel programs. ForeC ensures that ForeC programs can be compiled efficiently for parallel execution and be amenable to static timing analysis. ForeC’s main innovation is its shared variable semantics that provides thread isolation and deterministic thread communication. All ForeC programs are correct by construction and deadlock free because no non-deterministic constructs are needed. We have benchmarked our ForeC compiler with several medium-sized programs (e.g., a 2.274-line ForeC program with up to 26 threads and distributed on up to 10 cores, which was based on a 2.155-line non-multi-threaded C program). These benchmark programs show that ForeC can achieve better parallel performance than Esterel, a widely used imperative synchronous language for concurrent safety-critical systems, and is competitive in performance to OpenMP, a popular desktop solution for parallel programming (which implements classical multi-threading, hence is intrinsically non-deterministic). We also demonstrate that the worst-case execution time of ForeC programs can be estimated to a high degree of precision.","PeriodicalId":50939,"journal":{"name":"ACM Transactions on Programming Languages and Systems","volume":"265 4","pages":""},"PeriodicalIF":1.3,"publicationDate":"2023-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138508340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0