Pub Date : 2005-07-26DOI: 10.1109/COMPSAC.2005.149
T. Seceleanu, D. Garlan
In this paper we demonstrate how to use action systems to specify and refine self-adaptive systems. Focusing on the special case in which there is a fixed set of possible configurations, we use a recently-introduced synchronization operator to achieve separation of concerns between adaptation policy and steady-state system execution. The use of action systems permits the application of standard techniques for refinement to construct correct implementations from higher-level models. We illustrate the application of this idea to the problem of coping with dynamically-varying user requirements.
{"title":"Synchronized architectures for adaptive systems","authors":"T. Seceleanu, D. Garlan","doi":"10.1109/COMPSAC.2005.149","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.149","url":null,"abstract":"In this paper we demonstrate how to use action systems to specify and refine self-adaptive systems. Focusing on the special case in which there is a fixed set of possible configurations, we use a recently-introduced synchronization operator to achieve separation of concerns between adaptation policy and steady-state system execution. The use of action systems permits the application of standard techniques for refinement to construct correct implementations from higher-level models. We illustrate the application of this idea to the problem of coping with dynamically-varying user requirements.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"47 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":"132669003","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}
Performance analysis gains more attention in recent years by researchers who focus their study on the early software development stages to mitigate the risk of redesign as problems emerge later. Previously we proposed PSIM (a performance simulation and modeling tool) that integrated performance properties into software architecture specifications expressed in several major UML diagrams. PSIM models can be transformed into colored GSPN and the colored GSPN models can then be simulated to perform model-based performance evaluation. In this paper we briefly review the PSIM approach and apply it to model a Web-based conferencing system, called M-Net, to derive performance metrics. We then conduct runtime performance testing to the implementation of M-Net and compare the simulation data to runtime testing data. The comparison results show the effectiveness of the PSIM method in predicting system performance and identifying system performance bottlenecks.
{"title":"An empirical performance study for validating a performance analysis approach: PSIM","authors":"Jinchun Xia, Yujia Ge, Carl K. Chang","doi":"10.1109/COMPSAC.2005.43","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.43","url":null,"abstract":"Performance analysis gains more attention in recent years by researchers who focus their study on the early software development stages to mitigate the risk of redesign as problems emerge later. Previously we proposed PSIM (a performance simulation and modeling tool) that integrated performance properties into software architecture specifications expressed in several major UML diagrams. PSIM models can be transformed into colored GSPN and the colored GSPN models can then be simulated to perform model-based performance evaluation. In this paper we briefly review the PSIM approach and apply it to model a Web-based conferencing system, called M-Net, to derive performance metrics. We then conduct runtime performance testing to the implementation of M-Net and compare the simulation data to runtime testing data. The comparison results show the effectiveness of the PSIM method in predicting system performance and identifying system performance bottlenecks.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"36 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":"133251924","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}
This paper shows the need of a framework which can be used to measure the functionality delivered by electronic commerce (e-commerce) systems. Such a framework would be helpful in areas such as cost prediction, effort estimation, and so on. The paper goes on to propose such a framework, based on the established methods of function points and object points.
{"title":"Measuring the functionality of online stores","authors":"E. Cachia, Mark Micallef","doi":"10.1109/COMPSAC.2005.97","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.97","url":null,"abstract":"This paper shows the need of a framework which can be used to measure the functionality delivered by electronic commerce (e-commerce) systems. Such a framework would be helpful in areas such as cost prediction, effort estimation, and so on. The paper goes on to propose such a framework, based on the established methods of function points and object points.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"37 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":"121970752","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}
D. Llewellyn-Jones, M. Merabti, Q. Shi, R. Askwith
Buffer overrun vulnerabilities cause significant security problems, and have proven to be difficult to prevent. In this paper we present a novel approach to tackling the problem. Rather than concentrate on how to prevent the use of code containing buffer overrun vulnerabilities, we look at component composition techniques that can allow vulnerable code to be executed in a safe way within a composed application. We establish how this can be determined in an automated way using formal code analysis techniques and present results from the prototype system that we have developed for this purpose.
{"title":"Buffer overrun prevention through component composition analysis","authors":"D. Llewellyn-Jones, M. Merabti, Q. Shi, R. Askwith","doi":"10.1109/COMPSAC.2005.54","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.54","url":null,"abstract":"Buffer overrun vulnerabilities cause significant security problems, and have proven to be difficult to prevent. In this paper we present a novel approach to tackling the problem. Rather than concentrate on how to prevent the use of code containing buffer overrun vulnerabilities, we look at component composition techniques that can allow vulnerable code to be executed in a safe way within a composed application. We establish how this can be determined in an automated way using formal code analysis techniques and present results from the prototype system that we have developed for this purpose.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"33 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":"125866215","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}
We propose a deductive method for constructing reliable reachability controllers, with application to fault-tolerant discrete systems. Designing the controller reduces to finding a strategy to win specific games defined by sequential angelic and demonic nondeterministic statements. During the game, the plant (the demon) tries to prevent the controller (the angel) from achieving its respective goal, modeled by a special kind of liveness property. We show that the angel has a way to enforce the required property, provided that adequate invariance and termination properties hold. The control strategy is obtained by propagating certain assertions into the angelic statement. We illustrate our method on a data-processing application.
{"title":"Designing controllers for reachability","authors":"C. Seceleanu","doi":"10.1109/COMPSAC.2005.68","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.68","url":null,"abstract":"We propose a deductive method for constructing reliable reachability controllers, with application to fault-tolerant discrete systems. Designing the controller reduces to finding a strategy to win specific games defined by sequential angelic and demonic nondeterministic statements. During the game, the plant (the demon) tries to prevent the controller (the angel) from achieving its respective goal, modeled by a special kind of liveness property. We show that the angel has a way to enforce the required property, provided that adequate invariance and termination properties hold. The control strategy is obtained by propagating certain assertions into the angelic statement. We illustrate our method on a data-processing application.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"46 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":"126125526","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}
Web applications often require users to provide personal information for customization, identification, or completing a transaction. However, the way we disclose our information in current cyberspace does not allow us to control the usage, release and circulation of the information, violating the basic principle of personal information privacy. Online personal data licensing (OPDL) is a framework to bring the control of personal information back to individuals by requiring application and service providers to obtain a license from a person before collecting, processing, and using his personal information. In this paper we present the license design and automation of the license negotiation process.
{"title":"On personal data license design and negotiation","authors":"Yuh-Jzer Joung, Cheng-An Yen, Chung-Tang Huang, Yi-Jhan Huang","doi":"10.1109/COMPSAC.2005.114","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.114","url":null,"abstract":"Web applications often require users to provide personal information for customization, identification, or completing a transaction. However, the way we disclose our information in current cyberspace does not allow us to control the usage, release and circulation of the information, violating the basic principle of personal information privacy. Online personal data licensing (OPDL) is a framework to bring the control of personal information back to individuals by requiring application and service providers to obtain a license from a person before collecting, processing, and using his personal information. In this paper we present the license design and automation of the license negotiation process.","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":"127401930","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}
This paper presents a new approach to generating configuration-oriented executable symbolic test sequences from Extended Finite State Machine (EFSM) models. The information about the values of the context variables and the domain intervals of the input parameters are exploited to guide the derivation of the test sequences. Meanwhile, the transition guards along the test sequences are continually used to reduce the domain intervals of the input parameters. Experiments indicate that this method significantly reduces the EFSM state space to be explored and the number of non-executable symbolic test sequences to be generated. Since parameterized input events are allowed to occur in EFSM cycles, this method is suitable for testing the open reactive systems that interact with the environments via parameterized input events.
{"title":"Configuration-Oriented Symbolic Test Sequence Construction Method for EFSM","authors":"Shuhao Li, Ji Wang, Xin Wang, Zhichang Qi","doi":"10.1109/COMPSAC.2005.61","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.61","url":null,"abstract":"This paper presents a new approach to generating configuration-oriented executable symbolic test sequences from Extended Finite State Machine (EFSM) models. The information about the values of the context variables and the domain intervals of the input parameters are exploited to guide the derivation of the test sequences. Meanwhile, the transition guards along the test sequences are continually used to reduce the domain intervals of the input parameters. Experiments indicate that this method significantly reduces the EFSM state space to be explored and the number of non-executable symbolic test sequences to be generated. Since parameterized input events are allowed to occur in EFSM cycles, this method is suitable for testing the open reactive systems that interact with the environments via parameterized input events.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"36 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":"127125443","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}
Pub Date : 2005-07-26DOI: 10.1109/COMPSAC.2005.155
E. Teiniker, R. Lechner, Gernot Schmoelzer, Christian Kreiner, Z. Kovács, R. Weiss
Component based software engineering (CBSE) suggests the idea of applications as assemblies of prefabricated components. Practical experiences with the CORBA component model (CCM), which is a multi-language and multi-platform component architecture, have shown that pure syntax declarations are inadequate for describing trustworthy software components, in particular for reuse. In this paper we present a contract extension to the CCM metamodel, a contract aware CCM container that improves the trustworthiness of CORBA components and experimental results that explore the runtime impacts of contract verification.
{"title":"Towards a contract aware CORBA component container","authors":"E. Teiniker, R. Lechner, Gernot Schmoelzer, Christian Kreiner, Z. Kovács, R. Weiss","doi":"10.1109/COMPSAC.2005.155","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.155","url":null,"abstract":"Component based software engineering (CBSE) suggests the idea of applications as assemblies of prefabricated components. Practical experiences with the CORBA component model (CCM), which is a multi-language and multi-platform component architecture, have shown that pure syntax declarations are inadequate for describing trustworthy software components, in particular for reuse. In this paper we present a contract extension to the CCM metamodel, a contract aware CCM container that improves the trustworthiness of CORBA components and experimental results that explore the runtime impacts of contract verification.","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":"131040414","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}
XML is a language frequently used for data representation and interchange in Web-based applications. In most cases, the XML documents must conform to a schema that defines the type of data that is accepted by a Web application. In this sense, an error in the schema or in the XML document can lead to failures in the application; the use of testing approaches, criteria and specific tools to ensure the reliability of data in the XML format is fundamental. We present a testing approach that helps to reveal faults in XML schemas. The test process involves generating XML documents with some modifications with respect to the original XML document and using queries to these documents to validate the schema. The XML documents and queries are generated according to a set of fault classes defined for the XML schemas. A case study applying the proposed approach is described and the results are presented.
{"title":"A testing approach for XML schemas","authors":"M. C. F. P. Emer, S. Vergilio, M. Jino","doi":"10.1109/COMPSAC.2005.35","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.35","url":null,"abstract":"XML is a language frequently used for data representation and interchange in Web-based applications. In most cases, the XML documents must conform to a schema that defines the type of data that is accepted by a Web application. In this sense, an error in the schema or in the XML document can lead to failures in the application; the use of testing approaches, criteria and specific tools to ensure the reliability of data in the XML format is fundamental. We present a testing approach that helps to reveal faults in XML schemas. The test process involves generating XML documents with some modifications with respect to the original XML document and using queries to these documents to validate the schema. The XML documents and queries are generated according to a set of fault classes defined for the XML schemas. A case study applying the proposed approach is described and the results are presented.","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":"125540101","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}
This paper demonstrates our Web Service based N-Version model, WS-FTM (Web Service-Fault Tolerance Mechanism), which applies this well proven technique to the domain of Web Services to increase system dependability. WS-FTM achieves transparent usage of replicated Web Services by use of a modified stub. The stub is created using tools included in WS-FTM. Our initial implementation includes a simple consensus voter that allows generic result comparison. Finally we show, through the use of a non-trivial example, that WS-FTM can be used to increase the reliability of a Web Service system.
{"title":"Increasing Web Service Dependability Through Consensus Voting","authors":"N. Looker, M. Munro, Jie Xu","doi":"10.1109/COMPSAC.2005.88","DOIUrl":"https://doi.org/10.1109/COMPSAC.2005.88","url":null,"abstract":"This paper demonstrates our Web Service based N-Version model, WS-FTM (Web Service-Fault Tolerance Mechanism), which applies this well proven technique to the domain of Web Services to increase system dependability. WS-FTM achieves transparent usage of replicated Web Services by use of a modified stub. The stub is created using tools included in WS-FTM. Our initial implementation includes a simple consensus voter that allows generic result comparison. Finally we show, through the use of a non-trivial example, that WS-FTM can be used to increase the reliability of a Web Service system.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"39 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":"122258921","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
扫码关注我们
求助内容：
应助结果提醒方式：