{"title":"Facet-based access control model for View-Oriented Programming","authors":"Mehdi Adda, H. Mcheick","doi":"10.1109/AICCSA.2010.5586940","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586940","url":null,"abstract":"Security is an integral part of the modern software systems and applications in which a client program can access different functional aspects (views) of the same domain. These views (View-Oriented Programming-VOP), as a separation of concerns approach, enable us to manage the complexity of the software systems and to accomplish greater reuse and maintainability. In VOP, an object's response to a message depends on the views currently attached to its core instance. View-oriented programming suffers from a formal model and security issues to protect the privileges of each client who needs to access different views of the same object. This paper describes a facet-based access control model to handle security issues in VOP. Especially, it introduces algebra and formalism to describe VOP and to protect the privileges of each client program. These issues are discussed through an example.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124891232","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":"A possibilistic classification approach to handle continuous data","authors":"Myriam Bounhas, K. Mellouli","doi":"10.1109/AICCSA.2010.5586964","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586964","url":null,"abstract":"Naive Possibilistic Network Classifiers (NPNC) have been recently used to accomplish the classification task in presence of uncertainty. Because they are mainly based on possibility theory, they run into problems when they are faced with imperfection where the possibility theory is the most convenient tool to represent it. In this paper we investigate to develop a new classification approach for perfect/imperfect (imprecise) continuous attribute values under the possibilistic framework based mainly on Possibilistic Networks. To build the naive possibilistic network classifier, we develop a procedure able to deal with perfect or imperfect dataset attributes which is used to classify new instances that may be characterized by imperfect attributes. We have tested our approach on several different datasets. The results show that this approach is efficient in the imperfect case.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121350118","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":"A model for analyzing architectural attributes","authors":"I. Derbel, L. L. Jilani, A. Mili","doi":"10.1109/AICCSA.2010.5586933","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586933","url":null,"abstract":"Even though nothing is ever that simple/ clear cut in software engineering, one would argue that by contrast with source code, which represents the detailed functional attributes of a software product, the architecture of a software product represents its non functional attributes. The architecture of a software product determines such attributes as its response time, throughput, reliability, security, maintainability, availability, etc. In this paper we present a model for reasoning about quantitative non functional attributes of software architectures, and discuss our plan to develop automated support for this model.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115766780","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":"Towards an automated tool for computing loop functions","authors":"L. L. Jilani, Olfa Mraihi, Asma Louhichi, A. Mili","doi":"10.1109/AICCSA.2010.5586943","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586943","url":null,"abstract":"Despite several decades of on-and-off research efforts, the functional analysis of computer programs to an arbitrary level of thoroughness and precision remains an unfulfilled challenge. Also, despite several decades of advances in programming language design and implementation, most of the software that is written and maintained today is written in traditional imperative programs; in such programs, the most critical/ most complex control structure is the loop. In this paper, we discuss our ongoing effort to develop a tool that reviews a while loop written in an imperative language (C, C++, Java) and derives its function, by specifying the final values of all its program variables as a function of its initial values.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125423536","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}
Jounaidi Ben Hassan, O. Hasan, Tarek Sadani, S. Tahar
{"title":"Performance analysis of real-time rewriting models","authors":"Jounaidi Ben Hassan, O. Hasan, Tarek Sadani, S. Tahar","doi":"10.1109/AICCSA.2010.5586958","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586958","url":null,"abstract":"Real-time systems usually involve a subtle interaction of a number of distributed components and have a high degree of parallelism, which makes their performance analysis quite complex. Thus, traditional techniques, such as simulation, fail to produce reasonable results. Formal methods pose an interesting solution but they usually lack the capabilities to reason about quantitative time and probabilistic properties, which play a vital role in performance analysis. This paper addresses this issue by presenting a formal approach for assessing the performance of a real-time system. To describe the evolution of the system, we use a real-time rewriting logic, in which we mechanize the extraction of quantitative information from a timed model. To evaluate the performance, we first consider the set of runs obtained from different initial input values that are not equivalent modulo the equational theory associated with the model. The overall performance of the system is then evaluated as the performance of each run weighted by its probability mass function. In order to illustrate the practical effectiveness of the proposed approach, we present the formal modeling and performance analysis of a simple search engine.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130961424","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":"An overview of search methodologies in Semantic Web","authors":"Thabet Slimani, B. B. Yaghlane","doi":"10.1109/AICCSA.2010.5587013","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587013","url":null,"abstract":"Several researches in Semantic Web are based on information search centered meaning. The common purpose of these researches is to improve current information search and retrieval methods. The last few years have seen a various number of developed semantic search systems. The requirement of a complete survey in this field is one of the main purpose of this paper. The approaches, methodologies and objectives of some recognized projects and their corresponding practical systems are exploited to constitute this overall view of semantic search. In this paper, we present and compare various research directions in semantic search. Further, we give discussion with regards to future research in this area.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115028357","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":"A lightweight user authentication scheme for Wireless Sensor Networks","authors":"O. Cheikhrouhou, A. Koubâa, M. Boujelben, M. Abid","doi":"10.1109/AICCSA.2010.5586995","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586995","url":null,"abstract":"User authentication in classical networks is deeply addressed, but few results are related to Wireless Sensor Networks (WSNs). In addition, the proposed schemes do not provide mutual authentication or session-key agreement between the server and the user. Therefore, we present in this paper a lightweight user authentication scheme adapted to WSNs that provides mutual authentication and session-key agreement. The proposed scheme allows a user equipped with mobile device (typically PDA) to authenticate himself before gaining access to the WSN. The scheme is executed at two sides; the client side which controls the user's mobile device and the server side represented by the coordinator of the WSN. A security analysis of the scheme is presented and it proves its resilience against classical types of attacks. The scheme is also implemented on real platform of sensor nodes. This implementation proves that our scheme is lightweight and rapid as it requires approximately only 1s to be fully executed. In addition, we have made a comparison between our scheme and the existing ones based on their security properties, and shown that our proposed scheme outperforms the existing ones in terms of confidentiality, integrity, mutual authentication and session key generation with a lightweight computation overhead.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115032124","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":"The limitations of genetic algorithms in software testing","authors":"S. Aljahdali, Ahmed S. Ghiduk, M. El-Telbany","doi":"10.1109/AICCSA.2010.5586984","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586984","url":null,"abstract":"Software test-data generation is the process of identifying a set of data, which satisfies a given testing criterion. For solving this difficult problem there were a lot of research works, which have been done in the past. The most commonly encountered are random test-data generation, symbolic test-data generation, dynamic test-data generation, and recently, test-data generation based on genetic algorithms. This paper gives a survey of the majority of software test-data generation techniques based on genetic algorithms. It compares and classifies the surveyed techniques according to the genetic algorithms features and parameters. Also, this paper shows and classifies the limitations of these techniques.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116363615","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}
Atef Khedher, K. B. Othman, D. Maquin, M. Benrejeb
{"title":"An approach of faults estimation in Takagi-Sugeno fuzzy systems","authors":"Atef Khedher, K. B. Othman, D. Maquin, M. Benrejeb","doi":"10.1109/AICCSA.2010.5586970","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586970","url":null,"abstract":"In this work, the problem of fault detection and identification in systems described by Takagi-Sugeno fuzzy systems is studied. A proportional integral observer is conceived in order to reconstruct state and faults which can affect the system. In order to estimate actuator and sensor faults, a mathematical transformation is made to conceive an augmented system, in which the initial sensor fault appears as an actuator fault. Considering actuator fault as an unknown input, one can use an unknown inputs estimation method. The noise effect on the state and fault estimation is also minimized.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122792990","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}
M. Leonardi, M. V. Mauco, L. Felice, G. Montejano, D. Riesco, N. Debnath
{"title":"Recovering business process diagrams from UML diagrams","authors":"M. Leonardi, M. V. Mauco, L. Felice, G. Montejano, D. Riesco, N. Debnath","doi":"10.1109/AICCSA.2010.5586982","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586982","url":null,"abstract":"Enterprises increasingly automate business and processes tasks, which make them highly dependent on their information systems. However, the documentation for business processes is rarely available; therefore the systems are often difficult to understand and maintain. In this paper we propose an initial strategy to recover the business processes of an organization from sequence diagrams. The strategy contains a set of heuristics that allow the manipulation of the components of a sequence diagram to define the BPMN components; at the same time, traceability information is recorded.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122678705","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}