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

Hoare-style logic for unstructured programs 用于非结构化程序的hoare风格逻辑

IF 1.2 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2026-03-01 Epub Date: 2025-11-20 DOI: 10.1016/j.jlamp.2025.101099

Didrik Lundberg , Roberto Guanciale , Andreas Lindner , Mads Dam

{"title":"Hoare-style logic for unstructured programs","authors":"Didrik Lundberg , Roberto Guanciale , Andreas Lindner , Mads Dam","doi":"10.1016/j.jlamp.2025.101099","DOIUrl":"10.1016/j.jlamp.2025.101099","url":null,"abstract":"<div><div>Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain structure and modularity in a domain where structure is essentially absent. The field, however, has not yet arrived at a fully satisfactory solution, in the sense of avoiding restrictions on control flow (important for compiler optimization), controlling access to intermediate program points (important for modularity), and supporting total correctness. Proposals in the literature support some of these properties, but a solution that meets them all is yet to be found. We introduce the novel Hoare-style program logic <span><math><msub><mi>L</mi><mi>A</mi></msub></math></span>, which interprets postconditions relative to program points when these are first encountered. The logic supports both partial and total correctness, derives contracts for arbitrary control flow, and allows one to freely choose decomposition strategy during verification while avoiding step-indexed approximations and global invariants. The logic can be instantiated for a variety of concrete instruction set architectures and intermediate languages. The rules of <span><math><msub><mi>L</mi><mi>A</mi></msub></math></span> have been verified in the interactive theorem prover HOL4 and integrated with the toolbox HolBA for semi-automated program verification, which supports the ARMv6, ARMv8 and RISC-V instruction sets.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"149 ","pages":"Article 101099"},"PeriodicalIF":1.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145625365","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

DM-Check: Verifying invariants of concurrent systems by deductive model checking DM-Check：通过演绎模型检验来验证并发系统的不变量

IF 1.2 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2026-03-01 Epub Date: 2025-12-02 DOI: 10.1016/j.jlamp.2025.101107

Kyungmin Bae , Santiago Escobar , Raúl López-Rueda , José Meseguer , Julia Sapiña

{"title":"DM-Check: Verifying invariants of concurrent systems by deductive model checking","authors":"Kyungmin Bae , Santiago Escobar , Raúl López-Rueda , José Meseguer , Julia Sapiña","doi":"10.1016/j.jlamp.2025.101107","DOIUrl":"10.1016/j.jlamp.2025.101107","url":null,"abstract":"<div><div>We propose a new <em>deductive model checking</em> methodology where narrowing-based logical model checking of symbolic states specified as disjunctions of <em>constrained patterns</em>is combined with inductive theorem proving to discharge inductive verification conditions that ensure useful symbolic state space reductions. An obvious combination is to use an inductive theorem prover in <em>automated mode</em> as an <em>oracle</em> to help logical model checking reach a fixpoint. But this is not the only possible combination. In this paper we focus instead on a new deductive model checking methodology to verify invariants —including inductive invariants— of infinite-state systems, where logical model checking automates large parts of the verification effort with the help of an inductive theorem prover as an <em>oracle</em>. Inductive verification conditions not discharged automatically by the oracle are dealt with by commands that refine some constrained patterns by useful semantic equivalences, and by using an inductive theorem prover in interactive mode. This methodology is demonstrated by means of concurrent system examples using two Maude tools working in tandem: the <span>DM-Check</span> narrowing-based symbolic model checker, and the <span>NuITP</span> inductive theorem prover.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"149 ","pages":"Article 101107"},"PeriodicalIF":1.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145797548","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

Preface of the PLACES 2023 special issue 《PLACES 2023》特刊前言

IF 1.2 4区数学

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

Ilaria Castellani , Alceste Scalas

引用次数: 0

Computational modelling for combinatorial game strategies 组合博弈策略的计算建模

IF 1.2 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2026-03-01 Epub Date: 2025-11-04 DOI: 10.1016/j.jlamp.2025.101097

Răzvan Diaconescu

引用次数: 0

NWPT 2022 - Special issue NWPT 2022 -特刊

IF 1.2 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2026-03-01 Epub Date: 2025-08-27 DOI: 10.1016/j.jlamp.2025.101091

Mikhail Barash , Crystal Chang Din, Magne Haveraaen

引用次数: 0

Preface to selected papers from 21st Workshop on Programming and Languages (PROLE 2022) 第21届程序设计与语言研讨会（PROLE 2022）论文选集前言

IF 1.2 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2026-03-01 Epub Date: 2025-10-17 DOI: 10.1016/j.jlamp.2025.101098

Pascual Julián-Iranzo

引用次数: 0

Nominal anti-unification modulo equational theories 名义反统一模方程理论

IF 1.2 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2026-03-01 Epub Date: 2025-11-18 DOI: 10.1016/j.jlamp.2025.101100

Alexander Baumgartner , Daniele Nantes-Sobrinho

{"title":"Nominal anti-unification modulo equational theories","authors":"Alexander Baumgartner , Daniele Nantes-Sobrinho","doi":"10.1016/j.jlamp.2025.101100","DOIUrl":"10.1016/j.jlamp.2025.101100","url":null,"abstract":"<div><div>This paper investigates nominal anti-unification, i.e., the problem of computing least general generalizations of terms in the presence of binding structures and freshness constraints. We extend this problem to account for equational theories, specifically associativity (A), commutativity (C), and their combination (AC), yielding the notion of anti-unification modulo a theory <em>E</em>. Solutions in this setting, called <em>E</em>-generalizations, must consider both, the syntactic structure of nominal terms, and the algebraic properties imposed by <em>E</em>. In the general case, the problem has no solution due to the unbounded supply of atoms. To obtain a finitary setting, we fix a finite set of atoms <em>A</em> and introduce a rule-based algorithm for computing <em>E</em>-generalizations where only atoms from <em>A</em> are allowed to appear. The algorithm includes dedicated rules for reasoning modulo <em>E</em> and systematically explores permutations of subterms, which may lead to exponential blow-up in the number of generalizations. Although the computed set is not minimal, we describe heuristics that lead to computing promising <em>E</em>-generalizations in reasonable time. We also give an implementation of our algorithm which can be used to explore different optimization strategies that improve efficiency in practice, up to archiving tractability.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"149 ","pages":"Article 101100"},"PeriodicalIF":1.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145580383","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 reasoning about Bernstein-Vazirani algorithm Bernstein-Vazirani算法的形式化推理

IF 1.2 4区数学

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

Hongxia Sun , Zhiping Shi , Shanyan Chen , Guohui Wang , Ximeng Li , Yong Guan

引用次数: 0

Unified opinion formation analysis in rewriting logic 改写逻辑统一意见形成分析

IF 1.2 4区数学

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

Carlos Olarte , Carlos Ramírez , Camilo Rocha , Frank Valencia

{"title":"Unified opinion formation analysis in rewriting logic","authors":"Carlos Olarte , Carlos Ramírez , Camilo Rocha , Frank Valencia","doi":"10.1016/j.jlamp.2025.101095","DOIUrl":"10.1016/j.jlamp.2025.101095","url":null,"abstract":"<div><div>Processes of opinion formation rooted in social dynamics can significantly contribute to the polarization of social, political, and democratic interaction. Opinion dynamic models are essential for understanding the impact of specific social factors on the acceptance or rejection of opinions. This extended paper builds upon the conference presentation documented in <span><span>[1]</span></span>, introducing improvements and new opinion models that explore biases and collective human behaviors. It presents a framework based on concurrent set relations that formalizes, simulates, and analyzes social interaction systems with dynamic opinion models. Within this framework, standard models for social learning are realized as specific instances. Implemented in the Maude system as a fully executable rewrite theory, the framework enables a detailed examination of how agents' opinions can be influenced within a system. The authors report on new formalization of several and existing social learning models, exploring their relationships with different concurrency models. New experimentation involving reachability analysis, probabilistic simulation, and statistical model checking has been conducted. These experiments are crucial for validating significant properties related to dynamic opinion models in Maude, offering new insights into the mechanisms of opinion shaping in social interaction.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"148 ","pages":"Article 101095"},"PeriodicalIF":1.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145324333","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

Kind inference for the FreeST programming language FreeST编程语言的类型推断

IF 1.2 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2026-01-01 Epub Date: 2025-08-29 DOI: 10.1016/j.jlamp.2025.101083

Bernardo Almeida, Andreia Mordido, Vasco T. Vasconcelos

引用次数: 0