{"title":"Combinatorial Testing for VDM","authors":"P. Larsen, Kenneth Lausdahl, N. Battle","doi":"10.1109/SEFM.2010.32","DOIUrl":"https://doi.org/10.1109/SEFM.2010.32","url":null,"abstract":"Combinatorial testing in VDM involves the automatic generation and execution of a large collection of test cases derived from templates provided in the form of trace definitions added to a VDM specification. The main value of this is the rapid detection of run-time errors caused by forgotten preconditions as well as broken invariants and post-conditions. Trace definitions are defined as regular expressions describing possible sequences of operation calls, and are conceptually similar to UML sequence diagrams. In this paper we present a tool enabling test automation based on VDM traces, and explain how it is possible to reduce large collections of test cases in different ways. Its use is illustrated with a small case study.","PeriodicalId":211760,"journal":{"name":"2010 8th IEEE International Conference on Software Engineering and Formal Methods","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134327413","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":"Behavior Engineering - A Scalable Modeling and Analysis Method","authors":"D. Powell","doi":"10.1109/SEFM.2010.12","DOIUrl":"https://doi.org/10.1109/SEFM.2010.12","url":null,"abstract":"The impact of failing to develop a shared understanding of the requirements describing and constraining large, complex projects and programs with many, possibly distributed, stakeholders and suppliers is enormous. Traditional engineering methods provide little in the way of taming complexity when synthesising, analysing and communicating the requirements of such projects. The Behavior Engineering method, developed at Griffith University, and employed on a number of large, complex and nationally critical defence, aerospace, transport and government projects and programs addresses the problems of scale and complexity head on. The Behavior Engineering method is presented in this paper as an efficient and effective method for modeling, analysing, evaluating and communicating large requirements specifications comprising thousands of requirements as well as a method that facilitates the synthesis of requirements from operational scenarios. It is demonstrated through analysis of industry data, that Behavior Engineering facilitates the development and communication of a deep, accurate and holistic understanding of the system needs, significantly reducing the risk of failure to capture and preserve intent in the development of large and complex systems.","PeriodicalId":211760,"journal":{"name":"2010 8th IEEE International Conference on Software Engineering and Formal Methods","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130575734","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. Bersani, Luca Cavallaro, A. Frigeri, Matteo Pradella, M. Rossi
{"title":"SMT-based Verification of LTL Specification with Integer Constraints and its Application to Runtime Checking of Service Substitutability","authors":"M. Bersani, Luca Cavallaro, A. Frigeri, Matteo Pradella, M. Rossi","doi":"10.1109/SEFM.2010.37","DOIUrl":"https://doi.org/10.1109/SEFM.2010.37","url":null,"abstract":"An important problem that arises during the execution of service-based applications concerns the ability to determine whether a running service can be substituted with one with a different interface, for example if the former is no longer available. Standard Bounded Model Checking techniques can be used to perform this check, but they must be able to provide answers very quickly, lest the check hampers the operativeness of the application, instead of aiding it. The problem becomes even more complex when conversational services are considered, i.e., services that expose operations that have Input/Output data dependencies among them. In this paper we introduce a formal verification technique for an extension of Linear Temporal Logic that allows users to include in formulae constraints on integer variables. This technique applied to the substitutability problem for conversational services is shown to be considerably faster and with smaller memory footprint than existing ones.","PeriodicalId":211760,"journal":{"name":"2010 8th IEEE International Conference on Software Engineering and Formal Methods","volume":"35 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120932231","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}