Vasileios Koutsoumpas, K. Kontogiannis, Peter Matthews
{"title":"Dynamic Analysis for the Reconstruction of System Behavior Models","authors":"Vasileios Koutsoumpas, K. Kontogiannis, Peter Matthews","doi":"10.1109/COMPSACW.2010.55","DOIUrl":"https://doi.org/10.1109/COMPSACW.2010.55","url":null,"abstract":"The analysis of large software systems is often a difficult and time consuming task because of the sheer complexity of such systems, and the limited access software engineers have to the system’s source code. In this respect, it is important to be able to analyze the system based on the events that can be collected while the system performs its specified operations. Such analysis, can take the form of reconstructing system behavioral models, and identifying common operational patterns that may assist software engineers deduce important information on the properties and characteristics of the system being analyzed. In this paper, we present an analysis technique that allows for the hierarchical reconstruction of sequence diagrams and the identification of common event patterns from system traces. The technique has been applied for the analysis of different operations in the Session Initiation Protocol.","PeriodicalId":121135,"journal":{"name":"2010 IEEE 34th Annual Computer Software and Applications Conference Workshops","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125471475","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}
Seung-Hun Shin, Seung-Kyu Park, Kyunghee Choi, Kinkyun Jung
{"title":"Normalized Adaptive Random Test for Integration Tests","authors":"Seung-Hun Shin, Seung-Kyu Park, Kyunghee Choi, Kinkyun Jung","doi":"10.1109/COMPSACW.2010.65","DOIUrl":"https://doi.org/10.1109/COMPSACW.2010.65","url":null,"abstract":"The Adaptive Random Testing (ART) was devised to improve the performance of pure random tests, which is one of black-box testing strategies. The ART-based algorithms were developed mainly for unit or single module tests. When a given unit-under-test (UUT) is integrated with an already proven front-end software module which takes inputs and supplies the outputs to the UUT, the performance of ART-based algorithm applied to the integrated software is severely degraded depending on the behavior of front-end software. In this paper, a normalized ART-based algorithm is proposed for the integration and regression tests where an UUT is integrated with a front-end software module. The front-end software with three different functions, Log, Exponential, and Normal function, is experimented by the simulation to show the performance of the proposed method. Depending on the skewness driven by the function of front-end, the experimental results show that the proposed method outperforms significantly the ART without normalization in terms of F-measure.","PeriodicalId":121135,"journal":{"name":"2010 IEEE 34th Annual Computer Software and Applications Conference Workshops","volume":"265 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122911595","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}
Igors Svecs, Tanmoy Sarkar, Samik Basu, Johnny S. K. Wong
{"title":"XIDR: A Dynamic Framework Utilizing Cross-Layer Intrusion Detection for Effective Response Deployment","authors":"Igors Svecs, Tanmoy Sarkar, Samik Basu, Johnny S. K. Wong","doi":"10.1109/COMPSACW.2010.57","DOIUrl":"https://doi.org/10.1109/COMPSACW.2010.57","url":null,"abstract":"We present a complete intrusion detection and response framework named XIDR (Cross-layer Intrusion Detection and Response), which utilizes multi-source intrusion detection systems to enable cross-layer intrusion detection and cross-layer automated intrusion response system to deploy cost-effective and efficient preemptive responses. In this paper, we define the notion of cross-layer design which integrates features from various layers for detecting intrusions in wired environment, enables more fine grained detection technique and also helps us to reduce false positive and false negative rate. Moreover, cross-layer based approach for selecting and deploying response will help to deploy responses at various layers in the network. This approach will mitigate the impact of sophisticated attacks in the most efficient manner. The response selection will be preemptive as well as adaptive to the ongoing intrusion.","PeriodicalId":121135,"journal":{"name":"2010 IEEE 34th Annual Computer Software and Applications Conference Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114938488","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":"Analysis of Two Watermarking Protocols Based on Commutative Encryption","authors":"Moesfa Soeheila Mohamad, G. Poh","doi":"10.1109/COMPSACW.2010.30","DOIUrl":"https://doi.org/10.1109/COMPSACW.2010.30","url":null,"abstract":"We analyse two watermarking protocols proposed by Wang, Leung, Cheung and Wang, and by Cheung, Leung and Wang. These protocols claimed to provide fair content tracing using watermarking schemes and commutative encryption, whereby a content provider can trace an illegal copy to a customer that distributed this copy. Simultaneously, an honest customer is assured that he or she will not be falsely accused of illegal content distribution. We show that the two protocols contain flaws by examining how a dishonest content provider can frame an honest customer by falsely accusing the customer of illegally distributing content. Similarly, we show how a dishonest customer may possibly redistribute the digital content without being traced by the content provider. Therefore, the protocol does not fulfill the aims as claimed. We further put forward our thoughts on how best to avoid these security weaknesses.","PeriodicalId":121135,"journal":{"name":"2010 IEEE 34th Annual Computer Software and Applications Conference Workshops","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128459348","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":"Aspect-Oriented Development of PHP-Based Web Applications","authors":"S. Nakajima, Keiji Hokamura, Naoyasu Ubayashi","doi":"10.1109/COMPSACW.2010.17","DOIUrl":"https://doi.org/10.1109/COMPSACW.2010.17","url":null,"abstract":"Web applications, which are sometimes developed incrementally and iteratively, may result in program codes that are poorly organized. The notion of aspect can theoretically be introduced for better modularization, but trials occasionally fail because homogeneous aspects alone are not adequate. The approach taken here is to introduce feature analysis and to radically use heterogeneous aspects to implement identified application features. This paper discusses our demonstration of the idea with an example case where Web applications were developed by using AOWP, which is a new AOP framework for PHP programs.","PeriodicalId":121135,"journal":{"name":"2010 IEEE 34th Annual Computer Software and Applications Conference Workshops","volume":"12 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134635975","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":"Approximation of CFL by Regular Languages for Concurrent Program Verification","authors":"S. Kundu, S. Mukhopadhyay","doi":"10.1109/COMPSACW.2010.68","DOIUrl":"https://doi.org/10.1109/COMPSACW.2010.68","url":null,"abstract":"Many problems related to verification of concurrentprograms can be reduced to the non-empty intersectionproblem for context-free languages. Since the latter is anundecidable problem, a practical approach for solving theintersection problem is to convert it to a decidable problemof the non-empty intersection of a context-free languageand a regular language. This is done by approximatingone of the context-free languages in the intersection fromabove or from below by a regular language. We give anapproximation technique from above by modeling a context-free language L in terms of linear integer inequalitiesand then obtaining the approximating regular language L¢Ê L by relaxing the linear inequalities such that eachinequality involves at most one variable. Previous approximationtechniques focused on approximation below. Wealso give an alternate technique with a finite-state automatabased approach, where we start with an automata Mwhich accepts a suitable finite-subset L0 of L, and thenextend M successively based on the pumping property ofL till the language accepted by M contains L","PeriodicalId":121135,"journal":{"name":"2010 IEEE 34th Annual Computer Software and Applications Conference Workshops","volume":"28 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132503025","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":"Analyzing Interoperability Requirements for Adaptive Service-Based Applications: A Goal-Oriented Approach","authors":"Nauman A. Qureshi, Duy Cu Nguyen, A. Perini","doi":"10.1109/COMPSACW.2010.49","DOIUrl":"https://doi.org/10.1109/COMPSACW.2010.49","url":null,"abstract":"Interoperability is a key enabler for service integration and composition across borders of organization, platforms, and devices. Eliciting and analyzing interoperability requirements are, thus, a crucial step in the development of service-based applications (SBA). In the context of user-centric services, the users’ goals and preferences are become ing more and more relevant, and SBA has to ensure seam-less interoperation not only among heterogeneous services and devices themselves, but also among varied users with different intentions. Toward tackling this problem, in this paper, we propose to leverage the interoperability concept from being only technological to intentional and present an analysis framework to help capturing and elaborating interoperability requirements. We illustrate the use of the proposed framework with the help of a scenario.","PeriodicalId":121135,"journal":{"name":"2010 IEEE 34th Annual Computer Software and Applications Conference Workshops","volume":"18 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132609657","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":"Requirements and Tools for Variability Management","authors":"Marco Aiello, Pavel Bulanov, Heerko Groefsema","doi":"10.1109/COMPSACW.2010.50","DOIUrl":"https://doi.org/10.1109/COMPSACW.2010.50","url":null,"abstract":"Explicit and software-supported Business Process Management has become the core infrastructure of any medium and large organization that has a need to be efficient and effective. The number of processes of a single organization can be very high, furthermore, they might be very similar, be in need of momentary change, or evolve frequently. If the adhoc adaptation and customization of processes is currently the dominant way, it clearly is not the best. In fact, providing tools for supporting the explicit management of variation in processes (due to customization or evolution needs) has a profound impact on the overall life-cycle of processes in organizations. Additionally, with the increasing adoption of Service-Oriented Architectures, the infrastructure to support automatic reconfiguration and adaptation of business process is solid. In this paper, after defining variability in business process management, we consider the requirements for explicit variation handling for (service based) business process systems. eGovernment serves as an illustrative example of reuse. In this case study, all local municipalities need to implement the same general legal process while adapting it to the local business practices and IT infrastructure needs. Finally, an evaluation of existing tools for explicit variability management is provided with respect to the requirements identified.","PeriodicalId":121135,"journal":{"name":"2010 IEEE 34th Annual Computer Software and Applications Conference Workshops","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132438907","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":"Optimizing Requirements Elicitation with an i* and Bayesian Network Integrated Modelling Approach","authors":"H. Wu, Lin Liu, Wenting Ma","doi":"10.1109/COMPSACW.2010.40","DOIUrl":"https://doi.org/10.1109/COMPSACW.2010.40","url":null,"abstract":"In today’s web-based environment, strategic actors collaborate and compete to further its interests and opportunities. In this paper, we propose optimizing the requirements elicitation process through the combined use of the i* modeling framework with the quantitative risk analysis model of Bayesian Network (BN), so that strategic actors can estimate the potential opportunities and risks of concerned high-level goals within a multi-agent network. Major content of the paper include: a brief introduction and comparative study of the meta-model of i* and BN; a set of heuristic rules for mapping an i* model into a Bayesian network; the reasoning process of the i* and BN integrated approach. We use the widely cited meeting scheduler example in the literature to illustrate the proposed approach.","PeriodicalId":121135,"journal":{"name":"2010 IEEE 34th Annual Computer Software and Applications Conference Workshops","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127020637","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":"Flexible Prime Number Labeling for Resource Limited Clients","authors":"D. An, Seog Park","doi":"10.1109/COMPSACW.2010.34","DOIUrl":"https://doi.org/10.1109/COMPSACW.2010.34","url":null,"abstract":"We proposed a flexible prime number labeling for an evolutionary computing environment. The existing access control environment relies on the server to solve security problems. The current environment has become almost distributed and ubiquitous. This change has spawned the need for light-weight access control by clients, which have a resource limited environment. Existing studies using role-based prime number labeling (RPNL) are limited by the scalability of the prime number. The problem of scalability of the prime number was addressed with the use of the strong point of RPNL and implementation of persistent XML labeling and efficient query processing. The proposal has the advantage of having an adaptable access control scheme for an existing XML labeling method. We showed the efficiency of the proposed approach through experiments.","PeriodicalId":121135,"journal":{"name":"2010 IEEE 34th Annual Computer Software and Applications Conference Workshops","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116434913","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}