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

英文中文

Formal analysis of real-time systems with user-defined strategies in rewriting logic 使用用户定义策略重写逻辑的实时系统的形式化分析

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

Journal of Logical and Algebraic Methods in Programming

Pub Date : 2025-07-01 Epub Date: 2025-07-05 DOI: 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.

广泛的实时系统、形式化和建模语言可以在重写逻辑时自然地表示为实时重写理论。在本文中，我们提出了一种语言，用户可以方便地定义执行策略-包括状态和历史依赖的-实时重写理论以模块化的方式，通过指定：(i)如何应用瞬时转换；（二）如何在系统中提前时间；(3)瞬时过渡与推进时间的相互作用。用户可以很容易地指定比Real-Time Maude工具支持的更多的“时间采样策略”，我们确定了一个新的时间采样策略，为许多分布式实时系统提供高效和详尽的分析。我们提供无界和限时仿真、可达性分析和LTL模型检查命令，用于执行受用户定义的离散和定时策略约束的实时重写理论。这些分析方法是通过定义一个扩展用户策略的策略来实现的，这样所有的分析都可以归结为带有策略的标准Maude重写。我们举例说明了在往返时间协议和列车门控制器上使用我们的策略语言和分析。我们的工作还提供了对可被视为实时理论的形式主义的用户定义策略的分析；我们用时间自动机来说明这一点。最后，我们比较了标准Maude搜索的性能，其中所需的时间采样策略已硬编码到模型中，与我们在CASH调度算法基准上实现的策略可达性分析。

{"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

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

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

Journal of Logical and Algebraic Methods in Programming

Pub Date : 2025-05-01 Epub Date: 2025-03-06 DOI: 10.1016/j.jlamp.2025.101058

引用次数: 0

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

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

Journal of Logical and Algebraic Methods in Programming

Pub Date : 2025-05-01 Epub Date: 2025-03-04 DOI: 10.1016/j.jlamp.2025.101057

Alberto Lluch Lafuente

引用次数: 0

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

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

Journal of Logical and Algebraic Methods in Programming

Pub Date : 2025-05-01 Epub Date: 2025-03-13 DOI: 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.

本特刊收集了 2023 年 9 月 12 日至 14 日在雷阿尔城举行的第 22 届编程与语言研讨会（PROLE 2023）上发表的部分论文的扩展版本。

引用次数: 0

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

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

Journal of Logical and Algebraic Methods in Programming

Pub Date : 2025-05-01 Epub Date: 2025-03-12 DOI: 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.

移动网络发展的最新技术是5G，旨在为特定用户群体或设备提供差异化的服务质量（QoS）。这些群体可能包括公共安全机构、联网车辆、公民流媒体视频内容、固定物联网设备等。由于每个组在带宽、时延、错误率、覆盖率或其他相关质量指标方面的要求不同，可以将网络划分为多个切片，每个切片支持一个组的需求。这种网络切片正在成为电信运营商的一个关键功能，他们需要面对验证其正确行为的挑战。在本文中，我们提出了一个监控系统来检查5G网络是否以适当的方式提供切片。为此，我们使用STAn工具，这是一个通用的运行时验证工具，其中要监视的需求是使用时间公式表示的。本文首先确定了定义网络切片预期行为的需求列表。然后，我们描述了STAn支持的初始逻辑eLTL如何扩展到所谓的扩展事件驱动时间逻辑（extended Event-driven Temporal logic, xeLTL），以表示切片需求。最后，我们验证了新版本的STAn和xeLTL公式目录适用于监控和检查真实5G网络是否正确支持切片。通过这种方式，我们为5G网络切片的运行时监控提供了一个完整的新系统。

{"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-05-01","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

An algebraic theory of nondeterministic finite automata 不确定有限自动机的代数理论

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

Journal of Logical and Algebraic Methods in Programming

Pub Date : 2025-05-01 Epub Date: 2025-02-24 DOI: 10.1016/j.jlamp.2025.101055

Roberto Gorrieri

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 N, there exists a process algebraic term p such that its semantics is an NFA isomorphic to N. Moreover, we provide a concise axiomatization of language equivalence: two NFAs

N_{1}

and

N_{2}

recognize the same language if and only if the associated terms

p_{1}

and

p_{2}

, respectively, can be equated by means of a set of axioms, comprising 7 axioms plus 3 conditional axioms, only.

提出了一个过程代数，它的语义将一个项映射到一个不确定性有限自动机（简称NFA）。我们证明了一个可表征性定理：对于每个NFA N，存在一个过程代数项p，使得它的语义与N同构。此外，我们提供了一个简洁的语言等价公理：两个NFA N1和N2承认同一语言，当且仅当相关项p1和p2分别可以通过一组公理（包括7个公理和3个条件公理）来等价。

引用次数: 0

Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms 通过从组态到项的内射函数，将命令式程序转化为双相似的逻辑约束项重写系统

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

Journal of Logical and Algebraic Methods in Programming

Pub Date : 2025-05-01 Epub Date: 2025-02-24 DOI: 10.1016/j.jlamp.2025.101056

Naoki Nishida, Misaki Kojima , Takumi Kato

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.

为了将一个指令式程序转换为逻辑约束的术语重写系统（简称LCTRS），之前的工作将语句列表逐步转换为重写规则，并沿着转换和程序的大步语义证明了其正确性。另一方面，编程语言的小步骤语义由定义单个配置转换的推理规则组成。这种推理规则的部分实例与转换后的LCTRS中的重写规则几乎相同。在本文中，我们旨在建立一个框架，用于从程序到lctrs的转换的更简单的定义和正确性证明。为此，我们以前面工作中的变换为例，证明了给定程序的组形到项的单射函数的存在性，并利用单射函数对变换进行了重新表述。单射函数使我们能够在单个小步转换和约简步骤之间建立一对一的对应关系，并提供了程序与变换后的LCTRS之间的双相似性，从而简化了正确性证明。

{"title":"Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms","authors":"Naoki Nishida, Misaki Kojima , 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-05-01","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区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Journal of Logical and Algebraic Methods in Programming

Pub Date : 2025-03-01 Epub Date: 2025-02-15 DOI: 10.1016/j.jlamp.2025.101048

Francisco Durán , Carlos Ramírez , Camilo Rocha , Nicolás Pozas

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.

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

引用次数: 0

Open compliance in multiparty sessions with partial typing 在带有部分类型的多方会话中开放遵从性

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

Journal of Logical and Algebraic Methods in Programming

Pub Date : 2025-03-01 Epub Date: 2025-01-31 DOI: 10.1016/j.jlamp.2025.101046

Franco Barbanera , Viviana Bono , Mariangiola Dezani-Ciancaglini

Multiparty sessions are a foundational model for distributed entities interacting through message passing. Communication is disciplined by global types: well-typed sessions are lock-free and their participants do follow the described protocols. A key issue is the composition of well-typed sessions, that we face via the participants-as-interfaces approach. We study session composition when a client session is connected to compliant server sessions, where compliance is naturally biased towards the client. We prove that a unique session can be constructed by transforming the interface participants of the client and the servers into gateways (that is, forwarders), if the sessions are well-typed and the compliance relation can be proved. The obtained session has a global type that can be derived from the global types of the composing sessions and the proof of compliance among the client and the servers. A novelty of our approach is that in the composition we only ensure Lock-freedom for the client session, disregarding this property for the server sessions, via a partial typing system. This choice strongly simplifies the construction of the gateways. We consider the present study as a further step toward a theory of Open MultiParty Session Types.

多方会话是分布式实体通过消息传递进行交互的基础模型。通信是由全局类型约束的：类型良好的会话是无锁的，它们的参与者遵循所描述的协议。一个关键问题是类型良好的会话的组合，这是我们通过参与者即接口方法所面临的问题。当客户端会话连接到兼容的服务器会话时，我们研究会话组成，其中遵从性自然偏向于客户端。我们证明，如果会话类型良好且遵从性关系可以证明，则可以通过将客户端和服务器的接口参与者转换为网关（即转发器）来构造唯一会话。获得的会话具有全局类型，该类型可以从组合会话的全局类型和客户端和服务器之间的遵从性证明中派生出来。我们方法的新颖之处在于，在组合中，我们只通过部分类型系统确保客户端会话的锁自由，而忽略服务器会话的锁自由属性。这种选择极大地简化了网关的构造。我们认为本研究是向开放多方会议类型理论迈出的又一步。

{"title":"Open compliance in multiparty sessions with partial typing","authors":"Franco Barbanera , Viviana Bono , Mariangiola Dezani-Ciancaglini","doi":"10.1016/j.jlamp.2025.101046","DOIUrl":"10.1016/j.jlamp.2025.101046","url":null,"abstract":"<div><div>Multiparty sessions are a foundational model for distributed entities interacting through message passing. Communication is disciplined by global types: well-typed sessions are lock-free and their participants do follow the described protocols. A key issue is the composition of well-typed sessions, that we face via the <em>participants-as-interfaces</em> approach. We study session composition when a client session is connected to compliant server sessions, where compliance is naturally biased towards the client. We prove that a unique session can be constructed by transforming the interface participants of the client and the servers into gateways (that is, forwarders), if the sessions are well-typed and the compliance relation can be proved. The obtained session has a global type that can be derived from the global types of the composing sessions and the proof of compliance among the client and the servers. A novelty of our approach is that in the composition we only ensure Lock-freedom for the client session, disregarding this property for the server sessions, via a partial typing system. This choice strongly simplifies the construction of the gateways. We consider the present study as a further step toward a theory of <em>Open</em> MultiParty Session Types.</div></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"144 ","pages":"Article 101046"},"PeriodicalIF":0.7,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143092824","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

Efficient iterative programs with distributed data collections 具有分布式数据集合的高效迭代程序

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

Journal of Logical and Algebraic Methods in Programming

Pub Date : 2025-03-01 Epub Date: 2025-02-12 DOI: 10.1016/j.jlamp.2025.101047

Sarah Chlyah, Nils Gesbert, Pierre Genevès, Nabil Layaïda

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.

大数据编程框架对于性能和可伸缩性至关重要的应用程序的开发变得越来越重要。在这些复杂的框架中，手动优化代码既困难又耗时，因此自动化优化尤为必要。为了自动化优化，一个先决条件是找到合适的抽象来表示程序；例如，基于单子或单子的代数来表示分布式数据集合。然而，目前，这样的代数不能以一种允许分析或重写它们的方式来表示递归程序。在本文中，我们用一个不动点算子扩展了一元代数，将递归表示为一类公民，并展示了它如何实现新的优化。在Spark平台上的实验证明了这些系统优化带来的性能提升。

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Journal of Logical and Algebraic Methods in Programming

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀