This paper presents a practical path and context sensitive inter-procedural analysis method for detecting memory leaks in C programs. A novel memory object model and function summary system are used. Preliminary experiments show that the method is effective. Several memory leaks have been found in real programs including which and wget.
{"title":"Path and Context Sensitive Inter-procedural Memory Leak Detection","authors":"Zhongxing Xu, Jian Zhang","doi":"10.1109/QSIC.2008.12","DOIUrl":"https://doi.org/10.1109/QSIC.2008.12","url":null,"abstract":"This paper presents a practical path and context sensitive inter-procedural analysis method for detecting memory leaks in C programs. A novel memory object model and function summary system are used. Preliminary experiments show that the method is effective. Several memory leaks have been found in real programs including which and wget.","PeriodicalId":6446,"journal":{"name":"2008 The Eighth International Conference on Quality Software","volume":"1 1","pages":"412-420"},"PeriodicalIF":0.0,"publicationDate":"2008-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89582824","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}
Nowadays, designers resort to abstraction techniques to conquer the complexity of industrial embedded systems during the design process. However, due to the large semantic gap between the abstractions and the implementation, the designers often fails to apply the abstraction techniques. In this paper, an EIS-based (executable interface specification) approach is proposed for the embedded system design.The proposed approach starts with using interface state diagrams to specify system architectures. A set of rules is introduced to transfer these diagrams into an executable model (EIS model) consistently. By making use of simulation/verification techniques, many architectural design errors can be detected in the EIS model at an early design stage. In the end, the EIS model can be systematically transferred into an interpreted implementation or a compiled implementation based on the constraints of the embedded platform. In this way, the inconsistencies between the high-level abstractions and the implementation can largely be reduced.
{"title":"An Executable Interface Specification for Industrial Embedded System Design","authors":"Jinfeng Huang, J. Voeten, S. Wolfs, M. Coopmans","doi":"10.1109/QSIC.2008.28","DOIUrl":"https://doi.org/10.1109/QSIC.2008.28","url":null,"abstract":"Nowadays, designers resort to abstraction techniques to conquer the complexity of industrial embedded systems during the design process. However, due to the large semantic gap between the abstractions and the implementation, the designers often fails to apply the abstraction techniques. In this paper, an EIS-based (executable interface specification) approach is proposed for the embedded system design.The proposed approach starts with using interface state diagrams to specify system architectures. A set of rules is introduced to transfer these diagrams into an executable model (EIS model) consistently. By making use of simulation/verification techniques, many architectural design errors can be detected in the EIS model at an early design stage. In the end, the EIS model can be systematically transferred into an interpreted implementation or a compiled implementation based on the constraints of the embedded platform. In this way, the inconsistencies between the high-level abstractions and the implementation can largely be reduced.","PeriodicalId":6446,"journal":{"name":"2008 The Eighth International Conference on Quality Software","volume":"137 1","pages":"37-44"},"PeriodicalIF":0.0,"publicationDate":"2008-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74900340","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}
SAT-based bounded model checking has a high complexity in dealing with real-time systems. SMT solvers can generalize SAT solving by adding the ability to handle arithmetic and other decidable theories. With this advantage, if we use SMT in bounded model checking for real-time systems instead of SAT, the clocks can be represented as integer or real variables directly and clock constraints can be represented as linear arithmetic expressions. This makes the checking procedure more efficient. We use TCTL to specify the properties of real-time systems.
{"title":"SMT-Based Bounded Model Checking for Real-Time Systems (Short Paper)","authors":"Liang Xu","doi":"10.1109/QSIC.2008.10","DOIUrl":"https://doi.org/10.1109/QSIC.2008.10","url":null,"abstract":"SAT-based bounded model checking has a high complexity in dealing with real-time systems. SMT solvers can generalize SAT solving by adding the ability to handle arithmetic and other decidable theories. With this advantage, if we use SMT in bounded model checking for real-time systems instead of SAT, the clocks can be represented as integer or real variables directly and clock constraints can be represented as linear arithmetic expressions. This makes the checking procedure more efficient. We use TCTL to specify the properties of real-time systems.","PeriodicalId":6446,"journal":{"name":"2008 The Eighth International Conference on Quality Software","volume":"39 1","pages":"120-125"},"PeriodicalIF":0.0,"publicationDate":"2008-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90494419","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}
Unified Modeling Language (UML) is the standard notation technique used for modeling object-oriented (OO) systems. Previous efforts exist to extend UML for representing multi-agent systems (MAS). Due to the UML widespread, the resulting extensions are therefore easy to use and to adopt by software engineers. Unfortunately, most of these attempts are based on applying stereotypes for the object-oriented entities. However, heavyweight extension is a more adequate choice to handle different capabilities of the MAS over the OO systems. In this work a heavyweight extension to UML metamodel is proposed for modeling MAS according to our unified MAS conceptual model. It is not limited to a specific application domain or specific agent architecture. A proposed MAS-UML tool is built based on the extended metamodel.
{"title":"A UML Heavyweight Extension for MAS Modeling","authors":"M. Al-Kady, R. Bahgat, A. Fahmy","doi":"10.1109/QSIC.2008.15","DOIUrl":"https://doi.org/10.1109/QSIC.2008.15","url":null,"abstract":"Unified Modeling Language (UML) is the standard notation technique used for modeling object-oriented (OO) systems. Previous efforts exist to extend UML for representing multi-agent systems (MAS). Due to the UML widespread, the resulting extensions are therefore easy to use and to adopt by software engineers. Unfortunately, most of these attempts are based on applying stereotypes for the object-oriented entities. However, heavyweight extension is a more adequate choice to handle different capabilities of the MAS over the OO systems. In this work a heavyweight extension to UML metamodel is proposed for modeling MAS according to our unified MAS conceptual model. It is not limited to a specific application domain or specific agent architecture. A proposed MAS-UML tool is built based on the extended metamodel.","PeriodicalId":6446,"journal":{"name":"2008 The Eighth International Conference on Quality Software","volume":"54 1","pages":"435-440"},"PeriodicalIF":0.0,"publicationDate":"2008-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77392179","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}
In the field of software architecture, there has been a paradigm shift from describing the outcome of architecting process to documenting architectural knowledge (AK), such as design decisions and rationale. To this end, a series of domain models have been proposed for defining the concepts and their relationships in the field of AK. To a large extent, the merit of this new paradigm is derived by sharing and reusing AK across organizations, especially in geographically distributed contexts. However, the employment of different AK domain models by different parties makes effective AK sharing challenging, as it needs to be mapped either from one domain model to another directly, or indirectly through a central model for simplicity when the number of AK models increases. The indirect mapping approach has proved to be a cost-effective way by sacrificing acceptable sharing quality compared with direct mapping approach. However, there exist no criteria for the selection of a high quality central model besides the intuitive judgment by domain experts. In this paper, we propose to tackle this issue by using the concept of semantic distance between AK models, which is calculated using rules based on the concept mapping relationships between the models. A high quality central model is therefore the one with the shortest semantic distance to all potential AK models.
{"title":"Selecting a High-Quality Central Model for Sharing Architectural Knowledge","authors":"Peng Liang, A. Jansen, P. Avgeriou","doi":"10.1109/QSIC.2008.20","DOIUrl":"https://doi.org/10.1109/QSIC.2008.20","url":null,"abstract":"In the field of software architecture, there has been a paradigm shift from describing the outcome of architecting process to documenting architectural knowledge (AK), such as design decisions and rationale. To this end, a series of domain models have been proposed for defining the concepts and their relationships in the field of AK. To a large extent, the merit of this new paradigm is derived by sharing and reusing AK across organizations, especially in geographically distributed contexts. However, the employment of different AK domain models by different parties makes effective AK sharing challenging, as it needs to be mapped either from one domain model to another directly, or indirectly through a central model for simplicity when the number of AK models increases. The indirect mapping approach has proved to be a cost-effective way by sacrificing acceptable sharing quality compared with direct mapping approach. However, there exist no criteria for the selection of a high quality central model besides the intuitive judgment by domain experts. In this paper, we propose to tackle this issue by using the concept of semantic distance between AK models, which is calculated using rules based on the concept mapping relationships between the models. A high quality central model is therefore the one with the shortest semantic distance to all potential AK models.","PeriodicalId":6446,"journal":{"name":"2008 The Eighth International Conference on Quality Software","volume":"36 1","pages":"357-365"},"PeriodicalIF":0.0,"publicationDate":"2008-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81497232","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}
Software testing [1] consumes at least 50% of labor and its cost approximates 50-70% of software cost which it may cause software delay. To date, web service is a popular way of implementing a Service-Oriented Architecture (SOA), which has gained rapid adoption and support from leading companies in industry [2]. Most of researches, test case is generated from web service description only based on black box testing which its limitation is a large number of generated test cases. This paper proposes a methodology to generate web service test case based on decision table. The generated test case corresponds to web service's requirement and web service description which are defined in WSDL-S and SWRL.
{"title":"Web Service Test Case Generation Based on Decision Table (Short Paper)","authors":"Siripol Noikajana, T. Suwannasart","doi":"10.1109/QSIC.2008.7","DOIUrl":"https://doi.org/10.1109/QSIC.2008.7","url":null,"abstract":"Software testing [1] consumes at least 50% of labor and its cost approximates 50-70% of software cost which it may cause software delay. To date, web service is a popular way of implementing a Service-Oriented Architecture (SOA), which has gained rapid adoption and support from leading companies in industry [2]. Most of researches, test case is generated from web service description only based on black box testing which its limitation is a large number of generated test cases. This paper proposes a methodology to generate web service test case based on decision table. The generated test case corresponds to web service's requirement and web service description which are defined in WSDL-S and SWRL.","PeriodicalId":6446,"journal":{"name":"2008 The Eighth International Conference on Quality Software","volume":"35 1","pages":"321-326"},"PeriodicalIF":0.0,"publicationDate":"2008-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74732149","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}
It is important to test software with respect to user requirements, especially when adhering to safety standards, which require traceability from requirements to test cases. While research has resulted in many different model based testing techniques, only a few consider requirement properties; this paper helps fill this gap. We identify two fundamental characteristics of a test case intended to evaluate a given requirement property. The two characteristics are adapted from the venerable Reachability, Infection, and Propagation (RIP) model for faults and failures in ordinary code. In the context of requirements testing, we propose the reachability property amounts to the property not being vacuously true on a given test case, and the propagation property amounts to a potential violation of the property on the test case being observable. In particular, we formalize these notions in the context of requirement properties expressed in linear temporal logic (LTL), and not only show how to determine reachability and propagation for given test cases, but also how to modify test cases to satisfy these properties. To demonstrate the importance of reachability and propagation we evaluate test sets for a small real-life application generated according to previously published test criteria.
{"title":"Reachability and Propagation for LTL Requirements Testing","authors":"G. Fraser, P. Ammann","doi":"10.1109/QSIC.2008.21","DOIUrl":"https://doi.org/10.1109/QSIC.2008.21","url":null,"abstract":"It is important to test software with respect to user requirements, especially when adhering to safety standards, which require traceability from requirements to test cases. While research has resulted in many different model based testing techniques, only a few consider requirement properties; this paper helps fill this gap. We identify two fundamental characteristics of a test case intended to evaluate a given requirement property. The two characteristics are adapted from the venerable Reachability, Infection, and Propagation (RIP) model for faults and failures in ordinary code. In the context of requirements testing, we propose the reachability property amounts to the property not being vacuously true on a given test case, and the propagation property amounts to a potential violation of the property on the test case being observable. In particular, we formalize these notions in the context of requirement properties expressed in linear temporal logic (LTL), and not only show how to determine reachability and propagation for given test cases, but also how to modify test cases to satisfy these properties. To demonstrate the importance of reachability and propagation we evaluate test sets for a small real-life application generated according to previously published test criteria.","PeriodicalId":6446,"journal":{"name":"2008 The Eighth International Conference on Quality Software","volume":"40 1","pages":"189-198"},"PeriodicalIF":0.0,"publicationDate":"2008-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74908739","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}
Monitoring the execution of large enterprise systems is needed to ensure that such complex systems are performing as expected. However, common techniques for monitoring, such as code instrumentation and profiling have significant performance overhead, and require access to the source code and to system experts. In this paper, we propose using execution logs to monitor the execution of applications. Unfortunately, execution logs are not designed for monitoring purposes. Each occurrence of an execution event results in a different log line, since a log line contains dynamic information which varies for each occurrence of the event. We propose an approach which abstracts log lines to a set of execution events. Our approach can handle log lines without having strict requirements on the format of a log line. Through a case study on a large enterprise application, we demonstrate that our approach performs well when abstracting execution logs for large enterprise applications. We compare our approach against the SLCT tool which is commonly used to find line patterns in logs.
{"title":"Abstracting Execution Logs to Execution Events for Enterprise Applications (Short Paper)","authors":"Z. Jiang, A. Hassan, P. Flora, Gilbert Hamann","doi":"10.1109/QSIC.2008.50","DOIUrl":"https://doi.org/10.1109/QSIC.2008.50","url":null,"abstract":"Monitoring the execution of large enterprise systems is needed to ensure that such complex systems are performing as expected. However, common techniques for monitoring, such as code instrumentation and profiling have significant performance overhead, and require access to the source code and to system experts. In this paper, we propose using execution logs to monitor the execution of applications. Unfortunately, execution logs are not designed for monitoring purposes. Each occurrence of an execution event results in a different log line, since a log line contains dynamic information which varies for each occurrence of the event. We propose an approach which abstracts log lines to a set of execution events. Our approach can handle log lines without having strict requirements on the format of a log line. Through a case study on a large enterprise application, we demonstrate that our approach performs well when abstracting execution logs for large enterprise applications. We compare our approach against the SLCT tool which is commonly used to find line patterns in logs.","PeriodicalId":6446,"journal":{"name":"2008 The Eighth International Conference on Quality Software","volume":"76 6 1","pages":"181-186"},"PeriodicalIF":0.0,"publicationDate":"2008-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89229800","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}
If, as a well-known aphorism states, modelling is for reasoning, this paper is an attempt to define and apply a formal semantics to UML sequence diagrams in order to enable rigourous reasoning about them. Actually, model transformation plays a fundamental role in the process of software development, in general, and in model driven engineering in particular. Being a de facto standard in this area, UML is no exception, even if the number and diversity of diagrams expressing UML models makes it difficult to base its semantics on a single framework. This paper builds on previous attempts to base UML semantics in a coalgebraic setting and illustrates the application of the proposed framework to reason about composition and re factoring of sequence diagrams.
{"title":"A Coalgebraic Semantic Framework for Reasoning about UML Sequence Diagrams","authors":"S. Meng, L. Barbosa","doi":"10.1109/QSIC.2008.13","DOIUrl":"https://doi.org/10.1109/QSIC.2008.13","url":null,"abstract":"If, as a well-known aphorism states, modelling is for reasoning, this paper is an attempt to define and apply a formal semantics to UML sequence diagrams in order to enable rigourous reasoning about them. Actually, model transformation plays a fundamental role in the process of software development, in general, and in model driven engineering in particular. Being a de facto standard in this area, UML is no exception, even if the number and diversity of diagrams expressing UML models makes it difficult to base its semantics on a single framework. This paper builds on previous attempts to base UML semantics in a coalgebraic setting and illustrates the application of the proposed framework to reason about composition and re factoring of sequence diagrams.","PeriodicalId":6446,"journal":{"name":"2008 The Eighth International Conference on Quality Software","volume":"9 1","pages":"17-26"},"PeriodicalIF":0.0,"publicationDate":"2008-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84643751","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}
With the growing advent of object-oriented and component-based software development paradigms, architecture-based software reliability analysis has emerged as an attractive alternative to the conventional black-box analysis based on software reliability growth models. The primary advantage of the architecture-based approach is that it explicitly relates the application reliability to component reliabilities, which eases the identification of components that are critical from a reliability perspective. Furthermore, these techniques can be used for an early assessment of the application reliability. These two features together can provide valuable information to practitioners and architects who design software applications, and managers who plan the allocation of resources to achieve the desired reliability targets in a cost effective manner.The objective of this tutorial is to discuss techniques to assess the reliability of a software application taking into consideration its architecture and the failure behavior of its components. The tutorial will also present how the architecture-based approach could be used to analyze the sensitivity of the application reliability to component and architectural parameters and to compute the importance measures of the application components. We will demonstrate the potential of the techniques presented in the tutorial through a case study of the IP multimedia subsystem (IMS).
{"title":"Architecture-Based Assessment of Software Reliability","authors":"S. Gokhale, V. Mendiratta","doi":"10.1109/QSIC.2008.57","DOIUrl":"https://doi.org/10.1109/QSIC.2008.57","url":null,"abstract":"With the growing advent of object-oriented and component-based software development paradigms, architecture-based software reliability analysis has emerged as an attractive alternative to the conventional black-box analysis based on software reliability growth models. The primary advantage of the architecture-based approach is that it explicitly relates the application reliability to component reliabilities, which eases the identification of components that are critical from a reliability perspective. Furthermore, these techniques can be used for an early assessment of the application reliability. These two features together can provide valuable information to practitioners and architects who design software applications, and managers who plan the allocation of resources to achieve the desired reliability targets in a cost effective manner.The objective of this tutorial is to discuss techniques to assess the reliability of a software application taking into consideration its architecture and the failure behavior of its components. The tutorial will also present how the architecture-based approach could be used to analyze the sensitivity of the application reliability to component and architectural parameters and to compute the importance measures of the application components. We will demonstrate the potential of the techniques presented in the tutorial through a case study of the IP multimedia subsystem (IMS).","PeriodicalId":6446,"journal":{"name":"2008 The Eighth International Conference on Quality Software","volume":"8 1","pages":"444-444"},"PeriodicalIF":0.0,"publicationDate":"2008-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90328980","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
扫码关注我们
求助内容：
应助结果提醒方式：