Journal of Logical and Algebraic Methods in Programming最新文献_第9页

On difunctions 据difunctions

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-08-01 DOI: 10.1016/j.jlamp.2023.100878

Roland Backhouse , José Nuno Oliveira

引用次数: 1

Computational category-theoretic rewriting 计算范畴论重写

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-08-01 DOI: 10.1016/j.jlamp.2023.100888

Kristopher Brown , Evan Patterson , Tyler Hanks , James Fairbanks

{"title":"Computational category-theoretic rewriting","authors":"Kristopher Brown , Evan Patterson , Tyler Hanks , James Fairbanks","doi":"10.1016/j.jlamp.2023.100888","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100888","url":null,"abstract":"<div><p>We demonstrate how category theory provides specifications that can efficiently be implemented via imperative algorithms and apply this to the field of graph transformation. By examples, we show how this paradigm of software development makes it easy to quickly write correct and performant code. We provide a modern implementation of graph rewriting techniques at the level of abstraction of finitely-presented <span><math><mi>C</mi></math></span>-sets and clarify the connections between <span><math><mi>C</mi></math></span><span>-sets and the typed graphs supported in existing rewriting software. We emphasize that our open-source library is extensible: by taking new categorical constructions (such as slice categories, structured cospans, and distributed graphs) and relating their limits and colimits to those of their underlying categories, users inherit efficient algorithms for pushout complements and (final) pullback complements. This allows one to perform double-, single-, and sesqui-pushout rewriting over a broad class of data structures. Graph transformation researchers, scientists, and engineers can then use this library to computationally manipulate rewriting systems and apply them to their domains of interest.</span></p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"134 ","pages":"Article 100888"},"PeriodicalIF":0.9,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49881538","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

Variants and satisfiability in the infinitary unification wonderland 无穷统一奇境中的变分与可满足性

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-08-01 DOI: 10.1016/j.jlamp.2023.100877

José Meseguer

{"title":"Variants and satisfiability in the infinitary unification wonderland","authors":"José Meseguer","doi":"10.1016/j.jlamp.2023.100877","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100877","url":null,"abstract":"<div><p><span>So far, results about variants, the finite variant property (FVP), variant unification, and variant satisfiability have been developed for equational theories </span><span><math><mi>E</mi><mo>∪</mo><mi>B</mi></math></span> where <em>B</em><span> is a set of axioms having a finitary unification algorithm, and the equations </span><em>E</em>, oriented as rewrite rules <span><math><mover><mrow><mi>E</mi></mrow><mrow><mo>→</mo></mrow></mover></math></span>, are convergent modulo <em>B</em>. The extension to the case when <em>B</em> has an infinitary unification algorithm, for example because of non-commutative symbols having associative axioms, was not developed. This paper develops such an extension. In particular, the relationships between the FVP and the boundedness (BP) properties, the identification of conditions on <span><math><mi>E</mi><mo>∪</mo><mi>B</mi></math></span> ensuring FVP, the effective computation of variants and variant unifiers, and criteria making possible the existence of variant satisfiability procedures for the initial algebras of theories <span><math><mi>E</mi><mo>∪</mo><mi>B</mi></math></span> that are either FVP or BP are all explored in detail. The extension from the finitary to the infinitary <em>B</em>-unification case includes some surprises. Furthermore, since all the results are extended beyond FVP theories to the wider class of BP theories, new opportunities are opened up to use these symbolic techniques in wider classes of theories and applications.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"134 ","pages":"Article 100877"},"PeriodicalIF":0.9,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49881569","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

A formal model for blockchain-based consent management in data sharing 数据共享中基于区块链的同意管理的正式模型

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-08-01 DOI: 10.1016/j.jlamp.2023.100886

Neda Peyrone , Duangdao Wichadakul

{"title":"A formal model for blockchain-based consent management in data sharing","authors":"Neda Peyrone , Duangdao Wichadakul","doi":"10.1016/j.jlamp.2023.100886","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100886","url":null,"abstract":"<div><p><span>Consent is one of six legal bases for personal data processing mentioned in the </span>General Data Protection Regulation<span><span> (GDPR). The GDPR is a privacy law giving European Union (EU) citizens authority over personal data. It enforces software systems to collect, analyze, and share only necessary information (‘data minimization’) following the specific purpose (‘consent’). The GDPR defines consent as permission of individuals (‘data subjects’) to give organizations (‘data controllers’) processing their personal data. Without a data subject's consent, the data controller processes personal data unlawfully. Therefore, consent management is an essential component of a software system to build data subjects' trust and engagement. However, sharing data can lead to a potential loss of control over personal data, as data are across boundaries between software services. One of the significant risks is caused by a lack of developers' experience in data protection practices. Hence, in this paper, we propose to use blockchain technology to manage data subjects' informed consent for data sharing to build trust, transparency, and traceability to share data across software services. We formalized the semantics of </span>smart contracts<span> to extend the blockchain features to validate the consent authorization and manage the request-response interaction between the services. Furthermore, we used the Event-B method to describe the dynamic behavior of the proposed model and prove its correctness. Finally, we provided a mapping from the formal model to a smart contract class diagram and a prototype called SmartDataTrust implemented with solidity and Python REST API that developers can easily utilize.</span></span></p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"134 ","pages":"Article 100886"},"PeriodicalIF":0.9,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49881541","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

Verification of mutable linear data structures and iterator-based algorithms in Dafny 可变线性数据结构的验证和基于迭代器的Dafny算法

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-08-01 DOI: 10.1016/j.jlamp.2023.100875

Jorge Blázquez, Manuel Montenegro, Clara Segura

引用次数: 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-08-01 DOI: 10.1016/j.jlamp.2023.100903

Misaki Kojima, Naoki Nishida

引用次数: 0

The Maude strategy language Maude战略语言

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-08-01 DOI: 10.1016/j.jlamp.2023.100887

Steven Eker , Narciso Martí-Oliet , José Meseguer , Rubén Rubio , Alberto Verdejo

{"title":"The Maude strategy language","authors":"Steven Eker , Narciso Martí-Oliet , José Meseguer , Rubén Rubio , Alberto Verdejo","doi":"10.1016/j.jlamp.2023.100887","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100887","url":null,"abstract":"<div><p>Rewriting logic is a natural and expressive framework for the specification of concurrent systems and logics. The Maude specification language provides an implementation of this formalism that allows executing, verifying, and analyzing the represented systems. These specifications declare their objects by means of terms and equations, and provide rewriting rules to represent potentially non-deterministic local transformations on the state. Sometimes a controlled application of these rules is required to reduce non-determinism, to capture global, goal-oriented or efficiency concerns, or to select specific executions for their analysis. That is what we call a strategy. In order to express them, respecting the separation of concerns principle, a Maude strategy language was proposed and developed. The first implementation of the strategy language was done in Maude itself using its reflective features. After ample experimentation, some more features have been added and, for greater efficiency, the strategy language has been implemented in C++ as an integral part of the Maude system. This paper describes the Maude strategy language along with its semantics, its implementation decisions, and several application examples from various fields.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"134 ","pages":"Article 100887"},"PeriodicalIF":0.9,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49881540","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

Formal lumping of polynomial differential equations through approximate equivalences 通过近似等价的多项式微分方程的形式集总

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-08-01 DOI: 10.1016/j.jlamp.2023.100876

Luca Cardelli , Giuseppe Squillace , Mirco Tribastone , Max Tschaikowski , Andrea Vandin

{"title":"Formal lumping of polynomial differential equations through approximate equivalences","authors":"Luca Cardelli , Giuseppe Squillace , Mirco Tribastone , Max Tschaikowski , Andrea Vandin","doi":"10.1016/j.jlamp.2023.100876","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100876","url":null,"abstract":"<div><p>It is well known that exact notions of model abstraction and reduction for dynamical systems may not be robust enough in practice because they are highly sensitive to the specific choice of parameters. In this paper we consider this problem for nonlinear ordinary differential equations (ODEs) with polynomial derivatives. We introduce a model reduction technique based on <em>approximate differential equivalence</em>, i.e., a partition of the set of ODE variables that performs an aggregation when the variables are governed by nearby derivatives. We develop algorithms to (i) compute the largest approximate differential equivalence; (ii) construct an approximately reduced model from the original one via an appropriate perturbation of the coefficients of the polynomials; and (iii) provide a formal certificate on the quality of the approximation as an error bound, computed as an over-approximation of the reachable set of the reduced model. Finally, we apply approximate differential equivalences to case studies on electric circuits, biological models, and polymerization reaction networks.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"134 ","pages":"Article 100876"},"PeriodicalIF":0.9,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49881542","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-07-01 DOI: 10.1016/j.jlamp.2023.100890

F. Barbanera, Ivan Lanese, E. Tuosto

引用次数: 0

Formalization of the inverse kinematics of three-fingered dexterous hand 三指灵巧手逆运动学的形式化

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-06-01 DOI: 10.1016/j.jlamp.2023.100861

Guohui Wang , Shanyan Chen , Yong Guan , Zhiping Shi , Ximeng Li , Jingzhi Zhang

{"title":"Formalization of the inverse kinematics of three-fingered dexterous hand","authors":"Guohui Wang , Shanyan Chen , Yong Guan , Zhiping Shi , Ximeng Li , Jingzhi Zhang","doi":"10.1016/j.jlamp.2023.100861","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100861","url":null,"abstract":"<div><p><span>As an effective extension of human limbs, dexterous robotic hands based on cyber-physical systems (CPS) are used to perform diverse tasks in industrial production, medical operation, outer-space exploration, etc. The reliable functioning of dexterous robotic hands depends on the proper modeling and solving of </span>inverse kinematics<span> problems in the design phase. The traditional D-H parameter method for modeling and solving inverse kinematics problems<span><span> suffers from the singularity problem, which is avoided by methods based on the screw theory. However, the manual or computer-simulation-based development of these methods could suffer from human errors and software defects. In this paper, we address this problem by using formal techniques and tools to develop a screw-theory-based method. Firstly, we formalize theories related to the Paden-Kahan sub-problem in an interactive </span>theorem prover. Secondly, we construct a formal model for solving the inverse kinematics problem for robotic systems. Lastly, taking the three-fingered dexterous hand as a case study, we formally verified its inverse kinematics solutions. The results presented in this article help guarantee a level of safety for robotic systems that is beyond achievable by manual and computer-simulation-based development methods.</span></span></p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"133 ","pages":"Article 100861"},"PeriodicalIF":0.9,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50203600","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