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

A nesting-preserving transformation of SIMP programs into logically constrained term rewrite systems SIMP程序到逻辑约束项重写系统的保嵌套转换

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-03-01 Epub Date: 2025-01-28 DOI: 10.1016/j.jlamp.2025.101045

Naoki Nishida, Misaki Kojima , Ayuka Matsumi

{"title":"A nesting-preserving transformation of SIMP programs into logically constrained term rewrite systems","authors":"Naoki Nishida, Misaki Kojima , Ayuka Matsumi","doi":"10.1016/j.jlamp.2025.101045","DOIUrl":"10.1016/j.jlamp.2025.101045","url":null,"abstract":"<div><div>In the last decade, several transformations of an imperative program into a logically constrained term rewrite system (LCTRS, for short) have been investigated and extended. They do not preserve the nesting of statements, generating rewrite rules like transition systems, while function calls are represented by the nesting of function symbols. Structural features of the original program must often be useful in analyzing the transformed LCTRS. To use such features, we have to know how to transform the program into the LCTRS by keeping the correspondence between statements in the program and the introduced auxiliary function symbols in the LCTRS, or by transforming the LCTRS into a control flow graph to, e.g., recover loop information. In this paper, we propose a nesting-preserving transformation of a SIMP program (a C-like integer program) into an LCTRS. The transformation is mostly based on previous work and introduces the nesting of function symbols that correspond to the nesting of statements in the original program. To be more precise, we propose a construction of a tree homomorphism which is used as a post-process of the transformation in previous work, i.e., which is applied to the LCTRS obtained from the program. As a correctness statement for the nesting-preserving transformation, we show that the tree homomorphism is sound and complete for the reduction of the LCTRS.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"144 ","pages":"Article 101045"},"PeriodicalIF":0.7,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143092825","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

Inductive reasoning with equality predicates, contextual rewriting and variant-based simplification 具有相等谓词的归纳推理、上下文重写和基于变量的简化

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-03-01 Epub Date: 2025-01-16 DOI: 10.1016/j.jlamp.2025.101036

José Meseguer

引用次数: 0

Generation of algebraic data type values using evolutionary algorithms 利用进化算法生成代数数据类型值

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-02-01 Epub Date: 2024-11-13 DOI: 10.1016/j.jlamp.2024.101022

Ignacio Ballesteros , Clara Benac-Earle , Julio Mariño , Lars-Åke Fredlund , Ángel Herranz

{"title":"Generation of algebraic data type values using evolutionary algorithms","authors":"Ignacio Ballesteros , Clara Benac-Earle , Julio Mariño , Lars-Åke Fredlund , Ángel Herranz","doi":"10.1016/j.jlamp.2024.101022","DOIUrl":"10.1016/j.jlamp.2024.101022","url":null,"abstract":"<div><div>Automatic data generation is a key component of automated software testing. Random generation of test input data can uncover some bugs in software, but its effectiveness decreases when those inputs must satisfy complex properties in order to be meaningful. In this work, we study an evolutionary approach to generate values that can be encoded as algebraic data types plus additional properties. First, the approach is illustrated with the generation of sorted lists. Then, we generalize the technique to arbitrary algebraic data type definitions. Finally, we consider the problem of constrained data types where the data must satisfy some nontrivial property, using the well-known example of red-black trees for our experiments. This example will allow us to introduce the main principles of evolutionary algorithms and how these principles can be applied to obtain valid, nontrivial samples of a given data structure. Our experiments have revealed that this evolutionary approach is able to improve diversity, and increase the size of valid generated values with respect to simple random sampling techniques.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"143 ","pages":"Article 101022"},"PeriodicalIF":0.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142701496","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

Logic and Calculi for All on the occasion of Luís Barbosa’s 60th birthday 在Luís巴博萨60岁生日之际，为大家展示逻辑与微积分

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-02-01 Epub Date: 2024-11-12 DOI: 10.1016/j.jlamp.2024.101023

Alexandre Madeira , José Nuno Oliveira , José Proença , Renato Neves

引用次数: 0

Transforming concurrent programs with semaphores into logically constrained term rewrite systems 将带有信号量的并发程序转换为逻辑约束的术语重写系统

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-02-01 Epub Date: 2024-12-13 DOI: 10.1016/j.jlamp.2024.101033

Misaki Kojima , Naoki Nishida, Yutaka Matsubara

引用次数: 0

Formalization and analysis of the post-quantum signature scheme FALCON with Maude 基于Maude的后量子签名方案FALCON的形式化分析

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-02-01 Epub Date: 2024-12-16 DOI: 10.1016/j.jlamp.2024.101034

Víctor García , Santiago Escobar , Kazuhiro Ogata

引用次数: 0

Towards a type-based abstract semantics for Python 为Python实现基于类型的抽象语义

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-02-01 Epub Date: 2024-12-10 DOI: 10.1016/j.jlamp.2024.101032

Andrei Nacu

引用次数: 0

Comparing session type systems derived from linear logic 比较源自线性逻辑的会话类型系统

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-01-01 Epub Date: 2024-08-22 DOI: 10.1016/j.jlamp.2024.101004

Bas van den Heuvel , Jorge A. Pérez

{"title":"Comparing session type systems derived from linear logic","authors":"Bas van den Heuvel , Jorge A. Pérez","doi":"10.1016/j.jlamp.2024.101004","DOIUrl":"10.1016/j.jlamp.2024.101004","url":null,"abstract":"<div><p><em>Session types</em> are a typed approach to message-passing concurrency, where types describe sequences of intended exchanges over channels. Session type systems have been given strong logical foundations via Curry-Howard correspondences with <em>linear logic</em>, a resource-aware logic that naturally captures structured interactions. These logical foundations provide an elegant framework to specify and (statically) verify message-passing processes.</p><p>In this paper, we rigorously compare different type systems for concurrency derived from the Curry-Howard correspondence between linear logic and session types. We address the main divide between these type systems: the classical and intuitionistic presentations of linear logic. Over the years, these presentations have given rise to separate research strands on logical foundations for concurrency; the differences between their derived type systems have only been addressed informally.</p><p>To formally assess these differences, we develop <span><math><mi>π</mi><mrow><mi>ULL</mi></mrow></math></span>, a session type system that encompasses type systems derived from classical and intuitionistic interpretations of linear logic. Based on a fragment of Girard's Logic of Unity, <span><math><mi>π</mi><mrow><mi>ULL</mi></mrow></math></span> provides a basic reference framework: we compare existing session type systems by characterizing fragments of <span><math><mi>π</mi><mrow><mi>ULL</mi></mrow></math></span> that coincide with classical and intuitionistic formulations. We analyze the significance of our characterizations by considering the <em>locality</em> principle (enforced by intuitionistic interpretations but not by classical ones) and forms of <em>process composition</em> induced by the interpretations.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"142 ","pages":"Article 101004"},"PeriodicalIF":0.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352220824000580/pdfft?md5=294ab7a9dfc6c75e24cca0d439232106&pid=1-s2.0-S2352220824000580-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142089470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Executable contracts for Elixir Elixir 的可执行合约

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-01-01 Epub Date: 2024-10-01 DOI: 10.1016/j.jlamp.2024.101019

Luis Eduardo Bueso de Barrio, Lars-Åke Fredlund, Ángel Herranz, Julio Mariño, Clara Benac Earle

引用次数: 0

Partially typed multiparty sessions with internal delegation 内部授权的部分类型多方会议

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-01-01 Epub Date: 2024-09-23 DOI: 10.1016/j.jlamp.2024.101018

Franco Barbanera , Viviana Bono , Mariangiola Dezani-Ciancaglini

引用次数: 0