用于P程序分析的重写逻辑语义

IF 0.7 4区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

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":"用于P程序分析的重写逻辑语义","authors":"Francisco Durán , Carlos Ramírez , Camilo Rocha , Nicolás Pozas","doi":"10.1016/j.jlamp.2025.101048","DOIUrl":null,"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.7000,"publicationDate":"2025-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A rewriting logic semantics for the analysis of P programs\",\"authors\":\"Francisco Durán , Carlos Ramírez , Camilo Rocha , Nicolás Pozas\",\"doi\":\"10.1016/j.jlamp.2025.101048\",\"DOIUrl\":null,\"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.7000,\"publicationDate\":\"2025-02-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Logical and Algebraic Methods in Programming\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2352220825000148\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logical and Algebraic Methods in Programming","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2352220825000148","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

P是一种特定于领域的语言，用于指定异步的、事件驱动的系统。它的计算模型基于参与者，即基于通信状态机。本文利用重写逻辑给出了P的形式化语义，扩展了P语言的验证能力。该语义在Maude（一种重写逻辑语言）中实现，支持对P程序进行自动分析，包括可达性分析、LTL模型检查和统计模型检查。通过举例说明，本文演示了这种形式化如何在实际场景中显著提高P的验证能力。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A rewriting logic semantics for the analysis of P programs

P

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

P

using rewriting logic, extending the language's verification capabilities. Implemented in Maude, a rewriting logic language, this semantics enables automated analysis of

P

programs, including reachability analysis, LTL model checking, and statistical model checking. Through illustrative examples, this paper demonstrates how this formalization significantly enhances

P

's verification capacities in practical scenarios.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Logical and Algebraic Methods in Programming COMPUTER SCIENCE, THEORY & METHODS-LOGIC

CiteScore

2.60

自引率

22.20%

发文量

期刊介绍： The Journal of Logical and Algebraic Methods in Programming is an international journal whose aim is to publish high quality, original research papers, survey and review articles, tutorial expositions, and historical studies in the areas of logical and algebraic methods and techniques for guaranteeing correctness and performability of programs and in general of computing systems. All aspects will be covered, especially theory and foundations, implementation issues, and applications involving novel ideas.