发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
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
{"title":"Preface to selected papers from 22nd Workshop on Programming and Languages (PROLE 2023)","authors":"Laura Panizo","doi":"10.1016/j.jlamp.2025.101060","DOIUrl":"10.1016/j.jlamp.2025.101060","url":null,"abstract":"<div><div>This special issue collects extended versions of selected papers presented at the 22nd Workshop on Programming and Languages (PROLE 2023), held in Ciudad Real from September 12 to 14, 2023.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"145 ","pages":"Article 101060"},"PeriodicalIF":0.7,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143620611","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
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,&nbsp;María-del-Mar Gallardo,&nbsp;Francisco Luque-Schempp,&nbsp;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
{"title":"Journal of logical and algebraic methods in programming – Publisher's Note 2025","authors":"","doi":"10.1016/j.jlamp.2025.101058","DOIUrl":"10.1016/j.jlamp.2025.101058","url":null,"abstract":"","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"145 ","pages":"Article 101058"},"PeriodicalIF":0.7,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143563066","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
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
{"title":"Editorial message from the new Editor-in-Chief","authors":"Alberto Lluch Lafuente","doi":"10.1016/j.jlamp.2025.101057","DOIUrl":"10.1016/j.jlamp.2025.101057","url":null,"abstract":"","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"145 ","pages":"Article 101057"},"PeriodicalIF":0.7,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143552276","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
An algebraic theory of nondeterministic finite automata 不确定有限自动机的代数理论
IF 0.7 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-02-24 DOI: 10.1016/j.jlamp.2025.101055
Roberto Gorrieri
{"title":"An algebraic theory of nondeterministic finite automata","authors":"Roberto Gorrieri","doi":"10.1016/j.jlamp.2025.101055","DOIUrl":"10.1016/j.jlamp.2025.101055","url":null,"abstract":"<div><div>A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA <em>N</em>, there exists a process algebraic term <em>p</em> such that its semantics is an NFA isomorphic to <em>N</em>. Moreover, we provide a concise axiomatization of language equivalence: two NFAs <span><math><msub><mrow><mi>N</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> and <span><math><msub><mrow><mi>N</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> recognize the same language if and only if the associated terms <span><math><msub><mrow><mi>p</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> and <span><math><msub><mrow><mi>p</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>, respectively, can be equated by means of a set of axioms, comprising 7 axioms plus 3 conditional axioms, only.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"145 ","pages":"Article 101055"},"PeriodicalIF":0.7,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143479174","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
Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms 通过从组态到项的内射函数，将命令式程序转化为双相似的逻辑约束项重写系统
IF 0.7 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-02-24 DOI: 10.1016/j.jlamp.2025.101056
Naoki Nishida, Misaki Kojima , Takumi Kato
{"title":"Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms","authors":"Naoki Nishida,&nbsp;Misaki Kojima ,&nbsp;Takumi Kato","doi":"10.1016/j.jlamp.2025.101056","DOIUrl":"10.1016/j.jlamp.2025.101056","url":null,"abstract":"<div><div>To transform an imperative program into a logically constrained term rewrite system (LCTRS, for short), previous work transforms a list of statements into rewrite rules in a stepwise manner, and proves the correctness along the transformation and the big-step semantics of the program. On the other hand, the small-step semantics of a programming language consists of inference rules that define single transitions of configurations. Partial instances of such inference rules are almost the same as rewrite rules in the transformed LCTRS. In this paper, we aim at establishing a framework for simpler definitions and correctness proofs of transformations from programs into LCTRSs. To this end, for the transformation in previous work as an example, we show the existence of an injective function from configurations of a given program to terms, and reformulate the transformation by means of the injective function. The injective function enables us to make a one-to-one correspondence between single small-step transitions and reduction steps, and provides bisimilarity between the program and transformed LCTRS, resulting in a simpler correctness proof.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"145 ","pages":"Article 101056"},"PeriodicalIF":0.7,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143509467","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 rewriting logic semantics for the analysis of P programs 用于P程序分析的重写逻辑语义
IF 0.7 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-02-15 DOI: 10.1016/j.jlamp.2025.101048
Francisco Durán , Carlos Ramírez , Camilo Rocha , Nicolás Pozas
{"title":"A rewriting logic semantics for the analysis of P programs","authors":"Francisco Durán ,&nbsp;Carlos Ramírez ,&nbsp;Camilo Rocha ,&nbsp;Nicolás Pozas","doi":"10.1016/j.jlamp.2025.101048","DOIUrl":"10.1016/j.jlamp.2025.101048","url":null,"abstract":"<div><div><span><math><mtext>P</mtext></math></span> is a domain-specific language designed for specifying asynchronous, event-driven systems. Its computational model is based on actors, i.e., on communicating state machines. This paper presents a formal semantics of <span><math><mtext>P</mtext></math></span> using rewriting logic, extending the language's verification capabilities. Implemented in Maude, a rewriting logic language, this semantics enables automated analysis of <span><math><mtext>P</mtext></math></span> programs, including reachability analysis, LTL model checking, and statistical model checking. Through illustrative examples, this paper demonstrates how this formalization significantly enhances <span><math><mtext>P</mtext></math></span>'s verification capacities in practical scenarios.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"144 ","pages":"Article 101048"},"PeriodicalIF":0.7,"publicationDate":"2025-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143438019","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
Efficient iterative programs with distributed data collections 具有分布式数据集合的高效迭代程序
IF 0.7 4区 数学
Journal of Logical and Algebraic Methods in Programming Pub Date : 2025-02-12 DOI: 10.1016/j.jlamp.2025.101047
Sarah Chlyah, Nils Gesbert, Pierre Genevès, Nabil Layaïda
{"title":"Efficient iterative programs with distributed data collections","authors":"Sarah Chlyah,&nbsp;Nils Gesbert,&nbsp;Pierre Genevès,&nbsp;Nabil Layaïda","doi":"10.1016/j.jlamp.2025.101047","DOIUrl":"10.1016/j.jlamp.2025.101047","url":null,"abstract":"<div><div>Big data programming frameworks have become increasingly important for the development of applications for which performance and scalability are critical. In those complex frameworks, optimizing code by hand is hard and time-consuming, making automated optimization particularly necessary. In order to automate optimization, a prerequisite is to find suitable abstractions to represent programs; for instance, algebras based on monads or monoids to represent distributed data collections. Currently, however, such algebras do not represent recursive programs in a way which allows for analyzing or rewriting them. In this paper, we extend a monoid algebra with a fixpoint operator for representing recursion as a first class citizen and show how it enables new optimizations. Experiments with the Spark platform illustrate performance gains brought by these systematic optimizations.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"144 ","pages":"Article 101047"},"PeriodicalIF":0.7,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143445375","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
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 DOI: 10.1016/j.jlamp.2024.101033
Misaki Kojima , Naoki Nishida, Yutaka Matsubara
{"title":"Transforming concurrent programs with semaphores into logically constrained term rewrite systems","authors":"Misaki Kojima ,&nbsp;Naoki Nishida,&nbsp;Yutaka Matsubara","doi":"10.1016/j.jlamp.2024.101033","DOIUrl":"10.1016/j.jlamp.2024.101033","url":null,"abstract":"<div><div>In this paper, as a first step of modeling concurrent programs by logically constrained term rewrite systems (LCTRSs, for short), we show transformations of concurrent programs with semaphore-based exclusive control into LCTRSs. To this end, we show how to encode configurations of concurrent programs with a fixed number of processes. Then, we show how to encode some well-known operations for semaphores by rewrite rules, showing two transformations of concurrent programs with semaphores into LCTRSs. We adopt list-using and list-free approaches to the encoding of waiting queues for semaphores in LCTRSs. While the former straightforwardly uses lists, the latter uses a so-called take-a-number system in order to avoid using any recursive data structures for waiting queues.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"143 ","pages":"Article 101033"},"PeriodicalIF":0.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143170706","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
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 DOI: 10.1016/j.jlamp.2024.101034
Víctor García , Santiago Escobar , Kazuhiro Ogata
{"title":"Formalization and analysis of the post-quantum signature scheme FALCON with Maude","authors":"Víctor García ,&nbsp;Santiago Escobar ,&nbsp;Kazuhiro Ogata","doi":"10.1016/j.jlamp.2024.101034","DOIUrl":"10.1016/j.jlamp.2024.101034","url":null,"abstract":"<div><div>Digital signatures ensure the authenticity and integrity of digital assets, vital properties for any secure communication. The National Institute of Standards and Technologies launched the Post-Quantum Cryptography project to standardise new algorithms and protocols that are secure against quantum attackers. The post-quantum signature scheme FALCON was one of the finalists. We present a continuation of the first steps towards the formal specification and analysis, in the high-performance language Maude, of signature schemes. We have adapted and improved a previous framework, originally aimed to formally specify and analyse post-quantum key encapsulation mechanisms. As a use case of the new framework, we specify an executable symbolic model of FALCON. On the symbolic model, we verify termination and fairness using LTL formulas with Maude's model checker. Furthermore, authentication, integrity and non-repudiation are analysed through invariant analysis. Integrity and non-repudiation hold, meanwhile, authentication does not hold in our symbolic model.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"143 ","pages":"Article 101034"},"PeriodicalIF":0.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143170707","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
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信