Along with the green attentions and efforts on energy efficiency of computer hardware and embedded systems, software relevant sustainability issues are becoming increasingly focused, as a part of Green Information Technology (GIT). Undoubtedly, software evolution capability is a vital part in achieving such sustainability, as software that is not adaptable will become obsolete sooner or later. Internetware is currently one of the prevailing paradigms of software evolution, known as its autonomous, cooperative, situational, evolvable, emergent and trustworthy. In this paper, we propose an approach of evolution focusing on sustainability for Internetware software entities. Targeting certain software systems which cannot actively control their functions, service components or attached actuators energy-efficiently, the proposed transformation mechanism can intelligently implement power management adaptations using Web Ontology Language (OWL) -based user behavioral profiles and reasoning mechanisms. In the effort of increasing the sustainability, the transformation consequently enables a greener, predicted and rapidly adapted evolution.
{"title":"Evolution for the sustainability of internetware","authors":"Daren Fang, Xiaodong Liu, Hongji Yang, Lin Liu","doi":"10.1145/2430475.2430492","DOIUrl":"https://doi.org/10.1145/2430475.2430492","url":null,"abstract":"Along with the green attentions and efforts on energy efficiency of computer hardware and embedded systems, software relevant sustainability issues are becoming increasingly focused, as a part of Green Information Technology (GIT). Undoubtedly, software evolution capability is a vital part in achieving such sustainability, as software that is not adaptable will become obsolete sooner or later. Internetware is currently one of the prevailing paradigms of software evolution, known as its autonomous, cooperative, situational, evolvable, emergent and trustworthy. In this paper, we propose an approach of evolution focusing on sustainability for Internetware software entities. Targeting certain software systems which cannot actively control their functions, service components or attached actuators energy-efficiently, the proposed transformation mechanism can intelligently implement power management adaptations using Web Ontology Language (OWL) -based user behavioral profiles and reasoning mechanisms. In the effort of increasing the sustainability, the transformation consequently enables a greener, predicted and rapidly adapted evolution.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"47 1","pages":"17:1-17:9"},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80038385","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}
In order to take advantage the Internetware paradigm, software architecture is important research subject. Software architecture is the core of software systems and acts as a guideline for many development activities. Currently, not many approaches support the self-adaptability of architecture in Internetware. In this paper, an approach to evolving the software architecture in Internetware is presented, consisting of (1) representing source architecture via graph description and discussing the impact of qualities and functions on architecture, (2) transforming it into the new style via transformation techniques through the verified rules, (3) regenerating the code of the target architecture through the FermaT workbench, and (4) proposing a runtime supporting evolution environment for Internetware based systems.
{"title":"An approach to supporting architecture evolution in Internetware","authors":"S. Zheng, Hongji Yang","doi":"10.1145/2430475.2430479","DOIUrl":"https://doi.org/10.1145/2430475.2430479","url":null,"abstract":"In order to take advantage the Internetware paradigm, software architecture is important research subject. Software architecture is the core of software systems and acts as a guideline for many development activities. Currently, not many approaches support the self-adaptability of architecture in Internetware. In this paper, an approach to evolving the software architecture in Internetware is presented, consisting of (1) representing source architecture via graph description and discussing the impact of qualities and functions on architecture, (2) transforming it into the new style via transformation techniques through the verified rules, (3) regenerating the code of the target architecture through the FermaT workbench, and (4) proposing a runtime supporting evolution environment for Internetware based systems.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"49 1","pages":"4:1-4:9"},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82531843","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}
Virtualization is a very popular support environment for Internetware deployment. However, the virtual machine can access the hardware only by virtue of virtual machine monitor which can result in a big overhead, especially for I/O sensitive virtual machine. In order to reduce this kind of overhead, this paper gives a research on I/O virtualization and proposes a cache mechanism. In benefit of the cache mechanism build in virtual machine monitor, the data package switching operations would drop dramatically and the overhead is lowered too. It is proved that our method is efficient and effective in decreasing the Internetware I/O overhead in virtualization environment through the experiment.
{"title":"An I/O optimizing approach for virtualization-based Internetwares","authors":"Jiwei Xu, Wen-bo Zhang, Heng Wu, Jianhua Zhang","doi":"10.1145/2430475.2430491","DOIUrl":"https://doi.org/10.1145/2430475.2430491","url":null,"abstract":"Virtualization is a very popular support environment for Internetware deployment. However, the virtual machine can access the hardware only by virtue of virtual machine monitor which can result in a big overhead, especially for I/O sensitive virtual machine. In order to reduce this kind of overhead, this paper gives a research on I/O virtualization and proposes a cache mechanism. In benefit of the cache mechanism build in virtual machine monitor, the data package switching operations would drop dramatically and the overhead is lowered too. It is proved that our method is efficient and effective in decreasing the Internetware I/O overhead in virtualization environment through the experiment.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"112 1","pages":"16:1-16:6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76040184","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}
Vehicular Ad Hoc Networks (VANETs) enable car-to-car communication without the support of network infrastructure, which introduce diverse application possibilities and have drawn much attention from academy and industry in the past years. Unlike other ad hoc networks, nodes in VANETs are restricted to move in streets and have limited communication ranges. Intuitively, vehicle-to-vehicle communication somehow has similarity to human-to-human interaction, which lead to an interesting question of exploring the social properties of VANET nodes. To address the question, we consider encounters of vehicles as their social relationships and model VANETs as social graphs. Based on the social graph model, we use two traces of mobile vehicles from San Francisco and Shanghai to explore their social properties. Our analysis show that several universal laws of social network are hold for VANETs. The social graphs forming by vehicles are scale-free networks with power-law like distribution of node degrees. Small world phenomenon is also observed in our experiments: the nodes in VANETs have high cluster coefficient and there exist short paths between node pairs less than 3 hops on average. The implication of our analytical results is of benefit to develop large scale software system for mobile applications such as VANETs, as well as helps to facilitate inter-device wireless communications in pervasive environment.
车辆自组织网络(Vehicular Ad Hoc Networks, vanet)实现了无需网络基础设施支持的车对车通信，引入了多种应用可能性，近年来受到学术界和工业界的广泛关注。与其他自组织网络不同，vanet中的节点被限制在街道上移动，并且通信范围有限。直观地说，车与车之间的通信在某种程度上与人与人之间的交互相似，这就引出了一个有趣的问题，即探索VANET节点的社会属性。为了解决这个问题，我们将车辆的相遇视为它们的社会关系，并将模型vanet视为社会图。在社交图谱模型的基础上，我们利用旧金山和上海两个城市的移动车辆轨迹来探索其社交属性。我们的分析表明，社交网络的几个普遍规律适用于VANETs。由车辆形成的社会图谱是节点度呈幂律分布的无标度网络。我们的实验还观察到小世界现象:VANETs中的节点具有较高的聚类系数，节点对之间存在平均小于3跳的短路径。我们的分析结果对开发大规模的移动应用软件系统，如VANETs，以及在普适环境中促进设备间无线通信具有借鉴意义。
{"title":"Exploring social properties in vehicular ad hoc networks","authors":"Xin Liu, Zhuo Li, Wenzhong Li, Sanglu Lu, Xiaoliang Wang, Daoxu Chen","doi":"10.1145/2430475.2430499","DOIUrl":"https://doi.org/10.1145/2430475.2430499","url":null,"abstract":"Vehicular Ad Hoc Networks (VANETs) enable car-to-car communication without the support of network infrastructure, which introduce diverse application possibilities and have drawn much attention from academy and industry in the past years. Unlike other ad hoc networks, nodes in VANETs are restricted to move in streets and have limited communication ranges. Intuitively, vehicle-to-vehicle communication somehow has similarity to human-to-human interaction, which lead to an interesting question of exploring the social properties of VANET nodes. To address the question, we consider encounters of vehicles as their social relationships and model VANETs as social graphs. Based on the social graph model, we use two traces of mobile vehicles from San Francisco and Shanghai to explore their social properties. Our analysis show that several universal laws of social network are hold for VANETs. The social graphs forming by vehicles are scale-free networks with power-law like distribution of node degrees. Small world phenomenon is also observed in our experiments: the nodes in VANETs have high cluster coefficient and there exist short paths between node pairs less than 3 hops on average. The implication of our analytical results is of benefit to develop large scale software system for mobile applications such as VANETs, as well as helps to facilitate inter-device wireless communications in pervasive environment.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"100 1","pages":"24:1-24:7"},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81058403","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}
Although the market for smartphones is growing rapidly, their utility remains severely limited by the battery life. As such, much research effort has been made to understand the power consumption of the application running on mobile devices. However, dynamic profiling tools need to run on the customized android platform, making them not suitable for ordinary mobile app developers. To address this limitation, this paper proposed a light-weight approach to find possible I/O energy wasting code in Android apps through static program analysis technique. We also provide a case study to evaluate the effectiveness of our approach.
{"title":"Detect and optimize the energy consumption of mobile app through static analysis: an initial research","authors":"Jingtian Wang, Guoquan Wu, Xiaoquan Wu, Jun Wei","doi":"10.1145/2430475.2430497","DOIUrl":"https://doi.org/10.1145/2430475.2430497","url":null,"abstract":"Although the market for smartphones is growing rapidly, their utility remains severely limited by the battery life. As such, much research effort has been made to understand the power consumption of the application running on mobile devices. However, dynamic profiling tools need to run on the customized android platform, making them not suitable for ordinary mobile app developers. To address this limitation, this paper proposed a light-weight approach to find possible I/O energy wasting code in Android apps through static program analysis technique. We also provide a case study to evaluate the effectiveness of our approach.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"15 1","pages":"22:1-22:5"},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78502135","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}
Precisely describing complicate interaction process is still an open problem in MARTE(Modeling and Analysis of Realtime Embedded System). In this paper, we propose an approach to modeling interaction behaviors to enhance MARTE modeling ability. MARTE is published by OMG(Object Management Group) in Aug, 2010 as a standard modeling language for modeling real time and embedded system. Our approach is based on timed CSP(Communicating Sequential Processes). To describe the multiform time structure in MARTE, we make an extension to timed CSP. The syntax and semantics of the communicating process specification are given and also the laws, the trace model and the failures model are defined. One of the main advantages of our method is to help people to modeling the complicate interaction process with process algebra, thus to simplify the modeling and verification of the interaction and concurrent behaviors in real-time and embedded systems between different processes. The approach is applied to model and analyze a Train Over Speed Protection System for Shanghai Bell Company.
{"title":"An approach to communicating process modeling of MARTE","authors":"Zhike Wu, Jing Liu, Xiaohong Chen, Mingsong Chen","doi":"10.1145/2430475.2430481","DOIUrl":"https://doi.org/10.1145/2430475.2430481","url":null,"abstract":"Precisely describing complicate interaction process is still an open problem in MARTE(Modeling and Analysis of Realtime Embedded System). In this paper, we propose an approach to modeling interaction behaviors to enhance MARTE modeling ability. MARTE is published by OMG(Object Management Group) in Aug, 2010 as a standard modeling language for modeling real time and embedded system. Our approach is based on timed CSP(Communicating Sequential Processes). To describe the multiform time structure in MARTE, we make an extension to timed CSP. The syntax and semantics of the communicating process specification are given and also the laws, the trace model and the failures model are defined. One of the main advantages of our method is to help people to modeling the complicate interaction process with process algebra, thus to simplify the modeling and verification of the interaction and concurrent behaviors in real-time and embedded systems between different processes. The approach is applied to model and analyze a Train Over Speed Protection System for Shanghai Bell Company.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"2002 20","pages":"6:1-6:9"},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91429520","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}
With the on-demand service provision ability and elastic nature, cloud computing provides a suitable development and running environment for internetware, to support its cooperation and evolvement. Among the three service models of cloud computing, Platform-as-a-Service (PaaS) provides internetware application developers with sufficient and convenient computing resources to develop and run their applications. As with other cloud computing models, monitoring is the basis of on-demand service provision and elastic scalability in PaaS. Apart from this, monitoring is also a required service that should be provided to PaaS consumers. However, due to the diversity and heterogeneity of the objects to be monitored in PaaS, monitoring is not easy to implement. Additionally, it is difficult to perform manual or automatic administration on PaaS based on raw monitoring data in the form of metric data set. In this paper, we propose a model-driven monitoring approach for PaaS. By transforming low-level monitoring data to high-level monitoring model based on meta-model definitions and transforming rules, this approach not only simplifies the implementation of PaaS monitoring system, but also presents a high-level abstraction of the whole PaaS, which reduces the difficulty of PaaS management. We built a graphic modeling tool to assist the definition of the meta-model and transforming rules, and applied this approach in the implementation of a PaaS monitoring system in practice.
{"title":"A model-driven monitoring approach for Internetware on platform-as-a-service (PaaS)","authors":"Jin Shao, Qianxiang Wang","doi":"10.1145/2430475.2430489","DOIUrl":"https://doi.org/10.1145/2430475.2430489","url":null,"abstract":"With the on-demand service provision ability and elastic nature, cloud computing provides a suitable development and running environment for internetware, to support its cooperation and evolvement. Among the three service models of cloud computing, Platform-as-a-Service (PaaS) provides internetware application developers with sufficient and convenient computing resources to develop and run their applications. As with other cloud computing models, monitoring is the basis of on-demand service provision and elastic scalability in PaaS. Apart from this, monitoring is also a required service that should be provided to PaaS consumers. However, due to the diversity and heterogeneity of the objects to be monitored in PaaS, monitoring is not easy to implement. Additionally, it is difficult to perform manual or automatic administration on PaaS based on raw monitoring data in the form of metric data set. In this paper, we propose a model-driven monitoring approach for PaaS. By transforming low-level monitoring data to high-level monitoring model based on meta-model definitions and transforming rules, this approach not only simplifies the implementation of PaaS monitoring system, but also presents a high-level abstraction of the whole PaaS, which reduces the difficulty of PaaS management. We built a graphic modeling tool to assist the definition of the meta-model and transforming rules, and applied this approach in the implementation of a PaaS monitoring system in practice.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"2 1","pages":"14:1-14:8"},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82653412","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}
State Machine Diagram (SMD) is one of the SysML behavior diagrams, but it is a kind of semi-formal model language. As a consequence, models can not be verified conveniently and efficiently, especially in real-time embedded system (RTES) field as there are no descriptions of time and probability in SMD. To address these problems, we extend SMD with time and probability elements extracted from MARTE and propose a transformation algorithm based on MDE. With the algorithm, we transform the extended SMD to timed automata (TA) and then analyze and verify the transformation result using existing tools. So at the very beginning of system design, errors and deficiencies can be found. At last, we construct an instance to illustrate the validity of our approach.
{"title":"An MDE-based approach to the verification of SysML state machine diagram","authors":"Xiaopu Huang, Qingqing Sun, Jiangwei Li, Minxue Pan, Tian Zhang","doi":"10.1145/2430475.2430484","DOIUrl":"https://doi.org/10.1145/2430475.2430484","url":null,"abstract":"State Machine Diagram (SMD) is one of the SysML behavior diagrams, but it is a kind of semi-formal model language. As a consequence, models can not be verified conveniently and efficiently, especially in real-time embedded system (RTES) field as there are no descriptions of time and probability in SMD. To address these problems, we extend SMD with time and probability elements extracted from MARTE and propose a transformation algorithm based on MDE. With the algorithm, we transform the extended SMD to timed automata (TA) and then analyze and verify the transformation result using existing tools. So at the very beginning of system design, errors and deficiencies can be found. At last, we construct an instance to illustrate the validity of our approach.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"305 1","pages":"9:1-9:7"},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73173806","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}
Shuping Ji, Wei Wang, Chunyang Ye, Jun Wei, Zhaohui Liu
In-memory data grid (IMDG) is a novel data processing middleware for Internetware. It provides higher scalability and performance compared with traditional rational database. However, because the data stored in IMDG must follow the key/value data model, new challenges have been proposed. One important aspect is that IMDG does not support standard data accessing languages such as JPA and SQL, and application developers must design their programs according to the peculiarities of an IMDG product. This results in complex and error-prone code, especially for the programmers who have no deep understanding of IMDG. In this paper, we propose a data accessing reference architecture for IMDG and a methodology to design and implement its data accessing layer. In this methodology, data accessing engine construction, data model designation and join operation supporting are presented. Moreover, following this methodology, we develop and implement a JPA compatible data accessing engine for Hazelcast as a case study, which proves the feasibility of our approach.
{"title":"Constructing a data accessing layer for in-memory data grid","authors":"Shuping Ji, Wei Wang, Chunyang Ye, Jun Wei, Zhaohui Liu","doi":"10.1145/2430475.2430490","DOIUrl":"https://doi.org/10.1145/2430475.2430490","url":null,"abstract":"In-memory data grid (IMDG) is a novel data processing middleware for Internetware. It provides higher scalability and performance compared with traditional rational database. However, because the data stored in IMDG must follow the key/value data model, new challenges have been proposed. One important aspect is that IMDG does not support standard data accessing languages such as JPA and SQL, and application developers must design their programs according to the peculiarities of an IMDG product. This results in complex and error-prone code, especially for the programmers who have no deep understanding of IMDG. In this paper, we propose a data accessing reference architecture for IMDG and a methodology to design and implement its data accessing layer. In this methodology, data accessing engine construction, data model designation and join operation supporting are presented. Moreover, following this methodology, we develop and implement a JPA compatible data accessing engine for Hazelcast as a case study, which proves the feasibility of our approach.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"11 1","pages":"15:1-15:7"},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82002852","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}
Chang Xu, S. Cheung, Xiaoxing Ma, Chun Cao, Jian Lu
Internetware applications are context-aware and adaptive to their environmental changes. Faulty adaptation may arise when these applications face unexpected situations. Such adaptation faults can be difficult to detect at design time. The recent Adaptation Finite-State Machine (A-FSM) approach proposes to statically analyze model-based context-aware applications for adaptation faults. However, this approach may suffer expressiveness and precision problems. To address these limitations, we propose an Adaptation Model (AM) approach. As compared with A-FSM, AM offers increased expressive power to model complex rules, and guarantees soundness in fault detection. Besides, AM deploys an efficient rule evaluation technique to cater for context-aware applications that are subject to continual environmental changes. We evaluated our AM approach using both simulated and real-world experiments with two applications. The experimental results confirmed that AM can detect real faults missed by A-FSM, and avoid false positives that were misreported otherwise.
{"title":"Dynamic fault detection in context-aware adaptation","authors":"Chang Xu, S. Cheung, Xiaoxing Ma, Chun Cao, Jian Lu","doi":"10.1145/2430475.2430476","DOIUrl":"https://doi.org/10.1145/2430475.2430476","url":null,"abstract":"Internetware applications are context-aware and adaptive to their environmental changes. Faulty adaptation may arise when these applications face unexpected situations. Such adaptation faults can be difficult to detect at design time. The recent <u>A</u>daptation <u>F</u>inite-<u>S</u>tate <u>M</u>achine (A-FSM) approach proposes to statically analyze model-based context-aware applications for adaptation faults. However, this approach may suffer expressiveness and precision problems. To address these limitations, we propose an <u>A</u>daptation <u>M</u>odel (AM) approach. As compared with A-FSM, AM offers increased expressive power to model complex rules, and guarantees soundness in fault detection. Besides, AM deploys an efficient rule evaluation technique to cater for context-aware applications that are subject to continual environmental changes. We evaluated our AM approach using both simulated and real-world experiments with two applications. The experimental results confirmed that AM can detect real faults missed by A-FSM, and avoid false positives that were misreported otherwise.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"38 1","pages":"1:1-1:10"},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84441193","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：