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

International Workshop/Symposium on Logic-based Program Synthesis and Transformation最新文献

筛选
英文 中文
A Reusable Machine-Calculus for Automated Resource Analyses 用于资源自动分析的可重复使用的机器计算
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2023-10-23 DOI: 10.1007/978-3-031-45784-5_5
Hector Suzanne, Emmanuel Chailloux
{"title":"A Reusable Machine-Calculus for Automated Resource Analyses","authors":"Hector Suzanne, Emmanuel Chailloux","doi":"10.1007/978-3-031-45784-5_5","DOIUrl":"https://doi.org/10.1007/978-3-031-45784-5_5","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"83 1","pages":"61-79"},"PeriodicalIF":0.0,"publicationDate":"2023-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139315363","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
Towards a Certified Proof Checker for Deep Neural Network Verification 面向深度神经网络验证的认证证明检查器
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2023-07-12 DOI: 10.48550/arXiv.2307.06299
Remi Desmartin, Omri Isac, G. Passmore, Kathrin Stark, Guy Katz, Ekaterina Komendantskaya
{"title":"Towards a Certified Proof Checker for Deep Neural Network Verification","authors":"Remi Desmartin, Omri Isac, G. Passmore, Kathrin Stark, Guy Katz, Ekaterina Komendantskaya","doi":"10.48550/arXiv.2307.06299","DOIUrl":"https://doi.org/10.48550/arXiv.2307.06299","url":null,"abstract":"Recent developments in deep neural networks (DNNs) have led to their adoption in safety-critical systems, which in turn has heightened the need for guaranteeing their safety. These safety properties of DNNs can be proven using tools developed by the verification community. However, these tools are themselves prone to implementation bugs and numerical stability problems, which make their reliability questionable. To overcome this, some verifiers produce proofs of their results which can be checked by a trusted checker. In this work, we present a novel implementation of a proof checker for DNN verification. It improves on existing implementations by offering numerical stability and greater verifiability. To achieve this, we leverage two key capabilities of Imandra, an industrial theorem prover: its support of infinite precision real arithmetic and its formal verification infrastructure. So far, we have implemented a proof checker in Imandra, specified its correctness properties and started to verify the checker's compliance with them. Our ongoing work focuses on completing the formal verification of the checker and further optimizing its performance.","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130874300","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 Logical Interpretation of Asynchronous Multiparty Compatibility 异步多方兼容性的逻辑解释
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2023-05-25 DOI: 10.48550/arXiv.2305.16240
Marco Carbone, Sonia Marin, C. Schürmann
{"title":"A Logical Interpretation of Asynchronous Multiparty Compatibility","authors":"Marco Carbone, Sonia Marin, C. Schürmann","doi":"10.48550/arXiv.2305.16240","DOIUrl":"https://doi.org/10.48550/arXiv.2305.16240","url":null,"abstract":"Session types are types for specifying the protocols that communicating processes must follow in a concurrent system. When composing two or more well-typed processes, a session typing system must check whether such processes are multiparty compatible, a property that guarantees that all sent messages are eventually received and no deadlock ever occurs. Previous work has shown that duality and the more general notion of coherence are sufficient syntactic conditions for guaranteeing the multiparty compatibility property. In this paper, following a propositions-as-types fashion which relates session types to linear logic, we generalise coherence to forwarders. Forwarders are processes that act as middleware by forwarding messages according to a given protocol. Our main result shows that forwarders not only generalise coherence, but fully capture all well-typed multiparty compatible processes.","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115347382","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
Typed SLD-Resolution: Dynamic Typing for Logic Programming 类型化sld解析:逻辑编程的动态类型化
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2022-07-30 DOI: 10.48550/arXiv.2208.00192
Joao Barbosa, Mário Florido, V. S. Costa
{"title":"Typed SLD-Resolution: Dynamic Typing for Logic Programming","authors":"Joao Barbosa, Mário Florido, V. S. Costa","doi":"10.48550/arXiv.2208.00192","DOIUrl":"https://doi.org/10.48550/arXiv.2208.00192","url":null,"abstract":"The semantic foundations for logic programming are usually separated into two different approaches. The operational semantics, which uses SLD-resolution, the proof method that computes answers in logic programming, and the declarative semantics, which sees logic programs as formulas and its semantics as models. Here, we define a new operational semantics called TSLD-resolution, which stands for Typed SLD-resolution, where we include a value\"wrong\", that corresponds to the detection of a type error at run-time. For this we define a new typed unification algorithm. Finally we prove the correctness of TSLD-resolution with respect to a typed declarative semantics.","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125436776","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
From Infinity to Choreographies: Extraction for Unbounded Systems 从无穷到编排:无界系统的抽取
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2022-07-18 DOI: 10.48550/arXiv.2207.08884
Bjørn Angel Kjær, L. Cruz-Filipe, F. Montesi
{"title":"From Infinity to Choreographies: Extraction for Unbounded Systems","authors":"Bjørn Angel Kjær, L. Cruz-Filipe, F. Montesi","doi":"10.48550/arXiv.2207.08884","DOIUrl":"https://doi.org/10.48550/arXiv.2207.08884","url":null,"abstract":". Choreographies are formal descriptions of distributed systems, which focus on the way in which participants communicate. While they are useful for analysing protocols, in practice systems are written directly by specifying each participant’s behaviour. This created the need for choreography extraction : the process of obtaining a choreography that faithfully describes the collective behaviour of all participants in a distributed protocol. Previous works have addressed this problem for systems with a predefined, finite number of participants. In this work, we show how to extract choreographies from system descriptions where the total number of participants is unknown and unbounded, due to the ability of spawning new processes at runtime. This extension is challenging, since previous algo-rithms relied heavily on the set of possible states of the network during execution being finite.","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115571309","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
Representation and Processing of Instantaneous and Durative Temporal Phenomena 瞬时与持续时间现象的表征与处理
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2021-08-27 DOI: 10.1007/978-3-030-98869-2_8
Manolis Pitsikalis, A. Lisitsa, Shan Luo
{"title":"Representation and Processing of Instantaneous and Durative Temporal Phenomena","authors":"Manolis Pitsikalis, A. Lisitsa, Shan Luo","doi":"10.1007/978-3-030-98869-2_8","DOIUrl":"https://doi.org/10.1007/978-3-030-98869-2_8","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122696974","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
Automating the Functional Correspondence between Higher-Order Evaluators and Abstract Machines 高阶求值器与抽象机函数对应的自动化
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2021-08-16 DOI: 10.1007/978-3-030-98869-2_3
Maciej Buszka, Dariusz Biernacki
{"title":"Automating the Functional Correspondence between Higher-Order Evaluators and Abstract Machines","authors":"Maciej Buszka, Dariusz Biernacki","doi":"10.1007/978-3-030-98869-2_3","DOIUrl":"https://doi.org/10.1007/978-3-030-98869-2_3","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126684299","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
Data Type Inference for Logic Programming 逻辑程序设计的数据类型推断
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2021-08-14 DOI: 10.1007/978-3-030-98869-2_2
Joao Barbosa, Mário Florido, V. S. Costa
{"title":"Data Type Inference for Logic Programming","authors":"Joao Barbosa, Mário Florido, V. S. Costa","doi":"10.1007/978-3-030-98869-2_2","DOIUrl":"https://doi.org/10.1007/978-3-030-98869-2_2","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121396605","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
Towards Substructural Property-Based Testing 迈向基于子结构特性的测试
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2021-08-03 DOI: 10.1007/978-3-030-98869-2_6
Marco Mantovani, A. Momigliano
{"title":"Towards Substructural Property-Based Testing","authors":"Marco Mantovani, A. Momigliano","doi":"10.1007/978-3-030-98869-2_6","DOIUrl":"https://doi.org/10.1007/978-3-030-98869-2_6","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121499935","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
Runtime Complexity Analysis of Logically Constrained Rewriting 逻辑约束重写的运行时复杂度分析
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2020-12-11 DOI: 10.1007/978-3-030-68446-4_2
S. Winkler, G. Moser
{"title":"Runtime Complexity Analysis of Logically Constrained Rewriting","authors":"S. Winkler, G. Moser","doi":"10.1007/978-3-030-68446-4_2","DOIUrl":"https://doi.org/10.1007/978-3-030-68446-4_2","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132247543","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
下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信