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

Journal of Logical and Algebraic Methods in Programming最新文献

筛选
英文 中文
An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis 用于通用符号协议分析的具有不可约性和SMT约束的高效规范化窄化实现
IF 0.9 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-10-01 Epub Date: 2023-07-25 DOI: 10.1016/j.jlamp.2023.100895
Raúl López-Rueda, Santiago Escobar, Julia Sapiña
{"title":"An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis","authors":"Raúl López-Rueda,&nbsp;Santiago Escobar,&nbsp;Julia Sapiña","doi":"10.1016/j.jlamp.2023.100895","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100895","url":null,"abstract":"<div><p>Narrowing and unification are very useful tools for symbolic analysis of rewrite theories, and thus for any model that can be specified in that way. A very clear example of their application is the field of formal cryptographic protocol analysis, which is why narrowing and unification are used in tools such as Maude-NPA, Tamarin and Akiss. In this work we present the implementation of a canonical narrowing algorithm, which improves the standard narrowing algorithm, extended to be able to process rewrite theories with conditional rules. The conditions of the rules will contain SMT constraints, which will be carried throughout the execution of the algorithm to determine if the solutions have associated satisfiable or unsatisfiable constraints, and in the latter case, discard them.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"135 ","pages":"Article 100895"},"PeriodicalIF":0.9,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49876057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
ElixirST: A session-based type system for Elixir modules ElixirST: Elixir模块的基于会话的类型系统
IF 0.9 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-10-01 Epub Date: 2023-07-04 DOI: 10.1016/j.jlamp.2023.100891
Adrian Francalanza, Gerard Tabone
{"title":"ElixirST: A session-based type system for Elixir modules","authors":"Adrian Francalanza,&nbsp;Gerard Tabone","doi":"10.1016/j.jlamp.2023.100891","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100891","url":null,"abstract":"<div><p>This paper investigates the adaptation of session types to provide behavioural information about Elixir modules. We devise a type system, called <span>ElixirST</span><span>, which statically determines whether functions in an Elixir module observe their endpoint specifications, expressed as session types; a corresponding tool automating this typechecking has also been constructed. In this paper we also formally validate this type system. An LTS-based operational semantics for the language fragment supported by the type system is developed, modelling its runtime behaviour when interacting with the module client. This operational semantics is then used to prove a form of session fidelity and progress for </span><span>ElixirST</span>.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"135 ","pages":"Article 100891"},"PeriodicalIF":0.9,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49876050","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Fundamentals of compositional rewriting theory 作文重写理论的基本原理
IF 0.9 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-10-01 Epub Date: 2023-07-18 DOI: 10.1016/j.jlamp.2023.100893
Nicolas Behr , Russ Harmer , Jean Krivine
{"title":"Fundamentals of compositional rewriting theory","authors":"Nicolas Behr ,&nbsp;Russ Harmer ,&nbsp;Jean Krivine","doi":"10.1016/j.jlamp.2023.100893","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100893","url":null,"abstract":"<div><p>A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically structure the large collection of lemmata used in the proofs of theorems such as concurrency and associativity. The resulting highly generic proofs of these theorems are given. It is noteworthy that the proof of the concurrency theorem takes only a few lines and, while that of associativity remains somewhat longer, it would be unreadably long if written directly in terms of the basic lemmata. In essence, our framework improves the readability and ease of comprehension of these proofs by exposing latent modularity. A curated list of known instances of our framework is used to conclude the paper with a detailed discussion of the conditions under which the Double Pushout and Sesqui-Pushout semantics of graph transformation are compositional.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"135 ","pages":"Article 100893"},"PeriodicalIF":0.9,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49876053","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Liquidity analysis in resource-aware programming 资源感知规划中的流动性分析
IF 0.9 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-10-01 Epub Date: 2023-06-16 DOI: 10.1016/j.jlamp.2023.100889
Cosimo Laneve
{"title":"Liquidity analysis in resource-aware programming","authors":"Cosimo Laneve","doi":"10.1016/j.jlamp.2023.100889","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100889","url":null,"abstract":"<div><p>Liquidity is a liveness property of programs managing resources that pinpoints those programs not freezing any resource forever. We consider a simple stateful language whose resources are assets (digital currencies, non fungible tokens, etc.). Then we define a type system that tracks in a symbolic way the input-output behavior of functions with respect to assets. These types and their composition, which define types of computations, allow us to design two algorithms for liquidity that have different precisions and costs. We also demonstrate the correctness of the algorithms.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"135 ","pages":"Article 100889"},"PeriodicalIF":0.9,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49876049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Program equivalence in a typed probabilistic call-by-need functional language 类型化概率按需调用函数语言中的程序等价
IF 0.9 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-10-01 DOI: 10.1016/j.jlamp.2023.100904
M. Schmidt-Schauß, David Sabel
{"title":"Program equivalence in a typed probabilistic call-by-need functional language","authors":"M. Schmidt-Schauß, David Sabel","doi":"10.1016/j.jlamp.2023.100904","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100904","url":null,"abstract":"","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"44 1","pages":"100904"},"PeriodicalIF":0.9,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54463367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Composition of synchronous communicating systems 同步通信系统的组成
IF 0.9 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-10-01 Epub Date: 2023-07-12 DOI: 10.1016/j.jlamp.2023.100890
Franco Barbanera , Ivan Lanese , Emilio Tuosto
{"title":"Composition of synchronous communicating systems","authors":"Franco Barbanera ,&nbsp;Ivan Lanese ,&nbsp;Emilio Tuosto","doi":"10.1016/j.jlamp.2023.100890","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100890","url":null,"abstract":"<div><p>Communication is an essential element of modern software, yet programming and analysing communicating systems are difficult tasks.</p><p>A reason for this difficulty is the lack of compositional mechanisms that preserve relevant communication properties. This problem has been recently addressed for the well-known model of <em>communicating systems</em>, that is sets of components consisting of finite-state machines capable of exchanging messages. Two communicating systems can be composed by selecting one component per system, and transforming both of them into coupled gateways connecting the two systems. More precisely, a gateway forwards a message received from within its system to the other gateway, which then delivers the message to the other system. Suitable <em>compatibility</em><span><span> conditions between gateways have been proved sufficient for this composition mechanism to preserve properties such as deadlock freedom for asynchronous as well as symmetric </span>synchronous communications (where sender and receiver play the same part in determining which message to exchange).</span></p><p>The present paper gives a comprehensive treatment of the case of synchronous communications. We consider both <em>symmetric synchronous</em> communications and <em>asymmetric synchronous</em> communications (where senders decide independently which message should be exchanged). The composition mechanism preserves different properties under different conditions depending on the considered type of synchronous communication. We show here that preservation of lock freedom requires an additional condition on gateways for asymmetric communication. Such condition is also needed for preservation of deadlock freedom, lock freedom or strong lock freedom for symmetric communications. This is not needed, instead, for preservation of either deadlock freedom or strong lock freedom with asymmetric interactions.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"135 ","pages":"Article 100890"},"PeriodicalIF":0.9,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49876052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Program equivalence in a typed probabilistic call-by-need functional language 类型化概率按需调用函数语言中的程序等价
IF 0.9 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-10-01 Epub Date: 2023-08-16 DOI: 10.1016/j.jlamp.2023.100904
Manfred Schmidt-Schauß, David Sabel
{"title":"Program equivalence in a typed probabilistic call-by-need functional language","authors":"Manfred Schmidt-Schauß,&nbsp;David Sabel","doi":"10.1016/j.jlamp.2023.100904","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100904","url":null,"abstract":"<div><p>We extend a call-by-need variant of PCF with a binary probabilistic fair choice operator, which makes a lazy and typed variant of probabilistic functional programming. We define a contextual equivalence that respects the expected convergence of expressions and prove a corresponding context lemma. This enables us to show correctness of several program transformations with respect to contextual equivalence. Distribution-equivalence of expressions of numeric type is introduced. While the notion of contextual equivalence stems from program semantics, the notion of distribution equivalence is a direct description of the stochastic model. Our main result is that both notions are compatible: We show that for closed expressions of numeric type contextual equivalence and distribution-equivalence coincide. This provides a strong and often operationally feasible criterion for contextual equivalence of expressions and programs.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"135 ","pages":"Article 100904"},"PeriodicalIF":0.9,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49876058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Specification and modelling of computing systems through graphs and graph transformation 通过图和图变换对计算系统进行规范和建模
IF 0.9 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-10-01 Epub Date: 2023-09-12 DOI: 10.1016/j.jlamp.2023.100905
Fabio Gadducci , Timo Kehrer
{"title":"Specification and modelling of computing systems through graphs and graph transformation","authors":"Fabio Gadducci ,&nbsp;Timo Kehrer","doi":"10.1016/j.jlamp.2023.100905","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100905","url":null,"abstract":"<div><p>This special issue collects extended versions of selected papers presented at the 14th International Conference on Graph Transformation (ICGT 2021), held on June 24 and 25, 2021, as a virtual event due to ongoing COVID-19 countermeasures and travel restrictions.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"135 ","pages":"Article 100905"},"PeriodicalIF":0.9,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49876051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An axiomatic approach to differentiation of polynomial circuits 多项式电路微分的公理化方法
IF 0.9 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-10-01 Epub Date: 2023-06-30 DOI: 10.1016/j.jlamp.2023.100892
Paul Wilson , Fabio Zanasi
{"title":"An axiomatic approach to differentiation of polynomial circuits","authors":"Paul Wilson ,&nbsp;Fabio Zanasi","doi":"10.1016/j.jlamp.2023.100892","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100892","url":null,"abstract":"<div><p>Reverse derivative categories (RDCs) have recently been shown to be a suitable semantic framework for studying machine learning algorithms. Whereas emphasis has been put on training methodologies, less attention has been devoted to particular <em>model classes</em>: the concrete categories whose morphisms represent machine learning models. In this paper we study presentations by generators and equations of classes of RDCs. In particular, we propose <em>polynomial circuits</em> as a suitable machine learning model class. We give an axiomatisation for these circuits and prove a functional completeness result. Finally, we discuss the use of polynomial circuits over specific semirings to perform machine learning with discrete values.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"135 ","pages":"Article 100892"},"PeriodicalIF":0.9,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49876054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting 将指定运行时错误的不发生减少为约束重写的全路径可达性问题
IF 0.9 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-10-01 Epub Date: 2023-08-05 DOI: 10.1016/j.jlamp.2023.100903
Misaki Kojima, Naoki Nishida
{"title":"Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting","authors":"Misaki Kojima,&nbsp;Naoki Nishida","doi":"10.1016/j.jlamp.2023.100903","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100903","url":null,"abstract":"<div><p>A concurrent program with semaphore-based exclusive control can be modeled by a logically constrained term rewrite system. In this paper, we first propose a framework to reduce the non-occurrence of a specified runtime error in the program to an all-path reachability problem of the transformed logically constrained term rewrite system. Here, an all-path reachability problem of the system is a pair of state sets and is demonically valid if every finite execution path starting with a state in the first set and ending with a terminating state includes a state in the second set. Then, we propose a weakened but easily-implementable variant of an existing proof system for all-path reachability problems. As a case study, we deal with the race freedom of concurrent programs with semaphore-based exclusive control.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"135 ","pages":"Article 100903"},"PeriodicalIF":0.9,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49876055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"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学术文献互助群
群 号：604180095
Book学术官方微信
小红书