Pub Date : 2025-08-29DOI: 10.1016/j.jlamp.2025.101083
Bernardo Almeida, Andreia Mordido, Vasco T. Vasconcelos
FreeST is a message-passing concurrent functional programming language where messages are exchanged on channels governed by context-free session types. Thus far, FreeST only distinguishes two kinds of types: arbitrary types and session types. We introduce explicit channel closing operators — close and wait — together with their corresponding types — Close and Wait — which call for a third kind of types, that of channel types. Type variable declaration is usually annotated with its kind. We provide a sound and complete algorithm for kind inference and prove that it terminates yielding the most general kind.
{"title":"Kind inference for the FreeST programming language","authors":"Bernardo Almeida, Andreia Mordido, Vasco T. Vasconcelos","doi":"10.1016/j.jlamp.2025.101083","DOIUrl":"10.1016/j.jlamp.2025.101083","url":null,"abstract":"<div><div><span>FreeST</span> is a message-passing concurrent functional programming language where messages are exchanged on channels governed by context-free session types. Thus far, <span>FreeST</span> only distinguishes two kinds of types: arbitrary types and session types. We introduce explicit channel closing operators — <span>close</span> and <span>wait</span> — together with their corresponding types — <span>Close</span> and <span>Wait</span> — which call for a third kind of types, that of channel types. Type variable declaration is usually annotated with its kind. We provide a sound and complete algorithm for kind inference and prove that it terminates yielding the most general kind.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"148 ","pages":"Article 101083"},"PeriodicalIF":1.2,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144922385","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}
Pub Date : 2025-08-13DOI: 10.1016/j.jlamp.2025.101082
Fabio Gadducci , Andrea Laretto , Davide Trotta
The aim of this work is to present counterpart-based quantified temporal logics from several points of view. We start by introducing a set-based semantics for a (first-order) linear temporal logic based on the counterpart paradigm, along with results on its positive normal form both in the case of partial functions and of (possibly duplicating) relations. Then, a categorical semantics of the logic is introduced by means of relational presheaves. Both the presentations of the logic via the positive normal form and its categorical semantics are formalised using the proof assistant Agda, and we highlight the crucial aspects of our implementation and the practical use of (quantified) temporal logics in a constructive proof assistant.
{"title":"Counterpart-based Quantified Temporal Logics","authors":"Fabio Gadducci , Andrea Laretto , Davide Trotta","doi":"10.1016/j.jlamp.2025.101082","DOIUrl":"10.1016/j.jlamp.2025.101082","url":null,"abstract":"<div><div>The aim of this work is to present counterpart-based quantified temporal logics from several points of view. We start by introducing a set-based semantics for a (first-order) linear temporal logic based on the counterpart paradigm, along with results on its positive normal form both in the case of partial functions and of (possibly duplicating) relations. Then, a categorical semantics of the logic is introduced by means of relational presheaves. Both the presentations of the logic via the positive normal form and its categorical semantics are formalised using the proof assistant Agda, and we highlight the crucial aspects of our implementation and the practical use of (quantified) temporal logics in a constructive proof assistant.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"148 ","pages":"Article 101082"},"PeriodicalIF":1.2,"publicationDate":"2025-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144863952","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}
Pub Date : 2025-07-16DOI: 10.1016/j.jlamp.2025.101073
Muhammad Hannan Khan, Shahid Khan, Osman Hasan
Context
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.
Objective
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.
Methods
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.
Results
We report on an open source prototypical implementation of our approach on a CUDA-based cuSPARSE API in Storm, a prominent probabilistic model checker.
Conclusion
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 GPU-Prism, a prominent probabilistic model checker.
{"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}
Pub Date : 2025-07-01DOI: 10.1016/j.jlamp.2025.101072
Carlos Olarte , Peter Csaba Ölveczky
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.
{"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}
Pub Date : 2025-06-05DOI: 10.1016/j.jlamp.2025.101071
Danel Ahman , Andrej Bauer
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.
{"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}
Pub Date : 2025-05-23DOI: 10.1016/j.jlamp.2025.101070
Germán Vidal
Probabilistic programming is becoming increasingly popular thanks to its ability to specify problems with a certain degree of uncertainty. In this work, we focus on term rewriting, a well-known computational formalism. In particular, we consider systems that combine traditional rewriting rules with probabilities. Then, we define a novel “distribution semantics” for such systems that can be used to model the probability of reducing a term to some value. We also show how to compute a set of “explanations” for a given reduction, which can be used to compute its probability in a more efficient way. Finally, we illustrate our approach with several examples and outline a couple of extensions that may prove useful to improve the expressive power of probabilistic rewrite systems.
{"title":"A distribution semantics for probabilistic term rewriting","authors":"Germán Vidal","doi":"10.1016/j.jlamp.2025.101070","DOIUrl":"10.1016/j.jlamp.2025.101070","url":null,"abstract":"<div><div>Probabilistic programming is becoming increasingly popular thanks to its ability to specify problems with a certain degree of uncertainty. In this work, we focus on term rewriting, a well-known computational formalism. In particular, we consider systems that combine traditional rewriting rules with probabilities. Then, we define a novel “distribution semantics” for such systems that can be used to model the probability of reducing a term to some value. We also show how to compute a set of “explanations” for a given reduction, which can be used to compute its probability in a more efficient way. Finally, we illustrate our approach with several examples and outline a couple of extensions that may prove useful to improve the expressive power of probabilistic rewrite systems.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"146 ","pages":"Article 101070"},"PeriodicalIF":0.7,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144139625","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}
Pub Date : 2025-05-04DOI: 10.1016/j.jlamp.2025.101062
Laura Panizo, María-del-Mar Gallardo, Francisco Luque-Schempp, Pedro Merino
{"title":"Corrigendum to “Runtime monitoring of 5G network slicing using STAn” [Journal of Logical and Algebraic Methods in Programming, 145 (2025) 101059]","authors":"Laura Panizo, María-del-Mar Gallardo, Francisco Luque-Schempp, Pedro Merino","doi":"10.1016/j.jlamp.2025.101062","DOIUrl":"10.1016/j.jlamp.2025.101062","url":null,"abstract":"","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"146 ","pages":"Article 101062"},"PeriodicalIF":0.7,"publicationDate":"2025-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143904357","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}
Pub Date : 2025-04-23DOI: 10.1016/j.jlamp.2025.101061
Santiago Escobar , Narciso Martí-Oliet
This special issue collects revised extended versions of selected papers presented at the 13th International Workshop on Rewriting Logic and Its Applications (WRLA 2020) held as an online event from October 20 to 22, 2020.
{"title":"Preface to Rewriting Logic and Its Applications (revised selected papers from WRLA 2020)","authors":"Santiago Escobar , Narciso Martí-Oliet","doi":"10.1016/j.jlamp.2025.101061","DOIUrl":"10.1016/j.jlamp.2025.101061","url":null,"abstract":"<div><div>This special issue collects revised extended versions of selected papers presented at the 13th International Workshop on Rewriting Logic and Its Applications (WRLA 2020) held as an online event from October 20 to 22, 2020.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"146 ","pages":"Article 101061"},"PeriodicalIF":0.7,"publicationDate":"2025-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144105289","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}
Pub Date : 2025-03-13DOI: 10.1016/j.jlamp.2025.101060
Laura Panizo
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.
{"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}
Pub Date : 2025-03-12DOI: 10.1016/j.jlamp.2025.101059
Laura Panizo, María-del-Mar Gallardo, Francisco Luque-Schempp, Pedro Merino
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 slices, with each slice supporting a group's requirements. Such network slicing is becoming a key feature for telecom operators, who need to face the challenge of validating its correct behavior.
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 STAn, 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.
Then, we describe how the initial logic eLTL supported by STAn is extended to the so-called eXtended Event-driven Temporal Logic (xeLTL) in order to represent the slicing requirements. Finally, we validate that the new version of STAn and the catalogue of xeLTL 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.
{"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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号