23rd International Symposium on Principles and Practice of Declarative Programming最新文献

A Superposition-Based Calculus for Diagrammatic Reasoning 基于叠加的图解推理演算

23rd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2021-09-06 DOI: 10.1145/3479394.3479405

R. Echahed, M. Echenim, M. Mhalla, N. Peltier

引用次数: 0

Deep Semantic Versioning for Evolution and Variability 进化和可变性的深度语义版本控制

23rd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2021-09-06 DOI: 10.1145/3479394.3479416

Luís Carvalho, João Costa Seco

{"title":"Deep Semantic Versioning for Evolution and Variability","authors":"Luís Carvalho, João Costa Seco","doi":"10.1145/3479394.3479416","DOIUrl":"https://doi.org/10.1145/3479394.3479416","url":null,"abstract":"The development cycles in the software industry are shrinking due to the increasing demands for shorter time to market and the incremental development style of agile methodologies. Pragmatic software engineering approaches rely on careful product management, a strong versioning discipline, and a feature development strategy to avoid that newly merged code disrupts existing systems. Versioning is critical when managing software product lines and ensuring that all their variants are kept in operation amidst all the performed changes. Such methodologies enforce functional correctness through strong efforts in regression testing, with the associated exponential growth in complexity. In this paper, we propose a language-based approach to software versioning. Unlike the traditional approach of mainstream VCS, where each evolution step is represented by a textual diff, we treat versions as first-class citizens. Each evolution step, merge operation, and version relationship, is represented as code in the program. We extend prior work, Versioned Featherweight Java, to support a full-fledged version control system. First, we introduce multi-branching and merge operations, which allow for more advanced workflows. We also present a slicing procedure implemented in a compile-time tool that extracts well-typed Featherweight Java code for any single version out of a versioned codebase. We present formal soundness results that ensure that the sliced code for any version is well-behaved and has the same behaviour as the multi-version source code. We believe that our developments effectively model relevant domains of software evolution, such as feature-oriented programming, software product lines, and continuous delivery scenarios. By lifting the versioning aspect, usually represented by text diffs, to the language level, we pave the way for tools that interact with software repositories (e.g. CI/CD, GitHub Actions) to have more insight regarding the evolution of the software semantics.","PeriodicalId":242361,"journal":{"name":"23rd International Symposium on Principles and Practice of Declarative Programming","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133462786","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}

引用次数: 3

Confluence in Non-Left-Linear Untyped Higher-Order Rewrite Theories 非左线性非类型高阶重写理论中的合流

23rd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2021-09-06 DOI: 10.1145/3479394.3479403

Gaspard Férey, J. Jouannaud

引用次数: 0

Trimming Data Sets: a Verified Algorithm for Robust Mean Estimation 修剪数据集:一种经过验证的鲁棒均值估计算法

23rd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2021-09-06 DOI: 10.1145/3479394.3479412

Ieva Daukantas, A. Bruni, C. Schürmann

引用次数: 0

Automated Trust Analysis of Copland Specifications for Layered Attestations✱ Copland分层认证规范的自动信任分析

23rd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2021-09-06 DOI: 10.1145/3479394.3479418

Paul D. Rowe, John D. Ramsdell, Ian D. Kretz

{"title":"Automated Trust Analysis of Copland Specifications for Layered Attestations✱","authors":"Paul D. Rowe, John D. Ramsdell, Ian D. Kretz","doi":"10.1145/3479394.3479418","DOIUrl":"https://doi.org/10.1145/3479394.3479418","url":null,"abstract":"In distributed systems, trust decisions are often based on remote attestations in which evidence is gathered about the integrity of subcomponents. Layered attestations leverage hierarchical dependencies among the subcomponents to bolster the trustworthiness of evidence. Copland is a declarative, domain-specific language for specifying complex layered attestations. How phrases are composed bears directly on the trustworthiness of the evidence they produce, and complex phrases become quite difficult to analyze by hand. We introduce an automated method for analyzing executions of attestations specified by Copland phrases in an adversarial setting. We develop a general theory of executions with adversarial corruption and repair events. Our approach is to enrich the Copland semantics according to this theory. Using the model finder Chase, we characterize all executions consistent with a set of initial assumptions. From this set of models, an analyst can discover all ways an active adversary can corrupt subcomponents without being detected by the attestation. These efforts afford trust policymakers the ability to compare attestations expressed as Copland phrases against trust policy in a way that encompasses both static and runtime concerns.","PeriodicalId":242361,"journal":{"name":"23rd International Symposium on Principles and Practice of Declarative Programming","volume":"48 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133578240","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}

引用次数: 4

From Non-determinism to Goroutines: A Fair Implementation of Curry in Go 从非确定性到例程:Curry在Go中的公平实现

23rd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2021-09-06 DOI: 10.1145/3479394.3479411

Jonas Böhm, M. Hanus, Finn Teegen

引用次数: 2

A Derived Reasonable Abstract Machine for Strong Call by Value 一种合理的强值调用抽象机

23rd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2021-09-06 DOI: 10.1145/3479394.3479401

Małgorzata Biernacka, Witold Charatonik, T. Dráb

引用次数: 6

Intersection types for a λ-calculus with global store 具有全局存储的λ-微积分的交集类型

23rd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2021-09-06 DOI: 10.1145/3479394.3479400

Ugo de'Liguoro, R. Treglia

引用次数: 4

Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory 在细粒度直接样式约简理论中反映堆叠延拓

23rd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2021-09-06 DOI: 10.1145/3479394.3479399

Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski

{"title":"Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory","authors":"Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski","doi":"10.1145/3479394.3479399","DOIUrl":"https://doi.org/10.1145/3479394.3479399","url":null,"abstract":"The delimited-control operator shift0 has been formally shown to capture the operational semantics of deep handlers for algebraic effects. Its CPS translation generates λ-terms in which continuation composition is not expressed in terms of nested function calls, as is typical of other delimited-control operators, e.g. shift, but with function applications consuming a sequence of continuations one at a time, as if they formed a stack. We present a novel reduction theory for Moggi’s computational λ-calculus extended with shift0 and a control delimiter dollar, which models the capture of evaluation contexts in a fine-grained manner as an interaction between the let-expressions and the delimiter. We establish a connection between our reduction theory and the existing theories of shif0 and dollar. Moreover, we develop a CPS translation for our calculus along with a direct-style translation that together form a reflection, i.e. the translations preserve reductions and the direct-style translation is a right inverse of the CPS translation. This construction relies on the invariant that CPS root terms are in η-head-normal form. The results of this work could potentially be used for compiler optimisations and lead to a similar development for algebraic effects.","PeriodicalId":242361,"journal":{"name":"23rd International Symposium on Principles and Practice of Declarative Programming","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129080605","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}

引用次数: 6

Towards Elastic Incrementalization for Datalog 迈向数据的弹性增量化

23rd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2021-09-06 DOI: 10.1145/3479394.3479415

David Zhao, Pavle Subotic, Mukund Raghothaman, Bernhard Scholz

引用次数: 4