Theory Pract. Object Syst.最新文献

英文中文

Design and Implementation of Pep, A Java Just-in-Time Translator Java即时翻译器Pep的设计与实现

Theory Pract. Object Syst.

Pub Date : 1997-06-01 DOI: 10.1002/(SICI)1096-9942(1997)3:2<127::AID-TAPO4>3.0.CO;2-S

Ole Agesen

Java, a new object-oriented member of the C family of languages, has become popular in part because it emphasizes portability. Portability is achieved by compiling programs to machine-independent bytecodes that can be interpreted on a Java virtual machine. Unfortunately, interpreted performance does not match native code performance. A just-in-time compiler can regain performance without sacrificing portability by turning the bytecodes into native code at runtime. This idea has a proven track record: Deutsch and Schiffman presented a dynamic Smalltalk compiler in 1984 [5], and the Self system currently sports a dynamic type-feedback based optimizing compiler [12]. To study the performance potential of Java with this state-of-the-art optimization technology, we built Pep, a just-in-time compiler from Java bytecodes to Self. Following translation by Pep, Java programs can execute on the Self virtual machine and benefit from the optimizations performed by Self's compiler. We describe the design and implementation of Pep, focusing on concepts and trade-offs, but also compare performance with the JDK 1.0.2 and 1.1 interpreters. © 1997 John Wiley & Sons, Inc.

Java是C语言家族中面向对象的新成员，它之所以流行，部分原因在于它强调可移植性。可移植性是通过将程序编译成可在Java虚拟机上解释的与机器无关的字节码来实现的。不幸的是，解释型代码的性能与本机代码的性能不匹配。通过在运行时将字节码转换为本机代码，即时编译器可以在不牺牲可移植性的情况下恢复性能。这个想法有一个经过验证的记录:Deutsch和Schiffman在1984年提出了一个动态Smalltalk编译器[5]，而Self系统目前采用了一个基于动态类型反馈的优化编译器[12]。为了利用这种最先进的优化技术研究Java的性能潜力，我们构建了Pep，这是一个从Java字节码到Self的即时编译器。经过Pep的翻译后，Java程序可以在Self虚拟机上执行，并从Self编译器执行的优化中获益。我们将描述Pep的设计和实现，重点关注概念和权衡，但也将性能与JDK 1.0.2和1.1解释器进行比较。©1997 John Wiley & Sons, Inc

{"title":"Design and Implementation of Pep, A Java Just-in-Time Translator","authors":"Ole Agesen","doi":"10.1002/(SICI)1096-9942(1997)3:2<127::AID-TAPO4>3.0.CO;2-S","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9942(1997)3:2<127::AID-TAPO4>3.0.CO;2-S","url":null,"abstract":"Java, a new object-oriented member of the C family of languages, has become popular in part because it emphasizes portability. Portability is achieved by compiling programs to machine-independent bytecodes that can be interpreted on a Java virtual machine. Unfortunately, interpreted performance does not match native code performance. A just-in-time compiler can regain performance without sacrificing portability by turning the bytecodes into native code at runtime. This idea has a proven track record: Deutsch and Schiffman presented a dynamic Smalltalk compiler in 1984 [5], and the Self system currently sports a dynamic type-feedback based optimizing compiler [12]. To study the performance potential of Java with this state-of-the-art optimization technology, we built Pep, a just-in-time compiler from Java bytecodes to Self. Following translation by Pep, Java programs can execute on the Self virtual machine and benefit from the optimizations performed by Self's compiler. We describe the design and implementation of Pep, focusing on concepts and trade-offs, but also compare performance with the JDK 1.0.2 and 1.1 interpreters. © 1997 John Wiley & Sons, Inc.","PeriodicalId":293061,"journal":{"name":"Theory Pract. Object Syst.","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123433767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Law-Governed Regularities in Object Systems, Part 2: A Concrete Implementation 对象系统中的规律，第2部分:具体实现

Theory Pract. Object Syst.

Pub Date : 1997-06-01 DOI: 10.1002/(SICI)1096-9942(1997)3:2<87::AID-TAPO2>3.3.CO;2-P

N. Minsky, P. Pal

Regularities, or the conformity to unifying principles, are essential to the comprehensibility, manageability, and reliability of large software systems and should, therefore, be considered an important element of their architecture. But the inherent globality of regularities makes them very hard to implement in traditional methods. We have argued in a previously published companion paper that this difficulty can be alleviated by means of law-governed architecture (LGA), under which a system designer can establish a desired regularity (of a certain kind) simply by declaring it formally and explicitly as the law of the system. Once such a law-governed regularity is declared, it is enforced by the environment in which the system is developed. This paper discusses the application of LGA to traditional, class-based, object-oriented languages, using the Eiffel language for specificity. We introduce here the formalism for specifying laws that govern systems written in this language, and give a sample of regularities that can be efficiently established by such laws. As a case study, we show how one can establish a kernelized architecture suitable for the construction of critical embedded software, such as the software embedded in an intensive care unit. © 1997 John Wiley & Sons, Inc.

规则性，或者与统一原则的一致性，对于大型软件系统的可理解性、可管理性和可靠性是必不可少的，因此，应该被认为是其体系结构的重要元素。但是规则的固有全局性使得它们很难在传统方法中实现。我们在之前发表的一篇论文中讨论过，这种困难可以通过法律管理的体系结构(LGA)来缓解，在这种体系结构下，系统设计者可以简单地通过正式和明确地将其声明为系统的法律来建立期望的规律性(某种类型)。一旦这样一个受法律约束的规则被宣布，它就会被开发系统的环境所强制执行。本文讨论了LGA在传统的、基于类的、面向对象的语言中的应用，具体使用了Eiffel语言。我们在这里介绍用于指定支配用这种语言编写的系统的规律的形式主义，并给出可以通过这种规律有效地建立的规律的示例。作为一个案例研究，我们展示了如何建立一个适合于构建关键嵌入式软件的内核架构，例如嵌入在重症监护病房中的软件。©1997 John Wiley & Sons, Inc

{"title":"Law-Governed Regularities in Object Systems, Part 2: A Concrete Implementation","authors":"N. Minsky, P. Pal","doi":"10.1002/(SICI)1096-9942(1997)3:2<87::AID-TAPO2>3.3.CO;2-P","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9942(1997)3:2<87::AID-TAPO2>3.3.CO;2-P","url":null,"abstract":"Regularities, or the conformity to unifying principles, are essential to the comprehensibility, manageability, and reliability of large software systems and should, therefore, be considered an important element of their architecture. But the inherent globality of regularities makes them very hard to implement in traditional methods. We have argued in a previously published companion paper that this difficulty can be alleviated by means of law-governed architecture (LGA), under which a system designer can establish a desired regularity (of a certain kind) simply by declaring it formally and explicitly as the law of the system. Once such a law-governed regularity is declared, it is enforced by the environment in which the system is developed. This paper discusses the application of LGA to traditional, class-based, object-oriented languages, using the Eiffel language for specificity. We introduce here the formalism for specifying laws that govern systems written in this language, and give a sample of regularities that can be efficiently established by such laws. As a case study, we show how one can establish a kernelized architecture suitable for the construction of critical embedded software, such as the software embedded in an intensive care unit. © 1997 John Wiley & Sons, Inc.","PeriodicalId":293061,"journal":{"name":"Theory Pract. Object Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132946585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 44

Class-Graph Inference for Adaptive Programs 自适应程序的类图推理

Theory Pract. Object Syst.

Pub Date : 1997-06-01 DOI: 10.1002/(SICI)1096-9942(1997)3:2<75::AID-TAPO1>3.3.CO;2-X

J. Palsberg

Software generators can adapt components to changes in the architectures in which the components operate. The idea is to keep the architecture description separate and let the software generator mix it with specications of each component. Adaptation is done by regeneration: when the architecture changes, the components are regenerated. A software component will usually be written with a particular architecture in mind. This raises the question: how much has it committed to the particular structure of that architecture? To put it in a nutshell: How exible is a given software component? In this paper we study this question in the setting of Lieberherr’s adaptive programming. Lieberherr uses class graphs as the architecture and so-called adaptive programs as the software components. We present a polynomial-time class-graph inference algorithm for adaptive programs. The algorithm builds a representation of the set of class graphs with which a given adaptive program can work. It also decides if the set is non-empty, and if so it computes a particularly simple graph in the solution set. Several toy programs have been processed by a prototype implementation of the algorithm.

软件生成器可以使组件适应组件运行的体系结构中的变化。其思想是保持体系结构描述的分离，并让软件生成器将其与每个组件的规范混合在一起。适应性是通过再生完成的:当体系结构发生变化时，组件也会再生。在编写软件组件时，通常会考虑到特定的体系结构。这就提出了一个问题:它对该体系结构的特定结构投入了多少?简而言之:给定的软件组件有多灵活?本文在利伯海尔自适应规划的情况下研究了这一问题。Lieberherr使用类图作为架构，并使用所谓的自适应程序作为软件组件。提出了一种多项式时间类图推理算法。该算法建立了类图集合的表示，给定的自适应程序可以使用这些图来工作。它还决定这个集合是否为空，如果是非空的，它在解集中计算一个特别简单的图。几个玩具程序已处理的原型实现的算法。

{"title":"Class-Graph Inference for Adaptive Programs","authors":"J. Palsberg","doi":"10.1002/(SICI)1096-9942(1997)3:2<75::AID-TAPO1>3.3.CO;2-X","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9942(1997)3:2<75::AID-TAPO1>3.3.CO;2-X","url":null,"abstract":"Software generators can adapt components to changes in the architectures in which the components operate. The idea is to keep the architecture description separate and let the software generator mix it with specications of each component. Adaptation is done by regeneration: when the architecture changes, the components are regenerated. A software component will usually be written with a particular architecture in mind. This raises the question: how much has it committed to the particular structure of that architecture? To put it in a nutshell: How exible is a given software component? In this paper we study this question in the setting of Lieberherr’s adaptive programming. Lieberherr uses class graphs as the architecture and so-called adaptive programs as the software components. We present a polynomial-time class-graph inference algorithm for adaptive programs. The algorithm builds a representation of the set of class graphs with which a given adaptive program can work. It also decides if the set is non-empty, and if so it computes a particularly simple graph in the solution set. Several toy programs have been processed by a prototype implementation of the algorithm.","PeriodicalId":293061,"journal":{"name":"Theory Pract. Object Syst.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125714319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

T_Chimera: A Temporal Object-Oriented Data Model T_Chimera:一个时间面向对象的数据模型

Theory Pract. Object Syst.

Pub Date : 1997-06-01 DOI: 10.1002/(SICI)1096-9942(1997)3:2<103::AID-TAPO3>3.0.CO;2-W

E. Bertino, E. Ferrari, G. Guerrini

Temporal data models are an active research area. However, although many temporal extensions have been proposed for the relational data model, there is no comparable amount of work in the context of object-oriented data models. This paper presents T―Chimera, a temporal extension of the Chimera object-oriented data model. The main contribution of this work is to define a formal temporal object-oriented data model and to address on a formal basis several issues deriving from the introduction of time in a semantically rich model like the object-oriented one. © 1997 John Wiley & Sons, Inc.

时间数据模型是一个活跃的研究领域。然而，尽管已经为关系数据模型提出了许多时间扩展，但在面向对象数据模型上下文中却没有相应的工作量。本文提出了T-Chimera，它是Chimera面向对象数据模型的时间扩展。这项工作的主要贡献是定义了一个正式的时间面向对象数据模型，并在正式的基础上解决了在语义丰富的模型(如面向对象模型)中引入时间所产生的几个问题。©1997 John Wiley & Sons, Inc

引用次数: 30

A Processing Model for Two-Dimensional Images Based on the Object-Oriented Paradigm 基于面向对象范式的二维图像处理模型

Theory Pract. Object Syst.

Pub Date : 1996-12-31 DOI: 10.1002/(SICI)1096-9942(1996)2:4<227::AID-TAPO1>3.3.CO;2-V

Giuseppe Boccignone, M. D. Santo, A. Chianese, A. Picariello

引用次数: 2

Combining Reflection and Finite State Diagrams for Design Enforcement 结合反射图和有限状态图实现设计

Theory Pract. Object Syst.

Pub Date : 1996-12-31 DOI: 10.1002/(SICI)1096-9942(1996)2:4<269::AID-TAPO3>3.0.CO;2-P

Shaul Simhi, V. Gafni, A. Yehudai

This article presents a method for design enforcement, based on a combination of reflection and State Machine Diagrams. The method is supported by RECOS, a REflective system in a Concurrent Object-oriented environment that uses Finite State Diagrams. The reflection methodology is now a developing branch in computer science for controlling and modifying systems, particularly Object-Oriented systems. RECOS is a “base-system” under which other systems can be built. Combining concepts of Concurrent Object-Oriented design, Finite State Diagrams, and reflection leads to an increase in the reliability of the systems, by insuring that objects function according to their design. RECOS also presents a safe way for handling modifications of the systems. We attempt to provide the developer of a system under RECOS with an environment that balances between easing implementation effort and guarding against unsafe implementations. We address here the issue of reflection, present the structure of RECOS, using as a running example a heating system, and briefly discuss implementation details and future work. © 1997 John Wiley & Sons, Inc.

本文提出了一种基于反射图和状态机图组合的设计实施方法。该方法由RECOS支持，RECOS是一个使用有限状态图的并发面向对象环境中的反射系统。反射方法学现在是计算机科学中用于控制和修改系统，特别是面向对象系统的一个发展中的分支。RECOS是一个“基础系统”，在此基础上可以建立其他系统。结合并发面向对象设计、有限状态图和反射的概念，通过确保对象按照其设计运行，可以提高系统的可靠性。RECOS还提供了一种处理系统修改的安全方法。我们试图为RECOS下的系统开发人员提供一个在减轻实现工作量和防止不安全实现之间取得平衡的环境。本文讨论了反射问题，介绍了RECOS的结构，并以供热系统为例，简要讨论了实现细节和未来的工作。©1997 John Wiley & Sons, Inc

{"title":"Combining Reflection and Finite State Diagrams for Design Enforcement","authors":"Shaul Simhi, V. Gafni, A. Yehudai","doi":"10.1002/(SICI)1096-9942(1996)2:4<269::AID-TAPO3>3.0.CO;2-P","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9942(1996)2:4<269::AID-TAPO3>3.0.CO;2-P","url":null,"abstract":"This article presents a method for design enforcement, based on a combination of reflection and State Machine Diagrams. The method is supported by RECOS, a REflective system in a Concurrent Object-oriented environment that uses Finite State Diagrams. The reflection methodology is now a developing branch in computer science for controlling and modifying systems, particularly Object-Oriented systems. RECOS is a “base-system” under which other systems can be built. Combining concepts of Concurrent Object-Oriented design, Finite State Diagrams, and reflection leads to an increase in the reliability of the systems, by insuring that objects function according to their design. RECOS also presents a safe way for handling modifications of the systems. We attempt to provide the developer of a system under RECOS with an environment that balances between easing implementation effort and guarding against unsafe implementations. We address here the issue of reflection, present the structure of RECOS, using as a running example a heating system, and briefly discuss implementation details and future work. © 1997 John Wiley & Sons, Inc.","PeriodicalId":293061,"journal":{"name":"Theory Pract. Object Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123203728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Enhancing Object-Oriented Methods with Formal Notations 用形式化符号增强面向对象方法

Theory Pract. Object Syst.

Pub Date : 1996-12-31 DOI: 10.1002/(SICI)1096-9942(1996)2:4<247::AID-TAPO2>3.0.CO;2-R

K. Lano

引用次数: 13

Law-Governed Regularities in Object Systems. Part 1: An Abstract Model 对象系统中受法律支配的规律。第1部分:抽象模型

Theory Pract. Object Syst.

Pub Date : 1996-12-31 DOI: 10.1002/(SICI)1096-9942(1996)2:4<283::AID-TAPO4>3.0.CO;2-V

N. Minsky

Regularities, or the conformity to unifying principles, are essential to the comprehensibility, manageability and reliability of large software systems. Yet, as is argued in this paper, the inherent globality of regularities makes them very hard to establish in traditional methods. This paper explores an approach to regularities for object systems which greatly simplifies their implementation, making them more easily employable for taming of the complexities of large scale software. This approach, which is based on a generalized concept of law-governed architecture (LGA) introduced in this paper, provides system designers and builders with the means for establishing a fairly wide range of useful regularities simply by declaring them formally and explicitly as the law of the system. Once such a law-governed regularity is declared, it is enforced by the environment in which the system is developed. keywords: Complexity in software, regularities, object-systems, software-development environments. 1Work supported in part by NSF grant No. CCR-9308773.

规则性，或与统一原则的一致性，对于大型软件系统的可理解性、可管理性和可靠性是必不可少的。然而，正如本文所论述的那样，规律的固有全局性使得它们很难在传统方法中建立起来。本文探讨了一种对象系统的规则性方法，这种方法大大简化了对象系统的实现，使它们更容易用于大规模软件的复杂性。这种方法，是基于在本文中介绍的法律管理架构(LGA)的广义概念，为系统设计者和构建者提供了建立相当广泛的有用的规则的方法，只需通过将它们正式和明确地声明为系统的法律。一旦这样一个受法律约束的规则被宣布，它就会被开发系统的环境所强制执行。关键词:软件复杂性，规律性，对象系统，软件开发环境。部分工作由美国国家科学基金资助。ccr - 9308773。

引用次数: 59

Specifying Subject-Oriented Composition 指定面向主题的组合

Theory Pract. Object Syst.

Pub Date : 1996-12-01 DOI: 10.1002/(SICI)1096-9942(1996)2:3<179::AID-TAPO4>3.0.CO;2-R

H. Ossher, M. Kaplan, Alexander Katz, W. Harrison, V. Kruskal

Subject-oriented programming supports composition of object-oriented programs or program fragments called subjects. This article presents an approach to specifying desired compositions in a convenient and concise manner. We motivate the need for subject composition, and illustrate the key issues. We define a low-level model in which composition is controlled by detailed attributes. We then describe higher-level composition rules as collections of attributes that, together, provide some desired aspect of composition functionality. Compositions are specified by means of composition expressions written as collections of rules, typically a general rule along with rules specifying exceptions. A rule library is thus an open-ended collection of useful abstractions in terms of which to define compositions. We give definitions of a few common rules, Including merge and override, as a first step towards a generally useful composition rule library. We also outline an object-oriented framework for implementing our composition approach, which we are currently building as part of our support for subject-oriented programming in C++. © 1996 John Wiley & Sons, Inc.

面向主题的编程支持面向对象程序或称为主题的程序片段的组合。本文介绍了一种以方便和简洁的方式指定所需组合的方法。我们激发主题组成的需要，并说明关键问题。我们定义了一个低级模型，其中的组合由详细的属性控制。然后，我们将高级组合规则描述为属性集合，这些属性集合一起提供组合功能的某些期望方面。组合是通过组合表达式来指定的，这些表达式写成规则的集合，通常是通用规则和指定例外的规则。因此，规则库是一个有用抽象的开放式集合，可以根据它来定义组合。我们给出了一些常见规则的定义，包括合并和覆盖，作为构建通用组合规则库的第一步。我们还概述了一个面向对象的框架，用于实现我们的组合方法，我们目前正在构建这个框架，作为支持c++中面向主题编程的一部分。©1996 John Wiley & Sons, Inc

{"title":"Specifying Subject-Oriented Composition","authors":"H. Ossher, M. Kaplan, Alexander Katz, W. Harrison, V. Kruskal","doi":"10.1002/(SICI)1096-9942(1996)2:3<179::AID-TAPO4>3.0.CO;2-R","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9942(1996)2:3<179::AID-TAPO4>3.0.CO;2-R","url":null,"abstract":"Subject-oriented programming supports composition of object-oriented programs or program fragments called subjects. This article presents an approach to specifying desired compositions in a convenient and concise manner. We motivate the need for subject composition, and illustrate the key issues. We define a low-level model in which composition is controlled by detailed attributes. We then describe higher-level composition rules as collections of attributes that, together, provide some desired aspect of composition functionality. Compositions are specified by means of composition expressions written as collections of rules, typically a general rule along with rules specifying exceptions. A rule library is thus an open-ended collection of useful abstractions in terms of which to define compositions. We give definitions of a few common rules, Including merge and override, as a first step towards a generally useful composition rule library. We also outline an object-oriented framework for implementing our composition approach, which we are currently building as part of our support for subject-oriented programming in C++. © 1996 John Wiley & Sons, Inc.","PeriodicalId":293061,"journal":{"name":"Theory Pract. Object Syst.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125568274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 111

The MultiView OODB View System: Design and Implementation 多视图OODB视图系统的设计与实现

Theory Pract. Object Syst.

Pub Date : 1996-12-01 DOI: 10.1002/(SICI)1096-9942(1996)2:3<203::AID-TAPO5>3.3.CO;2-U

Harumi A. Kuno, Elke A. Rundensteiner

引用次数: 61

首页上一页

下一页尾页

类型

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

数据库

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

期刊

Theory Pract. Object Syst.

全部 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.

﹀