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

Composition of synchronous communicating systems 同步通信系统的组成

IF 0.9 4区数学

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

Franco Barbanera , Ivan Lanese , Emilio Tuosto

{"title":"Composition of synchronous communicating systems","authors":"Franco Barbanera , Ivan Lanese , Emilio Tuosto","doi":"10.1016/j.jlamp.2023.100890","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100890","url":null,"abstract":"<div>Communication is an essential element of modern software, yet programming and analysing communicating systems are difficult tasks.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 communicating systems, 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 compatibility conditions between gateways have been proved sufficient for this composition mechanism to preserve properties such as deadlock freedom for asynchronous as well as symmetric synchronous communications (where sender and receiver play the same part in determining which message to exchange).The present paper gives a comprehensive treatment of the case of synchronous communications. We consider both symmetric synchronous communications and asymmetric synchronous 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.</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 DOI: 10.1016/j.jlamp.2023.100904

Manfred Schmidt-Schauß, David Sabel

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

Fabio Gadducci , Timo Kehrer

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

Paul Wilson , Fabio Zanasi

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

Misaki Kojima, Naoki Nishida

引用次数: 0

Operationally-based program equivalence proofs using LCTRSs 使用lctrs的基于操作的程序等价证明

IF 0.9 4区数学

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

Ştefan Ciobâcă, Dorel Lucanu, Andrei Sebastian Buruiană

{"title":"Operationally-based program equivalence proofs using LCTRSs","authors":"Ştefan Ciobâcă, Dorel Lucanu, Andrei Sebastian Buruiană","doi":"10.1016/j.jlamp.2023.100894","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100894","url":null,"abstract":"<div>We propose an operationally-based framework for deductive proofs of program equivalence. It is based on encoding the language semantics as logically constrained term rewriting systems (LCTRSs) and the two programs as terms. As a novelty of our method, we show that it enables relational reasoning about programs in various settings, which are encoded in the operational semantics. For example, we show how our method can be used to prove programs that are equivalent when considering an unbounded stack, but where the equivalence fails to hold if the stack is bounded. We also show how to formalize read-sets and write-sets of symbolic expressions and statements by extending the operational semantics in a conservative way. This enables the relational verification of program schemas, which we exploit to prove compiler optimizations that cannot be handled by other tools. Our method requires an extension of standard LCTRSs with axiomatized symbols, which generate new research questions. We also present a prototype implementation that proves the practical feasibility of our approach.</div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"135 ","pages":"Article 100894"},"PeriodicalIF":0.9,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49876056","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

Branching pomsets: Design, expressiveness and applications to choreographies 分支集:设计、表达和对编排的应用

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-09-20 DOI: 10.1016/j.jlamp.2023.100919

Luc Edixhoven , Sung-Shik Jongmans , José Proença , Ilaria Castellani

{"title":"Branching pomsets: Design, expressiveness and applications to choreographies","authors":"Luc Edixhoven , Sung-Shik Jongmans , José Proença , Ilaria Castellani","doi":"10.1016/j.jlamp.2023.100919","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100919","url":null,"abstract":"<div>Choreographic languages describe possible sequences of interactions among a set of agents. Typical models are based on languages or automata over sending and receiving actions. Pomsets provide a more compact alternative by using a partial order to explicitly represent causality and concurrency between these actions. However, pomsets offer no representation of choices, thus a set of pomsets is required to represent branching behaviour. For example, if an agent Alice can send one of two possible messages to Bob three times, one would need a set of <math><mn>2</mn><mo>×</mo><mn>2</mn><mo>×</mo><mn>2</mn></math> distinct pomsets to represent all possible branches of Alice's behaviour. This paper proposes an extension of pomsets, named branching pomsets, with a branching structure that can represent Alice's behaviour using <math><mn>2</mn><mo>+</mo><mn>2</mn><mo>+</mo><mn>2</mn></math> ordered actions. We compare the expressiveness of branching pomsets with that of several forms of event structures from the literature. We encode choreographies as branching pomsets and show that the pomset semantics of the encoded choreographies are bisimilar to their operational semantics. Furthermore, we define well-formedness conditions on branching pomsets, inspired by multiparty session types, and we prove that the well-formedness of a branching pomset is a sufficient condition for the realisability of the represented communication protocol. Finally, we present a prototype tool that implements our theory of branching pomsets, focusing on its applications to choreographies.</div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"136 ","pages":"Article 100919"},"PeriodicalIF":0.9,"publicationDate":"2023-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49875053","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 generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework 用于类图结构交叉的通用构造及其在Eclipse建模框架中的实现

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2023-09-09 DOI: 10.1016/j.jlamp.2023.100909

Jens Kosiol , Stefan John , Gabriele Taentzer

引用次数: 0

Weighted automata extraction and explanation of recurrent neural networks for natural language tasks 自然语言任务中递归神经网络的加权自动机提取与解释

IF 0.9 4区数学

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

Zeming Wei , Xiyue Zhang , Yihao Zhang , Meng Sun

{"title":"Weighted automata extraction and explanation of recurrent neural networks for natural language tasks","authors":"Zeming Wei , Xiyue Zhang , Yihao Zhang , Meng Sun","doi":"10.1016/j.jlamp.2023.100907","DOIUrl":"https://doi.org/10.1016/j.jlamp.2023.100907","url":null,"abstract":"<div>Recurrent Neural Networks (RNNs) have achieved tremendous success in processing sequential data, yet understanding and analyzing their behaviours remains a significant challenge. To this end, many efforts have been made to extract finite automata from RNNs, which are more amenable for analysis and explanation. However, existing approaches like exact learning and compositional approaches for model extraction have limitations in either scalability or precision. In this paper, we propose a novel framework of Weighted Finite Automata (WFA) extraction and explanation to tackle the limitations for natural language tasks. First, to address the transition sparsity and context loss problems we identified in WFA extraction for natural language tasks, we propose an empirical method to complement missing rules in the transition diagram, and adjust transition matrices to enhance the context-awareness of the WFA. We also propose two data augmentation tactics to track more dynamic behaviours of RNN, which further allows us to improve the extraction precision. Based on the extracted model, we propose an explanation method for RNNs including a word embedding method – Transition Matrix Embeddings (TME) and TME-based task oriented explanation for the target RNN. Our evaluation demonstrates the advantage of our method in extraction precision than existing approaches, and the effectiveness of TME-based explanation method in applications to pretraining and adversarial example generation.</div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"136 ","pages":"Article 100907"},"PeriodicalIF":0.9,"publicationDate":"2023-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49875056","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

On algebraic array theories 论代数数组理论

IF 0.9 4区数学

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

Rodrigo Raya, Viktor Kunčak

引用次数: 2