首页 > 最新文献

2012 Sixth International Symposium on Theoretical Aspects of Software Engineering最新文献

英文 中文
Strong Preservation by Model Deformation 模型变形的强保存
R. Giacobazzi, Isabella Mastroeni, Durica Nikolic
Reliable and secure system design requires an increasing number of methods, algorithms, and tools for automatic program manipulation. Any program change corresponds to a transformation that affects the semantics at some given level of abstraction. We call these techniques model deformations. In this paper we propose a mathematical foundation for completeness-driven deformations of transition systems w.r.t. a given abstraction, and we introduce an algorithm for systematic deformation of Kripke structures for inducing strong preservation in abstract model checking. We prove that our model deformations are deeply related with must and may transitions in modal transition systems.
可靠和安全的系统设计需要越来越多的方法、算法和自动程序操作的工具。任何程序更改都对应于在某个给定抽象级别上影响语义的转换。我们称这些技术为模型变形。本文提出了转换系统完备性驱动变形的数学基础,并在抽象模型检验中引入了Kripke结构系统变形的强保存算法。我们证明了模型变形与模态过渡系统中的必须和可能的过渡密切相关。
{"title":"Strong Preservation by Model Deformation","authors":"R. Giacobazzi, Isabella Mastroeni, Durica Nikolic","doi":"10.1109/TASE.2012.12","DOIUrl":"https://doi.org/10.1109/TASE.2012.12","url":null,"abstract":"Reliable and secure system design requires an increasing number of methods, algorithms, and tools for automatic program manipulation. Any program change corresponds to a transformation that affects the semantics at some given level of abstraction. We call these techniques model deformations. In this paper we propose a mathematical foundation for completeness-driven deformations of transition systems w.r.t. a given abstraction, and we introduce an algorithm for systematic deformation of Kripke structures for inducing strong preservation in abstract model checking. We prove that our model deformations are deeply related with must and may transitions in modal transition systems.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131137941","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}
引用次数: 0
Binary Code Level Verification for Interrupt Safety Properties of Real-Time Operating System 实时操作系统中断安全特性的二进制码级验证
Jianqi Shi, Longfei Zhu, Yanhong Huang, Jian Guo, Huibiao Zhu, Huixing Fang, Xin Ye
Interrupt mechanism is indispensable in embedded software due to lots of factors such as switching context and enhancing efficiency. In this context, the traditional way to ensure the correctness of software will not remain in force. Having the interrupt is envolved, the complicated and nondeterminism environment should be taken into consideration during the verification process. In this paper, we propose a novel way to verify the interrupt safety properties based on low-level binary code. At first, an Abstract xBIL is transformed from the xBIL with the time and interrupt properties reserved. xBIL [1] is a binary intermediate language we proposed to represent the machine instructions on multiple architectures. Afterwards, we present an automatic way to construct the Discrete-Time Markov Chains [2] from the Abstract xBIL code. After that, the properties can be easily generated and quantitative analysis could be performed. To prove the feasibility of our approach, we have applied our method to the verification of a commercial automotive operating system and it is proved to be of great help with the development of software.
中断机制在嵌入式软件中具有切换上下文、提高效率等多种作用。在这种情况下,确保软件正确性的传统方法将不再有效。在验证过程中,由于涉及到中断,需要考虑复杂的不确定性环境。本文提出了一种基于低级二进制码的中断安全特性验证方法。首先,从保留时间和中断属性的xBIL转换为抽象xBIL。xBIL[1]是我们提出的一种二进制中间语言,用于表示多种体系结构上的机器指令。然后,我们提出了一种基于Abstract xBIL代码的离散时间马尔可夫链[2]的自动构造方法。之后,可以很容易地生成属性并进行定量分析。为了证明该方法的可行性,我们将该方法应用于某商用汽车操作系统的验证,结果表明该方法对软件的开发有很大的帮助。
{"title":"Binary Code Level Verification for Interrupt Safety Properties of Real-Time Operating System","authors":"Jianqi Shi, Longfei Zhu, Yanhong Huang, Jian Guo, Huibiao Zhu, Huixing Fang, Xin Ye","doi":"10.1109/TASE.2012.46","DOIUrl":"https://doi.org/10.1109/TASE.2012.46","url":null,"abstract":"Interrupt mechanism is indispensable in embedded software due to lots of factors such as switching context and enhancing efficiency. In this context, the traditional way to ensure the correctness of software will not remain in force. Having the interrupt is envolved, the complicated and nondeterminism environment should be taken into consideration during the verification process. In this paper, we propose a novel way to verify the interrupt safety properties based on low-level binary code. At first, an Abstract xBIL is transformed from the xBIL with the time and interrupt properties reserved. xBIL [1] is a binary intermediate language we proposed to represent the machine instructions on multiple architectures. Afterwards, we present an automatic way to construct the Discrete-Time Markov Chains [2] from the Abstract xBIL code. After that, the properties can be easily generated and quantitative analysis could be performed. To prove the feasibility of our approach, we have applied our method to the verification of a commercial automotive operating system and it is proved to be of great help with the development of software.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126518652","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}
引用次数: 2
Regression Test Cases Generation Based on Automatic Model Revision 基于自动模型修正的回归测试用例生成
Nan Ye, Xin Chen, Wenxu Ding, P. Jiang, Lei Bu, Xuandong Li
Regression testing is a widely used way to assure the quality of modified software. It requires executing a suite of test cases to ensure that modifications do not introduce any negative impact to software behavior. To collect test cases in the suite that can reveal modifications, different versions of software must be compared carefully. Existing approaches, relying on manual examination on programs or models to identify differences, are expensive. In the paper, we present a fully automatic approach to generating regression test cases based on activity diagram revision. By collecting execution traces and revising old activity diagrams, the approach firstly constructs new activity diagrams that can reveal software behavior changes. Then, both affected paths and new paths in activity diagrams are identified. Finally, an execution-based approach is applied to generate regression test cases whose execution can cover these paths. Experiments show the effectiveness of our approach.
回归测试是一种广泛使用的方法来保证修改软件的质量。它需要执行一套测试用例,以确保修改不会对软件行为带来任何负面影响。为了在套件中收集可以显示修改的测试用例,必须仔细比较不同版本的软件。现有的方法依赖于人工检查程序或模型来识别差异,这是昂贵的。在本文中,我们提出了一种基于活动图修订的全自动方法来生成回归测试用例。该方法通过收集执行轨迹和修改旧的活动图,首先构建新的活动图,揭示软件的行为变化。然后,确定活动图中受影响的路径和新路径。最后,应用基于执行的方法来生成回归测试用例,其执行可以覆盖这些路径。实验证明了该方法的有效性。
{"title":"Regression Test Cases Generation Based on Automatic Model Revision","authors":"Nan Ye, Xin Chen, Wenxu Ding, P. Jiang, Lei Bu, Xuandong Li","doi":"10.1109/TASE.2012.31","DOIUrl":"https://doi.org/10.1109/TASE.2012.31","url":null,"abstract":"Regression testing is a widely used way to assure the quality of modified software. It requires executing a suite of test cases to ensure that modifications do not introduce any negative impact to software behavior. To collect test cases in the suite that can reveal modifications, different versions of software must be compared carefully. Existing approaches, relying on manual examination on programs or models to identify differences, are expensive. In the paper, we present a fully automatic approach to generating regression test cases based on activity diagram revision. By collecting execution traces and revising old activity diagrams, the approach firstly constructs new activity diagrams that can reveal software behavior changes. Then, both affected paths and new paths in activity diagrams are identified. Finally, an execution-based approach is applied to generate regression test cases whose execution can cover these paths. Experiments show the effectiveness of our approach.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128991029","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}
引用次数: 9
A Path-oriented Approach to Generating Executable Test Sequences for Extended Finite State Machines 面向路径的扩展有限状态机可执行测试序列生成方法
Tianyong Wu, Jun Yan, Jian Zhang
The Extended Finite State Machine (EFSM) is a commonly used model for specifying software systems. A test sequence for an EFSM is a sequence composed of values of input variables, which can make the EFSM “execute” along a complete path from entry to exit. Traditional test sequence generation methods for EFSM almost imitate those FSM-based approaches and focus on states identification. Most of them impose significant restrictions on the EFSM. This paper proposes a path-oriented approach to generating test cases for EFSM and presents a tool for test data generation. The experiments show that our tool can generate executable test sequences for EFSM models of software systems automatically in acceptable time.
扩展有限状态机(EFSM)是一种常用的用于指定软件系统的模型。EFSM的测试序列是由输入变量的值组成的序列,它可以使EFSM沿着从入口到出口的完整路径“执行”。传统的EFSM测试序列生成方法几乎是模仿基于fsm的方法,并且侧重于状态识别。它们中的大多数对EFSM施加了重大限制。本文提出了一种面向路径的EFSM测试用例生成方法,并给出了一个测试数据生成工具。实验表明,该工具能够在可接受的时间内自动生成软件系统EFSM模型的可执行测试序列。
{"title":"A Path-oriented Approach to Generating Executable Test Sequences for Extended Finite State Machines","authors":"Tianyong Wu, Jun Yan, Jian Zhang","doi":"10.1109/TASE.2012.38","DOIUrl":"https://doi.org/10.1109/TASE.2012.38","url":null,"abstract":"The Extended Finite State Machine (EFSM) is a commonly used model for specifying software systems. A test sequence for an EFSM is a sequence composed of values of input variables, which can make the EFSM “execute” along a complete path from entry to exit. Traditional test sequence generation methods for EFSM almost imitate those FSM-based approaches and focus on states identification. Most of them impose significant restrictions on the EFSM. This paper proposes a path-oriented approach to generating test cases for EFSM and presents a tool for test data generation. The experiments show that our tool can generate executable test sequences for EFSM models of software systems automatically in acceptable time.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132197409","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}
引用次数: 8
A Native Approach to Modeling Timed Behavior in the Pi-Calculus pi -微积分中时间行为建模的原生方法
Kamal Barakat, S. Kowalewski, T. Noll
We introduce a new concept of modeling timed behavior in pi-calculus by representing timed actions (or timers) as interactions between application processes and clock processes. This approach extends the original calculus in a manner such that bisimulation arrangements in pi-calculus remain untouched. We also present a tool to simulate specifications written in our timed version of pi-calculus in order to verify their behavior.
我们通过将定时动作(或计时器)表示为应用程序进程和时钟进程之间的交互,在pi-calculus中引入了对定时行为建模的新概念。这种方法以一种方式扩展了原始演算,使得pi演算中的双模拟安排保持不变。我们还提供了一个工具来模拟在我们的pi-calculus的定时版本中编写的规范,以验证它们的行为。
{"title":"A Native Approach to Modeling Timed Behavior in the Pi-Calculus","authors":"Kamal Barakat, S. Kowalewski, T. Noll","doi":"10.1109/TASE.2012.27","DOIUrl":"https://doi.org/10.1109/TASE.2012.27","url":null,"abstract":"We introduce a new concept of modeling timed behavior in pi-calculus by representing timed actions (or timers) as interactions between application processes and clock processes. This approach extends the original calculus in a manner such that bisimulation arrangements in pi-calculus remain untouched. We also present a tool to simulate specifications written in our timed version of pi-calculus in order to verify their behavior.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126186523","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
Modeling and Validation of PLC-Controlled Systems: A Case Study plc控制系统的建模与验证:一个案例研究
R. Wang, Min Zhou, Liangze Yin, Lianyi Zhang, Jiaguang Sun, M. Gu, M. Bozga
Programable logic controllers (PLCs) are complex cyber-physical systems which are widely used in industry. This paper shows the modeling and validation work of a typical PLC control system using the Behavior-Interaction-Priority(BIP) component framework. The gate control system based on PLC is a real industry application. We design general system architecture for this kind of device control system. The control software and hardware of environment are all modeled as BIP components. Their interactions are described by BIP connectors. System requirements are formalized as monitors. Simulation is applied on the system model. We found a couple of design errors in simulation, which help us to improve the dependability of the original systems.
可编程控制器(plc)是一种复杂的网络物理系统,在工业中得到了广泛的应用。本文展示了使用行为-交互-优先级(BIP)组件框架对典型PLC控制系统的建模和验证工作。基于PLC的闸门控制系统是一个真正的工业应用。针对这类设备控制系统,设计了总体系统架构。环境的控制软、硬件均建模为BIP组件。它们的相互作用由BIP连接器描述。系统需求被形式化为监视器。对系统模型进行了仿真。我们在仿真中发现了几个设计错误,这有助于我们提高原系统的可靠性。
{"title":"Modeling and Validation of PLC-Controlled Systems: A Case Study","authors":"R. Wang, Min Zhou, Liangze Yin, Lianyi Zhang, Jiaguang Sun, M. Gu, M. Bozga","doi":"10.1109/TASE.2012.33","DOIUrl":"https://doi.org/10.1109/TASE.2012.33","url":null,"abstract":"Programable logic controllers (PLCs) are complex cyber-physical systems which are widely used in industry. This paper shows the modeling and validation work of a typical PLC control system using the Behavior-Interaction-Priority(BIP) component framework. The gate control system based on PLC is a real industry application. We design general system architecture for this kind of device control system. The control software and hardware of environment are all modeled as BIP components. Their interactions are described by BIP connectors. System requirements are formalized as monitors. Simulation is applied on the system model. We found a couple of design errors in simulation, which help us to improve the dependability of the original systems.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126870221","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}
引用次数: 9
The Observer Pattern Applied to Actor Systems: A TLA/TLC-based Implementation Analysis 应用于参与者系统的观察者模式:基于TLA/ tlc的实现分析
Rodger Burmeister, Steffen Helke
With the increasing impact of the actor-model in programming languages, there is also an increased demand for approved solutions for recurring implementation problems. Transferring established design pattern solutions from sequential contexts to concurrent ones requires a rigorous clarification of intentional requirements and concurrency issues. Existing approaches either do not verify concurrent pattern implementations rigorously or do not address the actor model. To solve these insufficiencies we (1) specify intentional requirements using LTL-expressions and an abstract outline, and (2) transfer and verify these for a concrete, actor-based TLA description using model checking techniques. The applicability of our approach is demonstrated for a concurrent version of the well known Observer Pattern. Our work enables software engineers to build up formal requirement catalogs for sequential and concurrent design pattern implementations and to rigorously verify them at a low effort.
随着角色模型在编程语言中的影响越来越大,对反复出现的实现问题的批准解决方案的需求也在增加。将已建立的设计模式解决方案从顺序上下文转移到并发上下文,需要严格澄清有意的需求和并发性问题。现有的方法要么不严格地验证并发模式实现,要么不处理参与者模型。为了解决这些不足,我们(1)使用ltl表达式和抽象大纲指定有意的需求,(2)使用模型检查技术将这些需求转换并验证为具体的、基于角色的TLA描述。我们的方法的适用性在著名的观察者模式的并发版本中得到了证明。我们的工作使软件工程师能够为顺序的和并发的设计模式实现建立正式的需求目录,并以较低的工作量严格地验证它们。
{"title":"The Observer Pattern Applied to Actor Systems: A TLA/TLC-based Implementation Analysis","authors":"Rodger Burmeister, Steffen Helke","doi":"10.1109/TASE.2012.15","DOIUrl":"https://doi.org/10.1109/TASE.2012.15","url":null,"abstract":"With the increasing impact of the actor-model in programming languages, there is also an increased demand for approved solutions for recurring implementation problems. Transferring established design pattern solutions from sequential contexts to concurrent ones requires a rigorous clarification of intentional requirements and concurrency issues. Existing approaches either do not verify concurrent pattern implementations rigorously or do not address the actor model. To solve these insufficiencies we (1) specify intentional requirements using LTL-expressions and an abstract outline, and (2) transfer and verify these for a concrete, actor-based TLA description using model checking techniques. The applicability of our approach is demonstrated for a concurrent version of the well known Observer Pattern. Our work enables software engineers to build up formal requirement catalogs for sequential and concurrent design pattern implementations and to rigorously verify them at a low effort.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"356 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115892014","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}
引用次数: 2
A Type System for SPARDL SPARDL的类型系统
Zheng Wang, G. Pu, Jianwen Li, B. Gu
SPARDL is a domain-specific modeling language for periodic control systems, which are widely used in embedded systems. Periodic control systems are usually driven by the given period. A periodic control system can be decomposed into different modes or sub-modes, and each mode represents a system state observed from outside. We believe that introducing static checking will extend the power of SPARDL. In this paper, we develop a type system for SPARDL. To make the contributions of this paper convincible and easy to understand, we apply the traditional approaches to construct the type system for SPARDL. An operational semantics is proposed as the basic explanation of SPARDL. And then some type safety theorems are proved under such semantics. We apply the type system to an industrial case from China Academy of Space Technology(CAST) to evaluate the effectiveness of our approach in practice, and then eight type errors are revealed.
SPARDL是一种针对周期控制系统的领域特定建模语言,广泛应用于嵌入式系统。周期控制系统通常由给定的周期驱动。周期控制系统可以分解为不同的模态或子模态,每个模态代表从外部观察到的系统状态。我们相信,引入静态检查将扩展SPARDL的功能。在本文中,我们开发了一个SPARDL类型系统。为了使本文的成果具有说服力和易于理解性,我们采用传统的方法来构建SPARDL的类型系统。提出了一种操作语义作为SPARDL的基本解释。然后在这种语义下证明了一些类型安全定理。以中国空间技术研究院的一个工业案例为例,对该方法在实际应用中的有效性进行了评价,发现了8种类型误差。
{"title":"A Type System for SPARDL","authors":"Zheng Wang, G. Pu, Jianwen Li, B. Gu","doi":"10.1109/TASE.2012.47","DOIUrl":"https://doi.org/10.1109/TASE.2012.47","url":null,"abstract":"SPARDL is a domain-specific modeling language for periodic control systems, which are widely used in embedded systems. Periodic control systems are usually driven by the given period. A periodic control system can be decomposed into different modes or sub-modes, and each mode represents a system state observed from outside. We believe that introducing static checking will extend the power of SPARDL. In this paper, we develop a type system for SPARDL. To make the contributions of this paper convincible and easy to understand, we apply the traditional approaches to construct the type system for SPARDL. An operational semantics is proposed as the basic explanation of SPARDL. And then some type safety theorems are proved under such semantics. We apply the type system to an industrial case from China Academy of Space Technology(CAST) to evaluate the effectiveness of our approach in practice, and then eight type errors are revealed.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129545795","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}
引用次数: 0
A Calculus of Higher Order Safe Ambients and Its Bisimulations 高阶安全环境的微积分及其双模拟
Zining Cao
In this paper, we present a higher order ambient calculus HSAP, which is a higher order extension of SAP calculus. In HSAP, we extend higher order communication capability and administrator interaction capability. Higher order communication capability means that an ambients can be send to another ambients. Administrator interaction capability means that an ambients can interact with any ambients if the password is matched. Then, we give a LTS based operational semantics for HSAP and two labelled bisimulations, called early bisimulation and late bisimulation. Early bisimulation is proved to coincide with reduction barbed congruence. Furthermore, we present late bisimulation, quasi late bisimulation, concise quasi late bisimulation and quasi normal bisimulation for HSAP and study the relation between these bisimulations. Finally, we study the expressiveness of HSAP.
本文提出了一种高阶环境微积分HSAP,它是SAP微积分的高阶推广。在HSAP中,我们扩展了高阶通信能力和管理员交互能力。高阶通信能力意味着一个环境可以被发送到另一个环境。管理员交互能力是指如果密码匹配,一个环境可以与任何环境进行交互。然后,我们给出了基于LTS的HSAP操作语义和两种标记的双仿真,称为早期双仿真和晚期双仿真。证明了早期双模拟符合约简倒钩同余。在此基础上,提出了HSAP的晚期双模拟、准晚期双模拟、简明的准晚期双模拟和准正态双模拟,并研究了这些模拟之间的关系。最后,我们研究了HSAP的表达性。
{"title":"A Calculus of Higher Order Safe Ambients and Its Bisimulations","authors":"Zining Cao","doi":"10.1109/TASE.2012.8","DOIUrl":"https://doi.org/10.1109/TASE.2012.8","url":null,"abstract":"In this paper, we present a higher order ambient calculus HSAP, which is a higher order extension of SAP calculus. In HSAP, we extend higher order communication capability and administrator interaction capability. Higher order communication capability means that an ambients can be send to another ambients. Administrator interaction capability means that an ambients can interact with any ambients if the password is matched. Then, we give a LTS based operational semantics for HSAP and two labelled bisimulations, called early bisimulation and late bisimulation. Early bisimulation is proved to coincide with reduction barbed congruence. Furthermore, we present late bisimulation, quasi late bisimulation, concise quasi late bisimulation and quasi normal bisimulation for HSAP and study the relation between these bisimulations. Finally, we study the expressiveness of HSAP.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125882875","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}
引用次数: 2
Formal Specification of Hybrid MARTE Statecharts 混合MARTE状态表的正式规范
Ziwei Liu, Jing Liu, Jifeng He, F. Mallet, Miaomiao Zhang
The specification of Modeling and Analysis of Real-time and Embedded Systems (MARTE) is an extension of UML in the domain of real-time and embedded Systems. However, unified modeling of continuous and discrete variables in MARTE is still an unsolved problem for hybrid real-time system development. In this paper we propose an extended statechart, Hybrid MARTE statechart, for modeling and analyzing of hybrid real-time and embedded systems. In Hybrid MARTE Statecharts, we unify the logical time and the chronometric time variables. The improvement of MARTE statechart is based on hybrid automata. Formal syntax and semantics of Hybrid MARTE statecharts are given based on labeled transition systems. At the end of this paper, a case study is given to show how to model the behavior of a Train Control System with Hybrid MARTE statecharts.
实时和嵌入式系统建模与分析规范(MARTE)是UML在实时和嵌入式系统领域的扩展。然而,在混合实时系统开发中,连续变量和离散变量的统一建模仍然是一个未解决的问题。在本文中,我们提出了一个扩展的状态图,混合MARTE状态图,用于建模和分析混合实时和嵌入式系统。在混合MARTE状态图中,我们统一了逻辑时间和时间变量。MARTE状态图的改进是基于混合自动机的。给出了基于标记转换系统的混合MARTE状态图的形式化语法和语义。最后,给出了一个用混合MARTE状态图对列车控制系统进行行为建模的实例。
{"title":"Formal Specification of Hybrid MARTE Statecharts","authors":"Ziwei Liu, Jing Liu, Jifeng He, F. Mallet, Miaomiao Zhang","doi":"10.1109/TASE.2012.26","DOIUrl":"https://doi.org/10.1109/TASE.2012.26","url":null,"abstract":"The specification of Modeling and Analysis of Real-time and Embedded Systems (MARTE) is an extension of UML in the domain of real-time and embedded Systems. However, unified modeling of continuous and discrete variables in MARTE is still an unsolved problem for hybrid real-time system development. In this paper we propose an extended statechart, Hybrid MARTE statechart, for modeling and analyzing of hybrid real-time and embedded systems. In Hybrid MARTE Statecharts, we unify the logical time and the chronometric time variables. The improvement of MARTE statechart is based on hybrid automata. Formal syntax and semantics of Hybrid MARTE statecharts are given based on labeled transition systems. At the end of this paper, a case study is given to show how to model the behavior of a Train Control System with Hybrid MARTE statecharts.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128916516","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
期刊
2012 Sixth International Symposium on Theoretical Aspects of Software Engineering
全部 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