{"title":"The Permanent Challenge: How to Enhance Assurance to Users of Computer and Communication Systems?","authors":"M. Malek","doi":"10.1109/ISADS.2011.82","DOIUrl":"https://doi.org/10.1109/ISADS.2011.82","url":null,"abstract":"Permanence of the assurance challenge in computer and communication systems is described and justified. Models and methods of meeting the assurance challenge are briefly outlined.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125256728","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}
{"title":"Fast Detection of Path Failures in an Autonomous Decentralized System","authors":"Jianli Sun, Yinong Chen","doi":"10.1109/ISADS.2011.43","DOIUrl":"https://doi.org/10.1109/ISADS.2011.43","url":null,"abstract":"An autonomous decentralized system and a series of methods for reducing the detection time of path failures in the system are developed. Computing devices in the proposed system are organized into at least three groups based on their connectivity of system’s graph model. Each computing device is assigned three identification values associated with their group memberships. The identification values are stored in a router connected to the communications network. Heartbeat packets are sent from the computing devices to the router periodically. If the router fails to receive a heartbeat packet from a computing device, a failed communication path from the router to the computing device is determined based on the three identification values.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126622197","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}
{"title":"Autonomous and Adaptive Wireless Networking with Bio-inspired Algorithms","authors":"N. Wakamiya, M. Murata","doi":"10.1109/ISADS.2011.85","DOIUrl":"https://doi.org/10.1109/ISADS.2011.85","url":null,"abstract":"A new generation network is expected to keep operating and providing users and applications with means of communication while being exposed to dynamic and substantial change in the operational environment such as network topology, traffic, and QoS requirement. To establish a highly adaptive and reliable network, we take an approach to be inspired by biological systems, which adapt themselves to dynamically changing and even unexpected environment. In this paper we show examples of application of bio-inspired models, more specifically the attractor selection/composition models built on adaptive behavior of biological systems, to autonomous and adaptive networking in wireless communication systems. The first application is MANET routing, where a path connecting a source-destination pair must be maintained under dynamically changing environment. The second application is resource allocation among nodes and applications competing for wireless networks with heterogeneous characteristics. We further discuss future direction of bio-inspired adaptive networking.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125898690","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}
{"title":"DsVD: An Effective Low-Overhead Dynamic Software Vulnerability Discoverer","authors":"Zhuo Wang, Zhushou Tang, Kan Zhou, Ruoyu Zhang, Zhengwei Qi, Haibing Guan","doi":"10.1109/ISADS.2011.56","DOIUrl":"https://doi.org/10.1109/ISADS.2011.56","url":null,"abstract":"Dynamic taint analysis based software vulnerability and malware detection is an effective method to detect a wide range of vulnerabilities. Unfortunately, existing systems suffer from requirement of source code, high overhead or shortage of discovery rules, which limit their usage. This paper proposes a low-overhead vulnerability discovery system called DsVD (Dynamic Software Vulnerabilities Discoverer). DsVD works on X86 executables and does not need any hardware change. A new taint state called controlled-taint is introduced to detect more types of vulnerabilities. Our experiments show that DsVD can effectively detect various software vulnerabilities. DsVD incurs very low overhead, only 3.1 times on average forSPECINT2006 benchmarks. With some optimizations such as Irrelevant API Filter and Basic Block Handling, it can reduce runtime overhead by a factor of 4-11 times.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116742476","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}
{"title":"Safety Monitoring for ETCS with 4-valued LTL","authors":"Xian Li, Ming Chai, Lin Zhao, T. Tang, Tianhua Xu","doi":"10.1109/ISADS.2011.18","DOIUrl":"https://doi.org/10.1109/ISADS.2011.18","url":null,"abstract":"When verifying the safety of ETCS, testing and formal methods have limitations to some degree. Runtime verification is effective to detect deviation between the current and the expected system behaviors. To improve the accuracy of runtime monitoring, 4-valued LTL (Linear Time Logic) semantics and formula rewriting based algorithm are proposed. Furthermore, approximation technique is presented for 4-valued LTL formulae to make the verification procedure high efficient. Finally, the method is applied to the European Train Control System (ETCS) by monitoring several scenario traces. The experimental results show that the 4-valued LTL semantics are able to generate the most accurate verification outcomes. It can also be found that the approximation technique improves the verification efficiency apparently in some cases.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114884523","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}
{"title":"SMSS: Symmetric-Masquerade Security Scheme for VANETs","authors":"Lingyun Zhu, Cheng Chen, Xin Wang, A. Lim","doi":"10.1109/ISADS.2011.88","DOIUrl":"https://doi.org/10.1109/ISADS.2011.88","url":null,"abstract":"Security plays an important role in the system design with the development of VANETs. Because of the unreliable communications in VANETs, security protocols need more considerations, such as privacy, authentication, and consistency of messages. However, efficiency has been overlooked before, because previous methods incur significant communication overhead. In this paper, we propose a novel security scheme, named Symmetric-Masquerade Security Scheme (SMSS), which can achieve the security requirements while keeping a low system overhead. In SMSS, we focus on the vehicle-to-vehicle communications, which is among the typical scenarios in VANETs. The symmetric encryption is employed in our scheme to ensure the consistency of the messages, the local pseudonyms are equipped to protect the privacy, and the pre-shared keys are introduced to implement the authentication. This paper makes a detailed description of the novel scheme, then analyzes its performance in comparison with that of the PKI security scheme.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133759476","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}