首页 > 最新文献

Formal Aspects of Computing最新文献

英文 中文
Mechanised Operational Reasoning for C11 Programs with Relaxed Dependencies 具有宽松依赖关系的C11程序的机械化操作推理
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-01-13 DOI: 10.1145/3580285
Daniel Wright, Sadegh Dalvandi, Mark Batty, Brijesh Dongol
Verification techniques for C11 programs have advanced significantly in recent years with the development of operational semantics and associated logics for increasingly large fragments of C11. However, these semantics and logics have been developed in a restricted setting to avoid the thin-air-read problem. In this article, we propose an operational semantics that leverages an intra-thread partial order (called semantic dependencies) induced by a recently developed denotational event-structure-based semantics. We prove that our operational semantics is sound and complete with respect to the denotational semantics. We present an associated logic that generalises a recent Owicki–Gries framework for RC11 RAR (repaired C11) with relaxed and release-acquire accesses. We describe the mechanisation of the logic in the Isabelle/HOL theorem prover, which we use to prove correctness of a number of examples.
近年来,随着操作语义和相关逻辑的发展,C11程序的验证技术有了显著的进步。然而,这些语义和逻辑是在受限的环境中开发的,以避免稀薄空气读取问题。在本文中,我们提出了一种操作语义,它利用了最近开发的基于指称事件结构的语义引起的线程内部分顺序(称为语义依赖)。我们证明了我们的操作语义相对于指称语义是健全和完备的。我们提出了一个相关的逻辑,该逻辑推广了RC11 RAR(修复C11)的最新Owicki-Gries框架,该框架具有放松和释放获取访问。我们在Isabelle/HOL定理证明器中描述了逻辑的机械化,我们用它来证明一些例子的正确性。
{"title":"Mechanised Operational Reasoning for C11 Programs with Relaxed Dependencies","authors":"Daniel Wright, Sadegh Dalvandi, Mark Batty, Brijesh Dongol","doi":"10.1145/3580285","DOIUrl":"https://doi.org/10.1145/3580285","url":null,"abstract":"Verification techniques for C11 programs have advanced significantly in recent years with the development of operational semantics and associated logics for increasingly large fragments of C11. However, these semantics and logics have been developed in a restricted setting to avoid the thin-air-read problem. In this article, we propose an operational semantics that leverages an intra-thread partial order (called semantic dependencies) induced by a recently developed denotational event-structure-based semantics. We prove that our operational semantics is sound and complete with respect to the denotational semantics. We present an associated logic that generalises a recent Owicki–Gries framework for RC11 RAR (repaired C11) with relaxed and release-acquire accesses. We describe the mechanisation of the logic in the Isabelle/HOL theorem prover, which we use to prove correctness of a number of examples.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"35 1","pages":"1 - 27"},"PeriodicalIF":1.0,"publicationDate":"2023-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43201561","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 Refinement-based Formal Development of Cyber-physical Railway Signalling Systems 基于细化的信息物理铁路信号系统形式化开发
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-01-12 DOI: https://dl.acm.org/doi/10.1145/3524052
Yamine Aït-Ameur, Sergiy Bogomolov, Guillaume Dupont, Alexei Iliasov, Alexander Romanovsky, Paulius Stankaitis

For years, formal methods have been successfully applied in the railway domain to formally demonstrate safety of railway systems. Despite that, little has been done in the field of formal methods to address the cyber-physical nature of modern railway signalling systems. In this article, we present an approach for a formal development of cyber-physical railway signalling systems that is based on a refinement-based modelling and proof-based verification. Our approach utilises the Event-B formal specification language together with a hybrid system and communication modelling patterns to developing a generic hybrid railway signalling system model that can be further refined to capture a specific railway signalling system. The main technical contribution of this article is the refinement of the hybrid train Event-B model with other railway signalling sub-systems. The complete model of the cyber-physical railway signalling system was formally proved to ensure a safe rolling stock separation and prevent their derailment. Furthermore, the article demonstrates the advantage of the refinement-based development approach of cyber-physical systems, which enables a problem decomposition and in turn reduction in the verification and modelling effort.

多年来,形式化方法已成功地应用于铁路领域,对铁路系统的安全性进行形式化论证。尽管如此,在解决现代铁路信号系统的网络物理性质的正式方法领域做得很少。在本文中,我们提出了一种基于基于改进的建模和基于证明的验证的网络物理铁路信号系统的正式开发方法。我们的方法利用Event-B正式规范语言以及混合系统和通信建模模式来开发通用混合铁路信号系统模型,该模型可以进一步细化以捕获特定的铁路信号系统。本文的主要技术贡献是将混合列车Event-B模型与其他铁路信号子系统进行了细化。正式验证了网络物理铁路信号系统的完整模型,以确保车辆安全分离和防止脱轨。此外,本文还展示了基于细化的网络物理系统开发方法的优势,它可以分解问题,从而减少验证和建模的工作量。
{"title":"A Refinement-based Formal Development of Cyber-physical Railway Signalling Systems","authors":"Yamine Aït-Ameur, Sergiy Bogomolov, Guillaume Dupont, Alexei Iliasov, Alexander Romanovsky, Paulius Stankaitis","doi":"https://dl.acm.org/doi/10.1145/3524052","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3524052","url":null,"abstract":"<p>For years, formal methods have been successfully applied in the railway domain to formally demonstrate safety of railway systems. Despite that, little has been done in the field of formal methods to address the cyber-physical nature of modern railway signalling systems. In this article, we present an approach for a formal development of cyber-physical railway signalling systems that is based on a refinement-based modelling and proof-based verification. Our approach utilises the Event-B formal specification language together with a hybrid system and communication modelling patterns to developing a generic hybrid railway signalling system model that can be further refined to capture a specific railway signalling system. The main technical contribution of this article is the refinement of the hybrid train Event-B model with other railway signalling sub-systems. The complete model of the cyber-physical railway signalling system was formally proved to ensure a safe rolling stock separation and prevent their derailment. Furthermore, the article demonstrates the advantage of the refinement-based development approach of cyber-physical systems, which enables a problem decomposition and in turn reduction in the verification and modelling effort.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"36 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517771","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
Compositional Verification of Railway Interlocking Systems 铁路联锁系统的组成验证
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-01-12 DOI: https://dl.acm.org/doi/10.1145/3549736
Anne Elisabeth Haxthausen, Alessandro Fantechi

Model checking techniques have often been applied to the verification of railway interlocking systems, responsible for guiding trains safely through a given railway network. However, these techniques fail to scale to the interlocking systems controlling large stations, composed of hundreds and even thousands of controlled entities, due to the state space explosion problem. Indeed, interlocking systems exhibit a certain degree of locality that allows some reasoning only on the mere set of entities that regard the train movements, but safe routing through a complex station layout requires a global reservation policy, which can require global state conditions to be taken into account.

In this article, we present a compositional approach aimed at chopping the verification of a large interlocking system into that of smaller fragments, exploiting in each fragment a proper abstraction of the global information on routing state. A proof is given of the thesis that verifying the safety of the smaller fragments is sufficient to verify the safety of the whole network. Experiments using this compositional approach have shown important gains in performance of the verification, as well as in the size of affordable station layouts.

模型检验技术经常应用于铁路联锁系统的验证,该系统负责引导列车安全通过给定的铁路网。然而,由于状态空间爆炸问题,这些技术无法扩展到控制由数百甚至数千个受控实体组成的大型站点的联锁系统。确实,联锁系统表现出一定程度的局部性,仅允许对考虑列车运动的实体集进行一些推理,但通过复杂车站布局的安全路线需要全局预留策略,这可能需要考虑全局状态条件。在本文中,我们提出了一种组合方法,旨在将大型联锁系统的验证分解为较小的片段,在每个片段中利用路由状态的全局信息的适当抽象。本文给出了一个证明:验证小分片的安全性就足以验证整个网络的安全性。使用这种组合方法的实验表明,在验证的性能以及可负担的车站布局的大小方面取得了重要的进展。
{"title":"Compositional Verification of Railway Interlocking Systems","authors":"Anne Elisabeth Haxthausen, Alessandro Fantechi","doi":"https://dl.acm.org/doi/10.1145/3549736","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3549736","url":null,"abstract":"<p>Model checking techniques have often been applied to the verification of railway interlocking systems, responsible for guiding trains safely through a given railway network. However, these techniques fail to scale to the interlocking systems controlling large stations, composed of hundreds and even thousands of controlled entities, due to the state space explosion problem. Indeed, interlocking systems exhibit a certain degree of locality that allows some reasoning only on the mere set of entities that regard the train movements, but safe routing through a complex station layout requires a global reservation policy, which can require global state conditions to be taken into account.</p><p>In this article, we present a compositional approach aimed at chopping the verification of a large interlocking system into that of smaller fragments, exploiting in each fragment a proper abstraction of the global information on routing state. A proof is given of the thesis that verifying the safety of the smaller fragments is sufficient to verify the safety of the whole network. Experiments using this compositional approach have shown important gains in performance of the verification, as well as in the size of affordable station layouts.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"122 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517762","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
Review of Logical Analysis of Hybrid Systems 混合系统逻辑分析综述
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2022-12-31 DOI: 10.1145/3561612
Gabriele Paveri-Fontana
The book is an extensive presentation of deductive methods for hybrid systems’ verification rooted in dynamic logic. The author develops both formal specification languages for hybrid systems and automated verification techniques based on them. The main focus is on the theoretical aspects of the approach, but implementation issues are also widely addressed, and a functioning tool is presented at the end of the book. The book, which is now a few years old, is based on the Ph.D. thesis of the author, but is still current, especially the more theoretical parts, as it provides the foundations, for example, of the approach of Reference [3]. Given its origin, the book is certainly of great interest for researchers dealing with hybrid systems, but it is also recommendable for anyone who is interested in the general topics of modeling and verification of complex (timed) systems. A good degree of familiarity with formal methods and mathematical logic is necessary to fully appreciate the contents of the book. The book is divided into three parts, plus an appendix. Part I focuses on theoretical aspects. The book’s approach stems from the necessity of
这本书广泛介绍了基于动态逻辑的混合系统验证的演绎方法。作者开发了混合系统的形式化规范语言和基于它们的自动验证技术。主要关注的是该方法的理论方面,但实施问题也得到了广泛讨论,并在书的末尾介绍了一个有效的工具。这本书已经出版几年了,基于作者的博士论文,但仍然是最新的,尤其是更具理论性的部分,因为它为参考文献[3]的方法提供了基础。鉴于其起源,这本书肯定会引起研究混合系统的研究人员的极大兴趣,但对于任何对复杂(定时)系统建模和验证的一般主题感兴趣的人来说,它也是值得推荐的。要充分理解本书的内容,必须熟悉形式方法和数理逻辑。这本书分为三个部分,外加一个附录。第一部分主要从理论方面进行论述。这本书的方法源于
{"title":"Review of Logical Analysis of Hybrid Systems","authors":"Gabriele Paveri-Fontana","doi":"10.1145/3561612","DOIUrl":"https://doi.org/10.1145/3561612","url":null,"abstract":"The book is an extensive presentation of deductive methods for hybrid systems’ verification rooted in dynamic logic. The author develops both formal specification languages for hybrid systems and automated verification techniques based on them. The main focus is on the theoretical aspects of the approach, but implementation issues are also widely addressed, and a functioning tool is presented at the end of the book. The book, which is now a few years old, is based on the Ph.D. thesis of the author, but is still current, especially the more theoretical parts, as it provides the foundations, for example, of the approach of Reference [3]. Given its origin, the book is certainly of great interest for researchers dealing with hybrid systems, but it is also recommendable for anyone who is interested in the general topics of modeling and verification of complex (timed) systems. A good degree of familiarity with formal methods and mathematical logic is necessary to fully appreciate the contents of the book. The book is divided into three parts, plus an appendix. Part I focuses on theoretical aspects. The book’s approach stems from the necessity of","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":" ","pages":"1 - 2"},"PeriodicalIF":1.0,"publicationDate":"2022-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49563207","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 Deep Reinforcement Learning Framework with Formal Verification 一种具有形式验证的深度强化学习框架
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2022-12-19 DOI: 10.1145/3577204
Zakaryae Boudi, Abderrahim Ait Wakrime, Mohamed Toub, M. Haloua
Artificial Intelligence (AI) and data are reshaping organizations and businesses. Human Resources (HR) management and talent development make no exception, as they tend to involve more automation and growing quantities of data. Because this brings implications on workforce, career transparency, and equal opportunities, overseeing what fuels AI and analytical models, their quality standards, integrity, and correctness becomes an imperative for those aspiring to such systems. Based on an ontology transformation to B-machines, this article presents an approach to constructing a valid and error-free career agent with Deep Reinforcement Learning (DRL). In short, the agent's policy is built on a framework we called Multi State-Actor (MuStAc) using a decentralized training approach. Its purpose is to predict both relevant and valid career steps to employees, based on their profiles and company pathways (observations). Observations can comprise various data elements such as the current occupation, past experiences, performance, skills, qualifications, and so on. The policy takes in all these observations and outputs the next recommended career step, in an environment set as the combination of an HR ontology and an Event-B model, which generates action spaces with respect to formal properties. The Event-B model and formal properties are derived using OWL to B transformation.
人工智能(AI)和数据正在重塑组织和企业。人力资源管理和人才开发也不例外,因为它们往往涉及更多的自动化和不断增长的数据量。因为这会对劳动力、职业透明度和平等机会产生影响,所以监督人工智能和分析模型的燃料、它们的质量标准、完整性和正确性对于那些渴望使用这些系统的人来说是必不可少的。基于本体到B机的转换,本文提出了一种使用深度强化学习(DRL)构建有效且无错误的职业代理的方法。简而言之,代理的策略是建立在一个我们称之为多状态参与者(MuStAc)的框架上的,该框架使用去中心化的训练方法。其目的是根据员工的个人资料和公司途径(观察结果),预测员工的相关和有效职业步骤。观察结果可以包括各种数据元素,如当前职业、过去的经历、表现、技能、资格等。该政策接受所有这些观察结果,并在HR本体和Event-B模型的组合环境中输出下一个推荐的职业步骤,Event-B模型生成与正式属性相关的动作空间。Event-B模型和形式属性是使用OWL-to-B转换导出的。
{"title":"A Deep Reinforcement Learning Framework with Formal Verification","authors":"Zakaryae Boudi, Abderrahim Ait Wakrime, Mohamed Toub, M. Haloua","doi":"10.1145/3577204","DOIUrl":"https://doi.org/10.1145/3577204","url":null,"abstract":"Artificial Intelligence (AI) and data are reshaping organizations and businesses. Human Resources (HR) management and talent development make no exception, as they tend to involve more automation and growing quantities of data. Because this brings implications on workforce, career transparency, and equal opportunities, overseeing what fuels AI and analytical models, their quality standards, integrity, and correctness becomes an imperative for those aspiring to such systems. Based on an ontology transformation to B-machines, this article presents an approach to constructing a valid and error-free career agent with Deep Reinforcement Learning (DRL). In short, the agent's policy is built on a framework we called Multi State-Actor (MuStAc) using a decentralized training approach. Its purpose is to predict both relevant and valid career steps to employees, based on their profiles and company pathways (observations). Observations can comprise various data elements such as the current occupation, past experiences, performance, skills, qualifications, and so on. The policy takes in all these observations and outputs the next recommended career step, in an environment set as the combination of an HR ontology and an Event-B model, which generates action spaces with respect to formal properties. The Event-B model and formal properties are derived using OWL to B transformation.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"35 1","pages":"1 - 17"},"PeriodicalIF":1.0,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47542056","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}
引用次数: 2
Compositional Reasoning for Non-multicopy Atomic Architectures 非多拷贝原子体系结构的组合推理
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2022-12-14 DOI: 10.1145/3574137
Nicholas Coughlin, Kirsten Winter, Graeme Smith
Rely/guarantee reasoning provides a compositional approach to reasoning about concurrent programs. However, such reasoning traditionally assumes a sequentially consistent memory model and hence is unsound on modern hardware in the presence of data races. In this article, we present a rely/guarantee-based approach for non-multicopy atomic weak memory models, i.e., where a thread’s stores are not simultaneously propagated to all other threads and hence are not observable by other threads at the same time. Such memory models include those of the earlier versions of the ARM processor as well as the POWER processor. This article builds on our approach to compositional reasoning for multicopy atomic architectures, i.e., where a thread’s stores are simultaneously propagated to all other threads. In that context, an operational semantics can be based on thread-local instruction reordering. We exploit this to provide an efficient compositional proof technique in which weak memory behaviour can be shown to preserve rely/guarantee reasoning on a sequentially consistent memory model. To achieve this, we introduce a side-condition, reordering interference freedom on each thread, reducing the complexity of weak memory to checks over pairs of reorderable instructions. In this article, we extend our approach to non-multicopy atomic weak memory models. We utilise the idea of reordering interference freedom between parallel components. This by itself would break compositionality but serves as a vehicle to derive a refined compatibility check between rely and guarantee conditions, which takes into account the effects of propagations of stores that are only partial, i.e., not covering all threads. All aspects of our approach have been encoded and proved sound in Isabelle/HOL.
依赖/保证推理提供了一种组合方法来推理并发程序。然而,这种推理传统上假设了顺序一致的内存模型,因此在存在数据竞争的现代硬件上是不可靠的。在本文中,我们为非多拷贝原子弱内存模型提供了一种基于依赖/保证的方法,即线程的存储不会同时传播到所有其他线程,因此其他线程无法同时观察到。这些内存模型包括早期版本的ARM处理器和POWER处理器。本文建立在我们对多副本原子体系结构进行组合推理的方法之上,即一个线程的存储同时传播给所有其他线程。在这种情况下,操作语义可以基于线程本地指令重排序。我们利用这一点来提供一种有效的组合证明技术,在这种技术中,弱记忆行为可以显示在顺序一致的记忆模型上保持依赖/保证推理。为了实现这一目标,我们引入了一个侧条件,在每个线程上重新排序干扰自由,减少了对可重新排序指令对进行检查的弱内存的复杂性。在本文中,我们将这种方法扩展到非多拷贝原子弱内存模型。我们利用了平行分量间干涉自由度重排序的思想。这本身会破坏组合性,但可以作为在依赖条件和保证条件之间派生精细兼容性检查的工具,它考虑了仅部分存储(即不覆盖所有线程)传播的影响。我们的方法的所有方面都在Isabelle/HOL中进行了编码和验证。
{"title":"Compositional Reasoning for Non-multicopy Atomic Architectures","authors":"Nicholas Coughlin, Kirsten Winter, Graeme Smith","doi":"10.1145/3574137","DOIUrl":"https://doi.org/10.1145/3574137","url":null,"abstract":"Rely/guarantee reasoning provides a compositional approach to reasoning about concurrent programs. However, such reasoning traditionally assumes a sequentially consistent memory model and hence is unsound on modern hardware in the presence of data races. In this article, we present a rely/guarantee-based approach for non-multicopy atomic weak memory models, i.e., where a thread’s stores are not simultaneously propagated to all other threads and hence are not observable by other threads at the same time. Such memory models include those of the earlier versions of the ARM processor as well as the POWER processor. This article builds on our approach to compositional reasoning for multicopy atomic architectures, i.e., where a thread’s stores are simultaneously propagated to all other threads. In that context, an operational semantics can be based on thread-local instruction reordering. We exploit this to provide an efficient compositional proof technique in which weak memory behaviour can be shown to preserve rely/guarantee reasoning on a sequentially consistent memory model. To achieve this, we introduce a side-condition, reordering interference freedom on each thread, reducing the complexity of weak memory to checks over pairs of reorderable instructions. In this article, we extend our approach to non-multicopy atomic weak memory models. We utilise the idea of reordering interference freedom between parallel components. This by itself would break compositionality but serves as a vehicle to derive a refined compatibility check between rely and guarantee conditions, which takes into account the effects of propagations of stores that are only partial, i.e., not covering all threads. All aspects of our approach have been encoded and proved sound in Isabelle/HOL.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"35 1","pages":"1 - 30"},"PeriodicalIF":1.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46436005","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}
引用次数: 3
From Non-punctuality to Non-adjacency: A Quest for Decidability of Timed Temporal Logics with Quantifiers 从非准时性到非邻接性:带量词的时间逻辑的可决性探索
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2022-12-06 DOI: 10.1145/3571749
S. Krishna, Khushraj Madnani, Manuel Mazo Jr., P. Pandya
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent real-time extensions of Linear Temporal Logic (LTL). In general, the satisfiability checking problem for these extensions is undecidable when both the future (Until, U) and the past (Since, S) modalities are used (denoted by MTL[U,S] and TPTL[U,S]). In a classical result, the satisfiability checking for Metric Interval Temporal Logic (MITL[U,S]), a non-punctual fragment of MTL[U,S], is shown to be decidable with EXPSPACE complete complexity. A straightforward adoption of non-punctuality does not recover decidability in the case of TPTL[U,S]. Hence, we propose a more refined notion called non-adjacency for TPTL[U,S] and focus on its 1-variable fragment, 1-TPTL[U,S]. We show that non-adjacent 1-TPTL[U,S] is strictly more expressive than MITL. As one of our main results, we show that the satisfiability checking problem for non-adjacent 1-TPTL[U,S] is decidable with EXPSPACE complete complexity. Our decidability proof relies on a novel technique of anchored interval word abstraction and its reduction to a non-adjacent version of the newly proposed logic called PnEMTL. We further propose an extension of MSO [<] (Monadic Second Order Logic of Orders) with Guarded Metric Quantifiers (GQMSO) and show that it characterizes the expressiveness of PnEMTL. That apart, we introduce the notion of non-adjacency in the context of GQMSO (NA-GQMSO), which is a syntactic generalization of logic Q2MLO due to Hirshfeld and Rabinovich and show the decidability of satisfiability checking for NA-GQMSO.
度量时间逻辑(MTL)和时间命题时间逻辑(TPTL)是线性时间逻辑(LTL)的突出的实时扩展。一般来说,当使用未来(Until, U)和过去(Since, S)模态(用MTL[U,S]和TPTL[U,S]表示)时,这些扩展的可满足性检查问题是不可确定的。在一个经典的结果中,证明了度量区间时间逻辑(Metric Interval Temporal Logic, MITL[U,S])的可满足性检验在EXPSPACE完全复杂度下是可判定的。在TPTL的情况下,直接采用非准时性并不能恢复可决性[U,S]。因此,我们为TPTL[U,S]提出了一个更精细的概念,称为非邻接性,并专注于它的1变量片段,1-TPTL[U,S]。我们证明了非相邻的1-TPTL[U,S]严格地比MITL更具表达性。作为我们的主要结果之一,我们证明了非相邻1-TPTL[U,S]的可满足性检验问题具有EXPSPACE完全复杂度。我们的可判定性证明依赖于一种锚定区间词抽象的新技术,并将其还原为新提出的逻辑的非相邻版本,称为PnEMTL。我们进一步提出了带保护度量量词(GQMSO)的MSO[<]扩展,并证明了它表征了PnEMTL的可表达性。此外,我们在Hirshfeld和Rabinovich的逻辑q2mso的句法推广中引入了非邻接性的概念(NA-GQMSO),并证明了NA-GQMSO的可满足性检验的可判定性。
{"title":"From Non-punctuality to Non-adjacency: A Quest for Decidability of Timed Temporal Logics with Quantifiers","authors":"S. Krishna, Khushraj Madnani, Manuel Mazo Jr., P. Pandya","doi":"10.1145/3571749","DOIUrl":"https://doi.org/10.1145/3571749","url":null,"abstract":"Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent real-time extensions of Linear Temporal Logic (LTL). In general, the satisfiability checking problem for these extensions is undecidable when both the future (Until, U) and the past (Since, S) modalities are used (denoted by MTL[U,S] and TPTL[U,S]). In a classical result, the satisfiability checking for Metric Interval Temporal Logic (MITL[U,S]), a non-punctual fragment of MTL[U,S], is shown to be decidable with EXPSPACE complete complexity. A straightforward adoption of non-punctuality does not recover decidability in the case of TPTL[U,S]. Hence, we propose a more refined notion called non-adjacency for TPTL[U,S] and focus on its 1-variable fragment, 1-TPTL[U,S]. We show that non-adjacent 1-TPTL[U,S] is strictly more expressive than MITL. As one of our main results, we show that the satisfiability checking problem for non-adjacent 1-TPTL[U,S] is decidable with EXPSPACE complete complexity. Our decidability proof relies on a novel technique of anchored interval word abstraction and its reduction to a non-adjacent version of the newly proposed logic called PnEMTL. We further propose an extension of MSO [<] (Monadic Second Order Logic of Orders) with Guarded Metric Quantifiers (GQMSO) and show that it characterizes the expressiveness of PnEMTL. That apart, we introduce the notion of non-adjacency in the context of GQMSO (NA-GQMSO), which is a syntactic generalization of logic Q2MLO due to Hirshfeld and Rabinovich and show the decidability of satisfiability checking for NA-GQMSO.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"35 1","pages":"1 - 50"},"PeriodicalIF":1.0,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45709905","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}
引用次数: 1
Review of Understanding Programming Languages 理解程序设计语言的回顾
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2022-12-01 DOI: 10.1145/3569959
A. Butterfield
First, a disclosure: I had every intention of buying this book before being offered the chance to review it. This was due mainly to the fact that my introduction to formal methods was via a previous book by the same author [1]! This book shows how formal specifications and semantics can enhance the quality of program and specification language development by clarifying key concepts early, and providing a clear basis for assessing the correctness of their implementations. The material in this book has also been used in final-year undergraduate teaching for a decade. This book is much more than a textbook, however. It mixes complete technical examples with commentary and copious historical notes about the development of programming languages, and their on/off relationship with formal techniques. This commentary makes the book a very natural and fluid read, and worth dipping into, as well as reading in order. Another key feature of the book is the introduction and discussion of various “Challenges” and “Language Issues.” There are 8 of the former, and 46 of the latter. These help to distill out key aspects and concerns. The book starts by showing how the ideas develop for “typical” (i.e., imperative) programming languages. This starts by using VDM notation to specify a structured operational semantics for a simple untyped imperative language. It then adds more features such as types, and code blocks. A key theme of this book is how the very definition of the semantic objects determines what the (dynamic) semantic possibilities will be. For example, dealing with memory locations, the choice to make them uninterpreted tokens rather than numbers, means that address arithmetic is ruled out. This is a significant semantic modelling choice. The remainder of the book starts to look at more complex language features, such as object orientation, records, pointers, functions/procedures, and concurrency leading to a semantics for a concurrent object-oriented language. Chapter 8 looks at shared variable concurrency and all its challenges. It shows how small-step operation semantics is able to model the non-deterministic interleaving behaviour. It then turns its attention to proof techniques, ranging from Rely/Guarantee, to Concurrent Separation Logic, and very recent mixings of the two. The author also makes the point that any process algebra that can model state change has to deal with the issue of interference: this includes CCS, CSP, and many others. Chapter 9 builds on Chapter 8 to combine concurrency with OO, in the form of the COOL language. As already mentioned above, just describing the semantic objects suffices to define the
首先,一个披露:在有机会复习这本书之前,我完全想买这本书。这主要是因为我对正式方法的介绍是通过同一作者的前一本书[1]!本书展示了形式化规范和语义如何通过尽早澄清关键概念,并为评估其实现的正确性提供明确的基础,来提高程序和规范语言开发的质量。这本书中的材料也被用于本科最后一年的教学已有十年了。然而,这本书远不止是一本教科书。它将完整的技术示例与关于编程语言的发展及其与形式技术的开/关关系的评论和丰富的历史笔记混合在一起。这篇评论使这本书读起来非常自然流畅,值得一读,也值得按顺序阅读。这本书的另一个主要特点是介绍和讨论了各种“挑战”和“语言问题”。前者有8个,后者有46个。这些有助于提炼出关键方面和关注点。本书首先展示了“典型”(即命令式)编程语言的思想是如何发展的。首先,使用VDM表示法为简单的非类型命令式语言指定结构化的操作语义。然后,它添加了更多的功能,如类型和代码块。这本书的一个关键主题是,语义对象的定义如何决定(动态)语义的可能性。例如,处理内存位置,选择使其成为不可理解的标记而不是数字,意味着地址算术被排除在外。这是一个重要的语义建模选择。本书的其余部分开始研究更复杂的语言特性,如面向对象、记录、指针、函数/过程和并发性,从而形成并发面向对象语言的语义。第8章介绍了共享变量并发及其所有挑战。它展示了小步操作语义如何能够对非确定性交织行为进行建模。然后,它将注意力转向证明技术,从Rely/Guarantee到并发分离逻辑,以及这两者最近的混合。作者还指出,任何能够对状态变化建模的过程代数都必须处理干扰问题:这包括CCS、CSP和许多其他问题。第9章建立在第8章的基础上,以COOL语言的形式将并发性与OO相结合。如上所述,仅描述语义对象就足以定义
{"title":"Review of Understanding Programming Languages","authors":"A. Butterfield","doi":"10.1145/3569959","DOIUrl":"https://doi.org/10.1145/3569959","url":null,"abstract":"First, a disclosure: I had every intention of buying this book before being offered the chance to review it. This was due mainly to the fact that my introduction to formal methods was via a previous book by the same author [1]! This book shows how formal specifications and semantics can enhance the quality of program and specification language development by clarifying key concepts early, and providing a clear basis for assessing the correctness of their implementations. The material in this book has also been used in final-year undergraduate teaching for a decade. This book is much more than a textbook, however. It mixes complete technical examples with commentary and copious historical notes about the development of programming languages, and their on/off relationship with formal techniques. This commentary makes the book a very natural and fluid read, and worth dipping into, as well as reading in order. Another key feature of the book is the introduction and discussion of various “Challenges” and “Language Issues.” There are 8 of the former, and 46 of the latter. These help to distill out key aspects and concerns. The book starts by showing how the ideas develop for “typical” (i.e., imperative) programming languages. This starts by using VDM notation to specify a structured operational semantics for a simple untyped imperative language. It then adds more features such as types, and code blocks. A key theme of this book is how the very definition of the semantic objects determines what the (dynamic) semantic possibilities will be. For example, dealing with memory locations, the choice to make them uninterpreted tokens rather than numbers, means that address arithmetic is ruled out. This is a significant semantic modelling choice. The remainder of the book starts to look at more complex language features, such as object orientation, records, pointers, functions/procedures, and concurrency leading to a semantics for a concurrent object-oriented language. Chapter 8 looks at shared variable concurrency and all its challenges. It shows how small-step operation semantics is able to model the non-deterministic interleaving behaviour. It then turns its attention to proof techniques, ranging from Rely/Guarantee, to Concurrent Separation Logic, and very recent mixings of the two. The author also makes the point that any process algebra that can model state change has to deal with the issue of interference: this includes CCS, CSP, and many others. Chapter 9 builds on Chapter 8 to combine concurrency with OO, in the form of the COOL language. As already mentioned above, just describing the semantic objects suffices to define the","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":" ","pages":"1 - 2"},"PeriodicalIF":1.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47193248","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
Review on Theories of Programming: The Life and Works of Tony Hoare 程序设计理论述评:托尼·霍尔的生平与著作
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2022-12-01 DOI: 10.1145/3560267
Jonathan P. Bowen
Sir Tony Hoare FRS is one of the leading computer scientists in the world. This book celebrates Hoare’s life and work as the 1980 winner of the ACM A. M. Turing Award [3], widely considered to be the nearest equivalent to the Nobel Prize in computer science. The Association for Computing Machinery (ACM) has decided to produce a series of books on Turing Award winners and this book forms part of that series. Tony Hoare’s contributions to computer science have been celebrated in previous books. The 1994 book A Classical Mind [4], referring to Hoare’s educational background in classics (“Literae Humaniores” at Oxford University), was produced as a collection of contributions by colleagues in celebration of Hoare’s 60th birthday. This was part of the Prentice Hall International Series in Computer Science, a series founded by Hoare and then edited by him for many years. In 1999, a Symposium was held in Oxford to celebrate Tony Hoare’s official “retirement” from the Oxford University Computing Laboratory and the Programming Research Group (PRG) there, although he continued to work for many further years at Microsoft Research in Cambridge. Several other Turing Award winners contributed to the Symposium and its associated proceedings Millennial Perspectives in Computer Science [2]. In 2006, the Computer History Museum, based in California, USA, celebrated Tony Hoare’s life with an oral history interview held in Cambridge [1], later summarized in the Communications of the ACM [5]. The book under review continues the celebration of Tony Hoare’s life and work. As in the previous books mentioned above, the volume mainly consists of contributions by Hoare’s colleagues, but also includes selected contributions by Hoare himself. The appendices provide additional relevant material. The volume is divided into seven parts. Part I provided introductory material including Hoare’s 1980 Turing Award lecture, originally published in the Communications of the ACM, together with an overview of Hoare’s ideas by the book’s editors. Part II covers program verification, a major aspect of Hoare’s contribution to computer science. Part III includes two chapters in Communicating Sequential Processes (CSP), a seminal approach to modelling concurrency formally using a process algebra. Part IV covers Hoare’s approach to teaching and his links with industry. Although Hoare has been a major contributor to theory underlying computer science, he has always recognized the importance of linking this with practical application. Part V presents
托尼·霍尔爵士FRS是世界上领先的计算机科学家之一。这本书歌颂了霍尔作为1980年ACM A.M.图灵奖得主的生活和工作[3],图灵奖被广泛认为是最接近诺贝尔计算机科学奖的奖项。计算机协会(ACM)决定制作一系列关于图灵奖获奖者的书籍,这本书是该系列的一部分。托尼·霍尔对计算机科学的贡献在以前的书中得到了赞扬。1994年出版的《古典心灵》一书[4]提到了霍尔的古典教育背景(牛津大学的《人文文学》),是同事们为庆祝霍尔60岁生日而创作的一本作品集。这是Prentice Hall国际计算机科学系列的一部分,该系列由霍尔创建,然后由他编辑多年。1999年,牛津举行了一次研讨会,庆祝托尼·霍尔从牛津大学计算实验室和编程研究小组(PRG)正式“退休”,尽管他在剑桥的微软研究所继续工作了多年。其他几位图灵奖得主为研讨会及其相关论文集《计算机科学的千禧年展望》做出了贡献[2]。2006年,位于美国加利福尼亚州的计算机历史博物馆在剑桥举行了一次口述历史采访,以庆祝托尼·霍尔的一生[1],该采访后来在ACM通讯[5]中进行了总结。这本正在审查的书继续庆祝托尼·霍尔的生活和工作。与上述前几本书一样,该卷主要由霍尔同事的贡献组成,但也包括霍尔本人的精选贡献。附录提供了其他相关材料。这本书分为七个部分。第一部分提供了介绍性材料,包括霍尔1980年的图灵奖演讲,最初发表在ACM通讯上,以及该书编辑对霍尔思想的概述。第二部分介绍了程序验证,这是霍尔对计算机科学贡献的一个主要方面。第三部分包括通信顺序进程(CSP)的两章,这是一种使用进程代数形式化建模并发的开创性方法。第四部分介绍霍尔的教学方法以及他与工业界的联系。尽管霍尔是计算机科学理论的主要贡献者,但他始终认识到将其与实际应用联系起来的重要性。第五部分介绍
{"title":"Review on Theories of Programming: The Life and Works of Tony Hoare","authors":"Jonathan P. Bowen","doi":"10.1145/3560267","DOIUrl":"https://doi.org/10.1145/3560267","url":null,"abstract":"Sir Tony Hoare FRS is one of the leading computer scientists in the world. This book celebrates Hoare’s life and work as the 1980 winner of the ACM A. M. Turing Award [3], widely considered to be the nearest equivalent to the Nobel Prize in computer science. The Association for Computing Machinery (ACM) has decided to produce a series of books on Turing Award winners and this book forms part of that series. Tony Hoare’s contributions to computer science have been celebrated in previous books. The 1994 book A Classical Mind [4], referring to Hoare’s educational background in classics (“Literae Humaniores” at Oxford University), was produced as a collection of contributions by colleagues in celebration of Hoare’s 60th birthday. This was part of the Prentice Hall International Series in Computer Science, a series founded by Hoare and then edited by him for many years. In 1999, a Symposium was held in Oxford to celebrate Tony Hoare’s official “retirement” from the Oxford University Computing Laboratory and the Programming Research Group (PRG) there, although he continued to work for many further years at Microsoft Research in Cambridge. Several other Turing Award winners contributed to the Symposium and its associated proceedings Millennial Perspectives in Computer Science [2]. In 2006, the Computer History Museum, based in California, USA, celebrated Tony Hoare’s life with an oral history interview held in Cambridge [1], later summarized in the Communications of the ACM [5]. The book under review continues the celebration of Tony Hoare’s life and work. As in the previous books mentioned above, the volume mainly consists of contributions by Hoare’s colleagues, but also includes selected contributions by Hoare himself. The appendices provide additional relevant material. The volume is divided into seven parts. Part I provided introductory material including Hoare’s 1980 Turing Award lecture, originally published in the Communications of the ACM, together with an overview of Hoare’s ideas by the book’s editors. Part II covers program verification, a major aspect of Hoare’s contribution to computer science. Part III includes two chapters in Communicating Sequential Processes (CSP), a seminal approach to modelling concurrency formally using a process algebra. Part IV covers Hoare’s approach to teaching and his links with industry. Although Hoare has been a major contributor to theory underlying computer science, he has always recognized the importance of linking this with practical application. Part V presents","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"34 1","pages":"1 - 3"},"PeriodicalIF":1.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43037475","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
The Chemical Ecology of Benzoxazinoids. 苯并恶嗪类化合物的化学生态学。
IF 1.2 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2022-11-30 DOI: 10.2533/chimia.2022.928
Christelle Aurélie Maud Robert, Pierre Mateo

Benzoxazinoids are specialized metabolites that modulate plant physiology and plant interactions with their environment. In this review, we synthesize their multiple functions and ecological relevance. We first provide an overview of benzoxazinoid biosynthesis and highlight known regulatory elements involved in modulating their production. We then outline the role of benzoxazinoids in plant nutrition, vegetative and reproductive growth, and defense. We further summarize benzoxazinoid response to environmental factors such as temperature, drought, CO2, light, or nutrient levels and emphasize their potential role in tolerating abiotic stresses. Finally, we argue that benzoxazinoids act as a strong selective force on different trophic levels by shaping the plant interactions with microbes, insect herbivores, and competitor plants. Understanding the pivotal role of benzoxazinoids in plant biology is crucial to apprehend their impact on (agro)ecosystem functioning and diversity.

苯并恶嗪类化合物是调节植物生理和植物与环境相互作用的特殊代谢物。本文综述了它们的多种功能及其生态学意义。我们首先概述了苯并恶嗪类生物合成,并强调了参与调节其生产的已知调控元件。然后,我们概述了苯并恶嗪类化合物在植物营养、营养和生殖生长以及防御中的作用。我们进一步总结了苯并恶嗪类植物对温度、干旱、CO2、光照或营养水平等环境因素的响应,并强调了它们在耐受非生物胁迫中的潜在作用。最后,我们认为苯并恶嗪类药物通过塑造植物与微生物、昆虫、食草动物和竞争植物的相互作用,在不同的营养水平上起着强大的选择力。了解苯并恶嗪类化合物在植物生物学中的关键作用对于理解它们对(农业)生态系统功能和多样性的影响至关重要。
{"title":"The Chemical Ecology of Benzoxazinoids.","authors":"Christelle Aurélie Maud Robert, Pierre Mateo","doi":"10.2533/chimia.2022.928","DOIUrl":"10.2533/chimia.2022.928","url":null,"abstract":"<p><p>Benzoxazinoids are specialized metabolites that modulate plant physiology and plant interactions with their environment. In this review, we synthesize their multiple functions and ecological relevance. We first provide an overview of benzoxazinoid biosynthesis and highlight known regulatory elements involved in modulating their production. We then outline the role of benzoxazinoids in plant nutrition, vegetative and reproductive growth, and defense. We further summarize benzoxazinoid response to environmental factors such as temperature, drought, CO2, light, or nutrient levels and emphasize their potential role in tolerating abiotic stresses. Finally, we argue that benzoxazinoids act as a strong selective force on different trophic levels by shaping the plant interactions with microbes, insect herbivores, and competitor plants. Understanding the pivotal role of benzoxazinoids in plant biology is crucial to apprehend their impact on (agro)ecosystem functioning and diversity.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"21 1","pages":"928-938"},"PeriodicalIF":1.2,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73992148","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}
引用次数: 2
期刊
Formal Aspects of Computing
全部 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1