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

Using fixed memory blocks in GPUs to accelerate SpMV multiplication in probabilistic model checkers 在gpu中使用固定内存块加速概率模型检查器中的SpMV乘法

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-07-16 DOI: 10.1016/j.jlamp.2025.101073

Muhammad Hannan Khan, Shahid Khan, Osman Hasan

{"title":"Using fixed memory blocks in GPUs to accelerate SpMV multiplication in probabilistic model checkers","authors":"Muhammad Hannan Khan, Shahid Khan, Osman Hasan","doi":"10.1016/j.jlamp.2025.101073","DOIUrl":"10.1016/j.jlamp.2025.101073","url":null,"abstract":"<div><h3>Context</h3><div>Probabilistic model checkers rely heavily on sparse matrix-vector multiplication (SpMV) to analyze a given probabilistic model. SpMV is a compute- and memory-intensive task. Therefore, it adversely affects the scalability of probabilistic model checkers. Graphical processing units (GPUs) have been utilized to improve the speed of SpMV. The GPU-based SpMV compute time consists of two independent factors: (Factor 1) host-to-GPU memory transfer and (Factor 2) the actual GPU-based SpMV multiplication. While many researchers have focused on the importance of Factor 1, none have explored ways to minimize its impact on overall SpMV computation time.</div></div><div><h3>Objective</h3><div>This paper proposes an approach to reduce the memory transfer-related latency by hiding the data transfer from the host to the GPU in the state-space exploration step of probabilistic model checking.</div></div><div><h3>Methods</h3><div>This is achieved in two steps: 1) reserve the complete coalesced memory in the GPU, and 2) move chunks of the sparse matrix from the host to the reserved memory during state-space exploration.</div></div><div><h3>Results</h3><div>We report on an open source prototypical implementation of our approach on a CUDA-based cuSPARSE API in <span>Storm</span>, a prominent probabilistic model checker.</div></div><div><h3>Conclusion</h3><div>We empirically demonstrate that our approach reduces memory transfer latency by at least one order of magnitude. Additionally, for most of the benchmarks, our approach achieves computation times comparable to <span>GPU-Prism</span>, a prominent probabilistic model checker.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"147 ","pages":"Article 101073"},"PeriodicalIF":0.7,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144653547","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 analysis of real-time systems with user-defined strategies in rewriting logic 使用用户定义策略重写逻辑的实时系统的形式化分析

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-07-01 DOI: 10.1016/j.jlamp.2025.101072

Carlos Olarte , Peter Csaba Ölveczky

{"title":"Formal analysis of real-time systems with user-defined strategies in rewriting logic","authors":"Carlos Olarte , Peter Csaba Ölveczky","doi":"10.1016/j.jlamp.2025.101072","DOIUrl":"10.1016/j.jlamp.2025.101072","url":null,"abstract":"<div><div>A wide range of real-time systems, formalisms, and modeling languages can be naturally represented in rewriting logic as real-time rewrite theories. In this paper we propose a language in which the user can conveniently define execution strategies—including state- and history-dependent ones—for real-time rewrite theories in a modular way, by specifying: (i) how to apply instantaneous transitions; (ii) how to advance time in the system; and (iii) the interplay between instantaneous transitions and advancing time. The user can easily specify more “time sampling strategies” than those supported by the Real-Time Maude tool, and we identify a new time sampling strategy that provides both efficient and exhaustive analysis for many distributed real-time systems. We provide unbounded and time-bounded simulation, reachability analysis, and LTL model checking commands for real-time rewrite theories whose executions are constrained by the user-defined discrete and timed strategies. These analysis methods are implemented by defining a strategy which extends the user's strategy, so that all analysis boils down to standard Maude rewriting with strategies. We exemplify the use of our strategy language and our analyses on a round trip time protocol and a train door controller. Our work also provides analysis with respect to user-defined strategies for formalisms that can be seen as real-time theories; we illustrate this for timed automata. Finally, we compare the performance of standard Maude search, where the desired time sampling strategy has been hardcoded into the model, with our strategy-implemented reachability analyses on the CASH scheduling algorithm benchmark.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"146 ","pages":"Article 101072"},"PeriodicalIF":0.7,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144579179","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

Comodule representations of second-order functionals 二阶泛函的模块表示

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-06-05 DOI: 10.1016/j.jlamp.2025.101071

Danel Ahman , Andrej Bauer

{"title":"Comodule representations of second-order functionals","authors":"Danel Ahman , Andrej Bauer","doi":"10.1016/j.jlamp.2025.101071","DOIUrl":"10.1016/j.jlamp.2025.101071","url":null,"abstract":"<div><div>We develop and investigate a general theory of representations of second-order functionals, based on a notion of a right comodule for a monad on the category of containers. We show how the notion of comodule representability naturally subsumes classic representations of continuous functionals with well-founded trees. We find other kinds of representations by varying the monad, the comodule, and in some cases the underlying category of containers. Examples include uniformly continuous or finitely supported functionals, functionals querying their arguments precisely once, or at most once, functionals interacting with an ambient environment through computational effects, as well as functionals trivially representing themselves. Many of these rely on our construction of a monad on containers from a monad on shapes and a weak Mendler-style monad algebra on the universe for positions. We show that comodule representability on the category of propositional containers, which have positions valued in a universe of propositions, is closely related to instance reducibility in constructive mathematics, and through it to Weihrauch reducibility in computability theory.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"146 ","pages":"Article 101071"},"PeriodicalIF":0.7,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144254841","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 distribution semantics for probabilistic term rewriting 一种用于概率项重写的分布语义

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-05-23 DOI: 10.1016/j.jlamp.2025.101070

Germán Vidal

引用次数: 0

Corrigendum to “Runtime monitoring of 5G network slicing using STAn” [Journal of Logical and Algebraic Methods in Programming, 145 (2025) 101059] “基于STAn的5G网络切片运行时监控”的勘误表[j] .程序设计中的逻辑代数方法，145(2025)101059。

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-05-04 DOI: 10.1016/j.jlamp.2025.101062

Laura Panizo, María-del-Mar Gallardo, Francisco Luque-Schempp, Pedro Merino

引用次数: 0

Preface to Rewriting Logic and Its Applications (revised selected papers from WRLA 2020) 《重写逻辑及其应用》前言（WRLA 2020论文选编）

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-04-23 DOI: 10.1016/j.jlamp.2025.101061

Santiago Escobar , Narciso Martí-Oliet

引用次数: 0

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

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-03-13 DOI: 10.1016/j.jlamp.2025.101060

Laura Panizo

引用次数: 0

Runtime monitoring of 5G network slicing using STAn 基于STAn的5G网络切片运行时监控

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-03-12 DOI: 10.1016/j.jlamp.2025.101059

Laura Panizo, María-del-Mar Gallardo, Francisco Luque-Schempp, Pedro Merino

{"title":"Runtime monitoring of 5G network slicing using STAn","authors":"Laura Panizo, María-del-Mar Gallardo, Francisco Luque-Schempp, Pedro Merino","doi":"10.1016/j.jlamp.2025.101059","DOIUrl":"10.1016/j.jlamp.2025.101059","url":null,"abstract":"<div><div>The most recent technology in the evolution of mobile networks is 5G, which is aimed at offering differentiated quality of service (QoS) to specific groups of users or devices. Such groups could include public safety agencies, connected vehicles, citizens streaming video content, fixed Internet of Things devices, etc. Insofar as each group has different requirements in terms of bandwidth, latency, error rate, coverage or other relevant quality indicators, the network can be divided into multiple <em>slices</em>, with each slice supporting a group's requirements. Such <em>network slicing</em> is becoming a key feature for telecom operators, who need to face the challenge of validating its correct behavior.</div><div>In this paper, we propose a monitoring system to check that a 5G network is offering slicing in the proper way. To this end, we use the tool <span>STAn</span>, a general purpose runtime verification tool where the requirements to be monitored are expressed using temporal formulae. The paper identifies first a list of requirements that define the expected behavior of network slicing.</div><div>Then, we describe how the initial logic <span>eLTL</span> supported by <span>STAn</span> is extended to the so-called eXtended Event-driven Temporal Logic (<span>xeLTL</span>) in order to represent the slicing requirements. Finally, we validate that the new version of <span>STAn</span> and the catalogue of <span>xeLTL</span> formulae are suitable to monitor and check if real 5G networks properly support slicing. This way, we provide a complete new system for runtime monitoring of 5G network slicing.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"145 ","pages":"Article 101059"},"PeriodicalIF":0.7,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143620544","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

Journal of logical and algebraic methods in programming – Publisher's Note 2025 程序设计中的逻辑和代数方法杂志-出版商注释2025

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-03-06 DOI: 10.1016/j.jlamp.2025.101058

引用次数: 0

Editorial message from the new Editor-in-Chief 新主编的社论

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-03-04 DOI: 10.1016/j.jlamp.2025.101057

Alberto Lluch Lafuente

引用次数: 0