One of the key challenges in modern real-time embedded systems is safe composition of different software components. Formal verification techniques provide the means for design-time analysis of these systems. This paper introduces an approach based on timed automata for analysis of such component-based real-time embedded systems. The goal of our research is to provide a method for treating the schedulability problem of such systems on multi-core platforms. Since the components are developed, analyzed and tested independent of each other, the impact of one component on the others does not depend on its internal structure. Therefore, we reduce the problem of proving the schedulability of the composed system to proving the schedulability of each component on the resource partition allocated to it based on the interface of the component. The proposed verification method is demonstrated on a H.264 decoder case study.
{"title":"Timed Automata Model for Component-Based Real-Time Systems","authors":"Georgiana Macariu, V. Cretu","doi":"10.1109/ECBS.2010.20","DOIUrl":"https://doi.org/10.1109/ECBS.2010.20","url":null,"abstract":"One of the key challenges in modern real-time embedded systems is safe composition of different software components. Formal verification techniques provide the means for design-time analysis of these systems. This paper introduces an approach based on timed automata for analysis of such component-based real-time embedded systems. The goal of our research is to provide a method for treating the schedulability problem of such systems on multi-core platforms. Since the components are developed, analyzed and tested independent of each other, the impact of one component on the others does not depend on its internal structure. Therefore, we reduce the problem of proving the schedulability of the composed system to proving the schedulability of each component on the resource partition allocated to it based on the interface of the component. The proposed verification method is demonstrated on a H.264 decoder case study.","PeriodicalId":356361,"journal":{"name":"2010 17th IEEE International Conference and Workshops on Engineering of Computer Based Systems","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116149600","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}
The growth of the Internet has dramatically changed the way information is accessed and managed. The Web contains an ever growing amount of distributed, semi-structured and uncontrolled data. In this new context, we should rethink how applications couple with DBMSs. Corporate intranets allowed a tiered coupling between applications and databases. However, that model is still too constrained, and unable to accommodate the hostility, unsafety and fast pace of the Web environment. Web Applications soon, if not already, will seek to dynamically negotiate their relationship to distributed database services. Prior to accomplishing autonomous application_to_DBMS binding and seamless data migration, we need to devise a "lingua franca" to request and describe DBMS and database services and capabilities. Database descriptors (DBDs) are a step towards this vision. This paper presents the motivation for DBDs, their structure and architecture, examples and a use case scenario.
{"title":"Database Descriptors: Laying the Path to Commodity Web Data Services","authors":"R. Senra, C. B. Medeiros","doi":"10.1109/ECBS.2010.57","DOIUrl":"https://doi.org/10.1109/ECBS.2010.57","url":null,"abstract":"The growth of the Internet has dramatically changed the way information is accessed and managed. The Web contains an ever growing amount of distributed, semi-structured and uncontrolled data. In this new context, we should rethink how applications couple with DBMSs. Corporate intranets allowed a tiered coupling between applications and databases. However, that model is still too constrained, and unable to accommodate the hostility, unsafety and fast pace of the Web environment. Web Applications soon, if not already, will seek to dynamically negotiate their relationship to distributed database services. Prior to accomplishing autonomous application_to_DBMS binding and seamless data migration, we need to devise a \"lingua franca\" to request and describe DBMS and database services and capabilities. Database descriptors (DBDs) are a step towards this vision. This paper presents the motivation for DBDs, their structure and architecture, examples and a use case scenario.","PeriodicalId":356361,"journal":{"name":"2010 17th IEEE International Conference and Workshops on Engineering of Computer Based Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130505451","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}
Qurat-ul-ann Farooq, Muhammad Zohaib Z. Iqbal, Z. I. Malik, Matthias Riebisch
Model-based selective regression testing promises reduction in cost and labour by selecting a subset of the test suite corresponding to the modifications after system evolution. However, identification of modifications in the systems and selection of corresponding test cases is challenging due to interdependencies among models. State-based testing is an important approach to test the system behaviour. Unfortunately the existing state-based regression testing approaches do not care for dependencies of the state machines with other system models. This paper presents the tool support and evaluation of our state-based selective regression testing methodology for evolving state-based systems. START is an Eclipse-based tool for state-based regression testing compliant with UML 2.1 semantics. START deals with dependencies of state machines with class diagrams to cater for the change propagation. We applied the START on a case study and our results show significant reduction in the test cases resulting in reduction in testing time and cost.
{"title":"A Model-Based Regression Testing Approach for Evolving Software Systems with Flexible Tool Support","authors":"Qurat-ul-ann Farooq, Muhammad Zohaib Z. Iqbal, Z. I. Malik, Matthias Riebisch","doi":"10.1109/ECBS.2010.12","DOIUrl":"https://doi.org/10.1109/ECBS.2010.12","url":null,"abstract":"Model-based selective regression testing promises reduction in cost and labour by selecting a subset of the test suite corresponding to the modifications after system evolution. However, identification of modifications in the systems and selection of corresponding test cases is challenging due to interdependencies among models. State-based testing is an important approach to test the system behaviour. Unfortunately the existing state-based regression testing approaches do not care for dependencies of the state machines with other system models. This paper presents the tool support and evaluation of our state-based selective regression testing methodology for evolving state-based systems. START is an Eclipse-based tool for state-based regression testing compliant with UML 2.1 semantics. START deals with dependencies of state machines with class diagrams to cater for the change propagation. We applied the START on a case study and our results show significant reduction in the test cases resulting in reduction in testing time and cost.","PeriodicalId":356361,"journal":{"name":"2010 17th IEEE International Conference and Workshops on Engineering of Computer Based Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125378214","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}
Simple, stateless networking protocols provide a low-cost and predictable foundation upon which to build decentralised applications. Sensornets are complex, containing emergent behaviour; identifying protocols offering appropriate behaviour may be difficult. In this paper we evaluate the relative performance of gossiping protocol variants in non-ideal sensornets. We examine the extent to which a "standard" gossiping protocol might be outperformed by variants of this standard, each specialised and optimised to mitigate anticipated problems. We categorise and measure the undesired behaviours that remain, as a foundation for future protocols which will address these specific issues.
{"title":"Do Sensornet Protocol Variants Yield Real Benefits?","authors":"Jonathan Tate, I. Bate","doi":"10.1109/ECBS.2010.10","DOIUrl":"https://doi.org/10.1109/ECBS.2010.10","url":null,"abstract":"Simple, stateless networking protocols provide a low-cost and predictable foundation upon which to build decentralised applications. Sensornets are complex, containing emergent behaviour; identifying protocols offering appropriate behaviour may be difficult. In this paper we evaluate the relative performance of gossiping protocol variants in non-ideal sensornets. We examine the extent to which a \"standard\" gossiping protocol might be outperformed by variants of this standard, each specialised and optimised to mitigate anticipated problems. We categorise and measure the undesired behaviours that remain, as a foundation for future protocols which will address these specific issues.","PeriodicalId":356361,"journal":{"name":"2010 17th IEEE International Conference and Workshops on Engineering of Computer Based Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126812107","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}
The complexity of software in embedded systems has increased significantly over the last years so that software verification now plays an important role in ensuring the overall product quality. In this context, bounded model checking has been successfully applied to discover subtle errors, but for larger applications, it often suffers from the state space explosion problem. This paper describes a new approach called continuous verification to detect design errors as quickly as possible by exploiting information from the software configuration management system and by combining dynamic and static verification to reduce the state space to be explored. We also give a set of encodings that provide accurate support for program verification and use different background theories in order to improve scalability and precision in a completely automatic way. A case study from the telecommunications domain shows that the proposed approach improves the error-detection capability and reduces the overall verification time by up to 50%.
{"title":"Continuous Verification of Large Embedded Software Using SMT-Based Bounded Model Checking","authors":"L. Cordeiro, B. Fischer, Joao Marques-Silva","doi":"10.1109/ECBS.2010.24","DOIUrl":"https://doi.org/10.1109/ECBS.2010.24","url":null,"abstract":"The complexity of software in embedded systems has increased significantly over the last years so that software verification now plays an important role in ensuring the overall product quality. In this context, bounded model checking has been successfully applied to discover subtle errors, but for larger applications, it often suffers from the state space explosion problem. This paper describes a new approach called continuous verification to detect design errors as quickly as possible by exploiting information from the software configuration management system and by combining dynamic and static verification to reduce the state space to be explored. We also give a set of encodings that provide accurate support for program verification and use different background theories in order to improve scalability and precision in a completely automatic way. A case study from the telecommunications domain shows that the proposed approach improves the error-detection capability and reduces the overall verification time by up to 50%.","PeriodicalId":356361,"journal":{"name":"2010 17th IEEE International Conference and Workshops on Engineering of Computer Based Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125058569","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
扫码关注我们
求助内容：
应助结果提醒方式：