Electronic Proceedings in Theoretical Computer Science最新文献_第2页

Proceedings Workshop on Logical Frameworks and Meta-Languages: Theory and Practice 逻辑框架和元语言研讨会论文集：理论与实践

Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-07-08 DOI: 10.4204/EPTCS.404

Florian Rabe, C. Coen

{"title":"Proceedings Workshop on Logical Frameworks and Meta-Languages: Theory and Practice","authors":"Florian Rabe, C. Coen","doi":"10.4204/EPTCS.404","DOIUrl":"https://doi.org/10.4204/EPTCS.404","url":null,"abstract":"Logical frameworks and meta-languages form a common substrate for representing, implementing and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design, implementation and their use in reasoning tasks, ranging from the correctness of software to the properties of formal systems, have been the focus of considerable research over the last three decades. The LFMTP workshop brought together designers, implementors and practitioners to discuss various aspects impinging on the structure and utility of logical frameworks, including the treatment of variable binding, inductive and co-inductive reasoning techniques and the expressiveness and lucidity of the reasoning process. The 2024 instance of LFMTP was organized by Florian Rabe and Claudio Sacerdoti Coen in Tallinn, Estonia, the 8th July, as a satellite event of the FSCD conference. The workshop received 8 submissions, of which 6 were presented at the workshop. Of these, 2 were work-in-progress presentations, and 4 were accepted for these formal proceedings. Additionally, Carsten Sch\"urmann of IT University of Copenhagen gave an invited talk on Nominal State Separating Proofs.","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"114 33","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141668249","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 Beluga Formalization of the Harmony Lemma in the π-Calculus π微积分中和谐定理的白鲸形式化

Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-07-08 DOI: 10.4204/EPTCS.404.1

Gabriele Cecilia, A. Momigliano

引用次数: 0

Proofs for Free in the λΠ-Calculus Modulo Theory λΠ-微积分模态理论中的自由证明

Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-07-08 DOI: 10.4204/EPTCS.404.4

Thomas Traversi'e

引用次数: 0

Binding Contexts as Partitionable Multisets in Abella 阿贝拉中作为可分割多集的绑定上下文

Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-07-08 DOI: 10.4204/EPTCS.404.2

Terrance Gray, G. Nadathur

{"title":"Binding Contexts as Partitionable Multisets in Abella","authors":"Terrance Gray, G. Nadathur","doi":"10.4204/EPTCS.404.2","DOIUrl":"https://doi.org/10.4204/EPTCS.404.2","url":null,"abstract":"When reasoning about formal objects whose structures involve binding, it is often necessary to analyze expressions relative to a context that associates types, values, and other related attributes with variables that appear free in the expressions. We refer to such associations as binding contexts. Reasoning tasks also require properties such as the shape and uniqueness of associations concerning binding contexts to be made explicit. The Abella proof assistant, which supports a higher-order treatment of syntactic constructs, provides a simple and elegant way to describe such contexts from which their properties can be extracted. This mechanism is based at the outset on viewing binding contexts as ordered sequences of associations. However, when dealing with object systems that embody notions of linearity, it becomes necessary to treat binding contexts more generally as partitionable multisets. We show how to adapt the original Abella encoding to encompass such a generalization. The key idea in this adaptation is to base the definition of a binding context on a mapping to an underlying ordered sequence of associations. We further show that properties that hold with the ordered sequence view can be lifted to the generalized definition of binding contexts and that this lifting can, in fact, be automated. These ideas find use in the extension currently under development of the two-level logic approach of Abella to a setting where linear logic is used as the specification logic.","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":" 7","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141668393","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

Kuroda's Translation for the λΠ-Calculus Modulo Theory and Dedukti 黑田的 λΠ-Calculus 模数理论和 Dedukti 翻译

Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-07-08 DOI: 10.4204/EPTCS.404.3

Thomas Traversi'e

引用次数: 0

Formalizing Factorization on Euclidean Domains and Abstract Euclidean Algorithms 欧几里得域上因式分解的形式化和抽象欧几里得算法

Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-22 DOI: 10.4204/EPTCS.402.5

Thaynara Arielly de Lima, Andréia B. Avelar, André Luiz Galdino, M. Ayala-Rincón

引用次数: 1

Proof Terms for Higher-Order Rewriting and Their Equivalence 高阶改写的证明术语及其等价性

Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-22 DOI: 10.4204/eptcs.402.1

Pablo Barenbaum

引用次数: 0

Bottoms Up for CHCs: Novel Transformation of Linear Constrained Horn Clauses to Software Verification 为 CHC 抄底：将线性约束角条款转化为软件验证的新方法

Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-22 DOI: 10.4204/EPTCS.402.11

Márk Somorjai, Mihály Dobos-Kovács, Zsófia Ádám, Levente Bajczi, Andr'as Voros

{"title":"Bottoms Up for CHCs: Novel Transformation of Linear Constrained Horn Clauses to Software Verification","authors":"Márk Somorjai, Mihály Dobos-Kovács, Zsófia Ádám, Levente Bajczi, Andr'as Voros","doi":"10.4204/EPTCS.402.11","DOIUrl":"https://doi.org/10.4204/EPTCS.402.11","url":null,"abstract":"Constrained Horn Clauses (CHCs) have conventionally been used as a low-level representation in formal verification. Most existing solvers use a diverse set of specialized techniques, including direct state space traversal or under-approximating abstraction, necessitating purpose-built complex algorithms. Other solvers successfully simplified the verification workflow by translating the problem to inputs for other verification tasks, leveraging the strengths of existing algorithms. One such approach transforms the CHC problem into a recursive program roughly emulating a top-down solver for the deduction task; and verifying the reachability of a safety violation specified as a control location. We propose an alternative bottom-up approach for linear CHCs, and evaluate the two options in the open-source model checking framework THETA on both synthetic and industrial examples. We find that there is a more than twofold increase in the number of solved tasks when the novel bottom-up approach is used in the verification workflow, in contrast with the top-down technique.","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"74 25","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140677031","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

Semi-Substructural Logics with Additives 带添加剂的半结构逻辑

Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-22 DOI: 10.4204/EPTCS.402.8

Niccolò Veltri, Cheng-Syuan Wan

{"title":"Semi-Substructural Logics with Additives","authors":"Niccolò Veltri, Cheng-Syuan Wan","doi":"10.4204/EPTCS.402.8","DOIUrl":"https://doi.org/10.4204/EPTCS.402.8","url":null,"abstract":"This work concerns the proof theory of (left) skew monoidal categories and their variants (e.g. closed monoidal, symmetric monoidal), continuing the line of work initiated in recent years by Uustalu et al. Skew monoidal categories are a weak version of Mac Lane's monoidal categories, where the structural laws are not required to be invertible, they are merely natural transformations with a specific orientation. Sequent calculi which can be modelled in such categories can be identified as deductive systems for restricted substructural fragments of intuitionistic linear logic. These calculi enjoy cut elimination and admit a focusing strategy, sharing resemblance with Andreoli's normalization technique for linear logic. The focusing procedure is useful for solving the coherence problem of the considered categories with skew structure. Here we investigate possible extensions of the sequent calculi of Uustalu et al. with additive connectives. As a first step, we extend the sequent calculus with additive conjunction and disjunction, corresponding to studying the proof theory of skew monoidal categories with binary products and coproducts satisfying a left-distributivity condition. We introduce a new focused sequent calculus of derivations in normal form, which employs tag annotations to reduce non-deterministic choices in bottom-up proof search. The focused sequent calculus and the proof of its correctness have been formalized in the Agda proof assistant. We also discuss extensions of the logic with additive units, a form of skew exchange and linear implication.","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"42 10","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140676357","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

Embedding Differential Dynamic Logic in PVS 在 PVS 中嵌入差分动态逻辑

Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-22 DOI: 10.4204/EPTCS.402.7

J. Slagel, Mariano M. Moscato, Lauren White, César Muñoz, Swee Balachandran, Aaron Dutle

引用次数: 1