发布求助
文献互助 智能选刊 最新文献

Electronic Proceedings in Theoretical Computer Science最新文献

筛选
英文 中文
CHC-COMP 2023: Competition Report CHC-COMP 2023：竞争报告
Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-22 DOI: 10.4204/EPTCS.402.10
Emanuele DE ANGELIS, Hari Govind V K
{"title":"CHC-COMP 2023: Competition Report","authors":"Emanuele DE ANGELIS, Hari Govind V K","doi":"10.4204/EPTCS.402.10","DOIUrl":"https://doi.org/10.4204/EPTCS.402.10","url":null,"abstract":"CHC-COMP 2023 is the sixth edition of the Competition of Solvers for Constrained Horn Clauses. The competition was run in April 2023 and the results were presented at the 10th Workshop on Horn Clauses for Verification and Synthesis held in Paris, France, on April 23, 2023. This edition featured seven solvers (six competing and one hors concours) and six tracks, each of which dealing with a class of clauses. This report describes the organization of CHC-COMP 2023 and presents its results.","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"19 21","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140675006","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
Mechanizing Session-Types: Enforcing Linearity without Linearity 会话类型机械化：无线性强制线性
Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-22 DOI: 10.4204/eptcs.402.3
Brigitte Pientka
{"title":"Mechanizing Session-Types: Enforcing Linearity without Linearity","authors":"Brigitte Pientka","doi":"10.4204/eptcs.402.3","DOIUrl":"https://doi.org/10.4204/eptcs.402.3","url":null,"abstract":"","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"58 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140675843","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
An Encoding for CLP Problems in SMT-LIB SMT-LIB 中的 CLP 问题编码
Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-22 DOI: 10.4204/EPTCS.402.12
Daneshvar Amrollahi, Hossein Hojjat, Philipp Rummer
{"title":"An Encoding for CLP Problems in SMT-LIB","authors":"Daneshvar Amrollahi, Hossein Hojjat, Philipp Rummer","doi":"10.4204/EPTCS.402.12","DOIUrl":"https://doi.org/10.4204/EPTCS.402.12","url":null,"abstract":"The input language for today's CHC solvers are commonly the standard SMT-LIB format, borrowed from SMT solvers, and the Prolog format that stems from Constraint-Logic Programming (CLP). This paper presents a new front-end of the Eldarica CHC solver that allows inputs in the Prolog language. We give a formal translation of a subset of Prolog into the SMT-LIB commands. Our initial experiments show the effectiveness of the approach and the potential benefits to both the CHC solving and CLP communities.","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"54 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140672634","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
More Church-Rosser Proofs in BELUGA BELUGA 中的更多 Church-Rosser 证明
Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-22 DOI: 10.4204/EPTCS.402.6
Alberto Momigliano, Martina Sassella
{"title":"More Church-Rosser Proofs in BELUGA","authors":"Alberto Momigliano, Martina Sassella","doi":"10.4204/EPTCS.402.6","DOIUrl":"https://doi.org/10.4204/EPTCS.402.6","url":null,"abstract":"We report on yet another formalization of the Church-Rosser property in lambda-calculi, carried out with the proof environment Beluga. After the well-known proofs of confluence for beta-reduction in the untyped settings, with and without Takahashi's complete developments method, we concentrate on eta-reduction and obtain the result for beta-eta modularly. We further extend the analysis to typed-calculi, in particular System F. Finally, we investigate the idea of pursuing the encoding directly in Beluga's meta-logic, as well as the use of Beluga's logic programming engine to search for counterexamples.","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"60 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140675693","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
Stalnaker's Epistemic Logic in Isabelle/HOL 伊莎贝尔/人类逻辑中的斯塔尔纳克认识逻辑
Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-22 DOI: 10.4204/EPTCS.402.4
Laura P. Gamboa Guzman, Kristin Y. Rozier
{"title":"Stalnaker's Epistemic Logic in Isabelle/HOL","authors":"Laura P. Gamboa Guzman, Kristin Y. Rozier","doi":"10.4204/EPTCS.402.4","DOIUrl":"https://doi.org/10.4204/EPTCS.402.4","url":null,"abstract":"The foundations of formal models for epistemic and doxastic logics often rely on certain logical aspects of modal logics such as S4 and S4.2 and their semantics; however, the corresponding mathematical results are often stated in papers or books without including a detailed proof, or a reference to it, that allows the reader to convince themselves about them. We reinforce the foundations of the epistemic logic S4.2 for countably many agents by formalizing its soundness and completeness results for the class of all weakly-directed pre-orders in the proof assistant Isabelle/HOL. This logic corresponds to the knowledge fragment, i.e., the logic for formulas that may only include knowledge modalities in Stalnaker's system for knowledge and belief. Additionally, we formalize the equivalence between two axiomatizations for S4, which are used depending on the type of semantics given to the modal operators, as one is commonly used for the relational semantics, and the other one arises naturally from the topological semantics.","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"9 12","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140674797","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
Data Abstraction, Arrays, Maps, and Completeness, aka "Cell Morphing" 数据抽象、数组、地图和完备性，又称 "细胞变形"
Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-22 DOI: 10.4204/eptcs.402.9
David Monniaux
{"title":"Data Abstraction, Arrays, Maps, and Completeness, aka \"Cell Morphing\"","authors":"David Monniaux","doi":"10.4204/eptcs.402.9","DOIUrl":"https://doi.org/10.4204/eptcs.402.9","url":null,"abstract":"","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"21 22","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140672395","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
Proceedings 18th International Workshop on Logical and Semantic Frameworks, with Applications and 10th Workshop on Horn Clauses for Verification and Synthesis 第 18 届逻辑和语义框架及应用国际研讨会暨第 10 届用于验证和合成的角分句研讨会论文集
Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-21 DOI: 10.4204/EPTCS.402
Temur Kutsia, Daniel Ventura, David Monniaux, Jos'e F. Morales
{"title":"Proceedings 18th International Workshop on Logical and Semantic Frameworks, with Applications and 10th Workshop on Horn Clauses for Verification and Synthesis","authors":"Temur Kutsia, Daniel Ventura, David Monniaux, Jos'e F. Morales","doi":"10.4204/EPTCS.402","DOIUrl":"https://doi.org/10.4204/EPTCS.402","url":null,"abstract":"This volume contains * The post-proceedings of the Eighteenth Logical and Semantic Frameworks with Applications (LSFA 2023). The meeting was held on July 1-2, 2023, organised by the Sapienza Universit`a di Roma, Italy. LSFA aims to bring researchers and students interested in theoretical and practical aspects of logical and semantic frameworks and their applications. The covered topics include proof theory, type theory and rewriting theory, specification and deduction languages, and formal semantics of languages and systems. * The post-proceedings of the Tenth Workshop on Horn clauses for Verification and Synthesis (HCVS 2023). The meeting was held on April 23, 2023 at the Institut Henri Poincar'e in Paris. HCVS aims to bring together researchers working in the two communities of constraint/ logic programming (e.g., ICLP and CP), program verification (e.g., CAV, TACAS, and VMCAI), and automated deduction (e.g., CADE, IJCAR), on the topics of Horn clause based analysis, verification, and synthesis.","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"109 48","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140678556","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
Session Types for the Transport Layer: Towards an Implementation of TCP 传输层的会话类型：实现 TCP
Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-05 DOI: 10.4204/EPTCS.401.3
Samuel Cavoj, Ivan Nikitin, Colin Perkins, Ornela Dardha
{"title":"Session Types for the Transport Layer: Towards an Implementation of TCP","authors":"Samuel Cavoj, Ivan Nikitin, Colin Perkins, Ornela Dardha","doi":"10.4204/EPTCS.401.3","DOIUrl":"https://doi.org/10.4204/EPTCS.401.3","url":null,"abstract":"Session types are a typing discipline used to formally describe communication-driven applications with the aim of fewer errors and easier debugging later into the life cycle of the software. Protocols at the transport layer such as TCP, UDP, and QUIC underpin most of the communication on the modern Internet and affect billions of end-users. The transport layer has different requirements and constraints compared to the application layer resulting in different requirements for verification. Despite this, to our best knowledge, no work shows the application of session types at the transport layer. In this work, we discuss how multiparty session types (MPST) can be applied to implement the TCP protocol. We develop an MPST-based implementation of a subset of a TCP server in Rust and test its interoperability against the Linux TCP stack. Our results highlight the differences in assumptions between session type theory and the way transport layer protocols are usually implemented. This work is the first step towards bringing session types into the transport layer.","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"37 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140736553","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
Verified Secure Routing 经过验证的安全路由
Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-05 DOI: 10.4204/eptcs.401.0.2
Peter Müller
{"title":"Verified Secure Routing","authors":"Peter Müller","doi":"10.4204/eptcs.401.0.2","DOIUrl":"https://doi.org/10.4204/eptcs.401.0.2","url":null,"abstract":"","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"194 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140740478","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
Simple MultiParty Sessions 简单的多方会议
Electronic Proceedings in Theoretical Computer Science Pub Date : 2024-04-05 DOI: 10.4204/eptcs.401.0.1
M. Dezani-Ciancaglini
{"title":"Simple MultiParty Sessions","authors":"M. Dezani-Ciancaglini","doi":"10.4204/eptcs.401.0.1","DOIUrl":"https://doi.org/10.4204/eptcs.401.0.1","url":null,"abstract":"","PeriodicalId":30085,"journal":{"name":"Electronic Proceedings in Theoretical Computer Science","volume":"25 17","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140738126","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信