{"title":"RIES - Internet voting in action","authors":"Engelbert Hubbers, B. Jacobs, W. Pieters","doi":"10.1109/COMPSAC.2005.132","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.132","url":null,"abstract":"RIES stands for Rijnland Internet Election System. It is an online voting system that has been used twice in the fall of 2004 for in total over two million potential voters. In this paper we describe how this system works. Furthermore we describe how the system allowed us to independently verify the outcome of the elections - a key feature of RIES. To conclude the paper we evaluate possible threats to this system and describe some possible points for improvement.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"13 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120818032","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":"Experiences with a dialog-driven process model for Web application development","authors":"Matthias Book, V. Gruhn","doi":"10.1109/COMPSAC.2005.75","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.75","url":null,"abstract":"We present a dialog-driven process model for the development of Web-based applications that uses a graphical notation to model and iteratively refine the application's dialog flow, and communicate with non-technical stakeholders in the development process. This way, the user interface can drive the design and implementation of the application logic and data model instead of being dictated by it. After an introduction of the underlying notation and dialog control framework, we present how these tools can support the phases of the development process and discuss experiences gained from the implementation of a Web application that was built using this approach.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126734769","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":"Structure analysis for dynamic software architecture based on spatial logic","authors":"Tingting Han, Taolue Chen, Jian Lu","doi":"10.1109/COMPSAC.2005.146","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.146","url":null,"abstract":"The requirement for modifying system structure during system execution is specified by dynamic software architectures. The system architecture style should remain one style or transform within a scope so that some constraints need to be imposed on during the system execution. Our work expands such an idea along two directions in the setting of formalism. The first direction is to model the system by a graph-based calculus stressing the structure. The other direction lies in that we tailor spatial logic to be a suitable logic as the system specification for structure. The model and specification are basis for the model checking algorithm that is to verify whether the system evolution satisfies some structure constraints. We invite a master-slave architecture style as a running example from the beginning and throughout the paper to demonstrate our approach. Such work can be seen as the basis of the structure analysis for architectures.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127033803","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}
Arnor Solberg, Devon M. Simmonds, Y. R. Reddy, Sudipto Ghosh, R. France
{"title":"Using aspect oriented techniques to support separation of concerns in model driven development","authors":"Arnor Solberg, Devon M. Simmonds, Y. R. Reddy, Sudipto Ghosh, R. France","doi":"10.1109/COMPSAC.2005.168","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.168","url":null,"abstract":"Model driven development (MDD) tackles software complexity through the use of models. However, managing relationships and specifying transformations between models at various levels of abstraction are complex tasks. System models tangled with concerns such as security and middleware make it difficult to develop complex systems and specify model transformations. This paper presents an MDD framework that uses aspect oriented techniques to facilitate separation of concerns. We argue that using the framework will simplify both the model development task and the task of specifying transformations. The conceptual model of the framework is presented and illustrated using distributed transactions at the PIM and PSM levels.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122842738","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":"Automated harvesting of test oracles for reliability testing","authors":"Oliver Hummel, C. Atkinson","doi":"10.1109/COMPSAC.2005.49","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.49","url":null,"abstract":"Reliability testing is of even greater importance in component-based development than it is in traditional development methods, since it is the only practical way of measuring how well assembled components match each others' expectations. However, support for reliability testing has improved little over the last few years and it remains one of the most costly elements of software engineering. In this paper we present an approach that tackles the most fundamental obstacle to more efficient reliability testing - namely, the problem of automating the generation of \"correct\" reference results against which to evaluate component outputs. The approach employs the same basic technologies that can be used to discover components for reuse, but instead of building them into the final system it uses them, in combination with others, as an automated pseudo-oracle for measuring the reliability of self-built components. This significantly enhances the utility of component discovery technology, since it allows value to be derived from components which do not pass the threshold needed for full reuse but are sufficiently reliable to form a functioning component of a test oracle.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128498014","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":"Reasoning about software architecture-based regression testing through a case study","authors":"H. Muccini, M. Dias, D. Richardson","doi":"10.1109/COMPSAC.2005.127","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.127","url":null,"abstract":"Two main issues need to be covered when dealing with the dependability of component-based systems: quality assurance of reusable software components and quality assurance of the assembled component-based system. By focussing on the assembly, a software architecture specification of a component-based system allows to explicitly model the structure and required system behavior by specifying how components and connectors are intended to interact. Software architecture-based conformance testing techniques can yield confidence on the implementation conformance to expected structural and behavioral properties as specified in the architectural models. In this paper we explore software architecture-based regression testing methods that enable reuse of earlier saved results to test if a different assembly of components conforms to the evolved software architecture. The approach is presented through a running example.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"55 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128356795","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":"Fault injection approach based on dependence analysis","authors":"Regina L. O. Moraes, E. Martins, N. Mendes","doi":"10.1109/COMPSAC.2005.78","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.78","url":null,"abstract":"Fault injection is used to validate a system in the presence of faults. Jaca, a software injection tool developed in previous work, is used to inject faults at interfaces between classes of a system written in Java. We present a strategy for fault injection validation based on dependence analysis. The dependence analysis approach is used to help in reducing the number of experiments necessary to cover the system's interfaces. For the experiments we used a system that consists of two integrated components, an ODBMS performance test benchmark, Wisconsin 007 and an ODBMS, Ozone. The results of some experiments and their analysis are presented.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129140012","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":"Automated negotiation of privacy contracts","authors":"M. Maaser, P. Langendörfer","doi":"10.1109/COMPSAC.2005.50","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.50","url":null,"abstract":"Privacy in the Internet is currently not addressed or just stated to tacit acceptance. The user is left to either accept or deny the contractual conditions. A negotiation and thus dynamic contract placement would allow for fairer chances concerning privacy. This article introduces a data-model to describe negotiation preferences and the resulting contracts. It is described, how proposals of contracts are to be compared with the preferences for acceptance and what steps of negotiation can be taken. This model is examined for privacy contracts between enterprises and their customers.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124688637","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":"Two variations to the mCESG pollsterless e-voting scheme","authors":"Tim Storer, I. Duncan","doi":"10.1109/COMPSAC.2005.165","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.165","url":null,"abstract":"Over the past several years, the UK government has piloted several new voting technologies during local authority elections. The mCESG pollsterless Remote Electronic Voting (REV) system, which was designed with the UK electoral context in mind, is described in detail by Storer and Duncan (2004). Here, we describe two variations to the mCESG scheme which (a) improve its suitability for the variety of electoral systems in use in the UK and (b) provide a means for resisting coercion attacks to which the original scheme was vulnerable.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125975054","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":"Performability analysis of a pipeline software architecture","authors":"S. Gokhale, S. Yacoub","doi":"10.1109/COMPSAC.2005.120","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.120","url":null,"abstract":"An architecture style defines a commonly occurring pattern of the structural organization of components and connectors such that the impact of the pattern on the different non functional attributes is known. It is possible to make a qualitative assessment of whether a specific style is conducive to the nonfunctional attribute of performance based on the knowledge and experience in the use of the style. It is necessary however, that such a qualitative judgment be substantiated by a quantitative estimate obtained using a systematic performance analysis approach, since architecture styles are likely to be used in domains where application performance will play a critical role in ensuring its widespread use. Recognizing this need, several research efforts have focused on the development of quantitative performance analysis approaches for general purpose software architectures as well as for architecture styles. A notable drawback of the existing approaches is that they do not consider failures of components and connectors and hence provide optimistic performance estimates. In this paper we present a performability analysis approach for a pipeline architecture style which accounts for unreliable components. The performance estimate provided by the proposed approach is more realistic than what can be provided by the prevalent approaches. We illustrate the potential of the approach with an industrial case study of a document analysis system.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115778331","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}