检索结果-内蒙古大学图书馆

18th IEEE International Conference on Software Quality, Reliability, and Security (QRS)

作者： Siavashi, Faezeh Truscan, Dragos Vain, Juri Abo Akad Univ Dept Informat Technol Turku Finland Tallinn Univ Technol Dept Software Sci Tallinn Estonia

ISBN: (纸本)9781538677575

We present a model-based mutation testing approach, for evaluating the authentication and authorization of web services in a multi-user context. model of a web service and its security requirements are designed using UPPAAL Timed Automata. The model is mutated to create invalid behavior which is used for test generation to reveal faults in the system under test. The approach is supported by a model-based mutation testing tool, mu UTA, that automatically generates mutants, selects a collection of suitable mutants for testing and generates test cases from them. We modify a previously defined mutation operator and introduce three new operators for additional mutants. We define criteria for the mutation-selection and demonstrate the approach on a blog web service. Results show that the approach can discover authorization faults that were not detected by traditional methods.

关键词： model-based mutation testing Timed Automata mutation User Behavioral model UPPAAL Security testing

来源：评论

学校读者我要写书评

暂无评论

model-based mutation testing-Approach and case studies

引用

SCIENCE OF COMPUTER PROGRAMMING 2016年 120卷 25-48页

作者： Belli, Fevzi Budnik, Christof J. Hollmann, Axel Tuglular, Tugkan Wong, W. Eric Univ Paderborn Dept Comp Sci Elect Engn & Math Paderborn Germany Siemens Corp Corp Technol New York NY USA Andagon GmbH Cologne Germany Izmir Inst Technol Dept Comp Engn Izmir Turkey Univ Texas Dallas Dept Comp Sci Dallas TX 75230 USA

This paper rigorously introduces the concept of model-based mutation testing (MBMT) and positions it in the landscape of mutation testing. Two elementary mutation operators, insertion and omission, are exemplarily applied to a hierarchy of graph-based models of increasing expressive power including directed graphs, event sequence graphs, finite-state machines and statecharts. Test cases generated based on the mutated models (mutants) are used to determine not only whether each mutant can be killed but also whether there are any faults in the corresponding system under consideration (SUC) developed based on the original model. Novelties of our approach are: (1) evaluation of the fault detection capability (in terms of revealing faults in the SUC) of test sets generated based on the mutated models, and (2) superseding of the great variety of existing mutation operators by iterations and combinations of the two proposed elementary operators. Three case studies were conducted on industrial and commercial real-life systems to demonstrate the feasibility of using the proposed MBMT approach in detecting faults in SUC, and to analyze its characteristic features. Our experimental data suggest that test sets generated based on the mutated models created by insertion operators are more effective in revealing faults in SUC than those generated by omission operators. Worth noting is that test sets following the MBMT approach were able to detect faults in the systems that were tested by manufacturers and independent testing organizations before they were released. (C) 2016 Elsevier B.V. All rights reserved.

关键词： mutation testing model-based testing model-based mutation testing mutation operator Fault detection capability

来源：评论

学校读者我要写书评

暂无评论

Time for Networks: mutation testing for Timed Automata Networks 12

Time for Networks: Mutation Testing for Timed Automata Netwo...

引用

IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE)

作者： Cortes, David Ortiz, James Basile, Davide Aranda, Jesus Perrouin, Gilles Schobbens, Pierre-Yves Univ Valle Cali Colombia Inst Polytech Paris Telecom Paris LTCI Paris France CNR ISTI Pisa Italy Univ Namur PReCISE NaDI Namur Belgium

ISBN: (纸本)9798400705892

mutation testing (MT) is a technique employed to assess the efficacy of tests by introducing artificial faults, known as mutations, into the system. The goal is to evaluate how well the tests can detect these mutations. These artificial faults are generated using mutation operators, which produce a set of mutations derived from the original system. mutation operators and frameworks exist for a variety of programming languages, and model-based mutation testing is gaining traction, particularly for timed safety-critical systems. This paper focuses on extending MT to Networks of Timed Automata (NTAs), an area that has not been extensively explored. We introduce mutation operators designed for NTAs specified in UPPAAL, aiming to create temporal interaction faults. We assess the effectiveness of these operators on five UPPAAL NTAs sourced from the literature, specifically examining the generation of equivalent and duplicate mutants. Our results demonstrate a varied prevalence of equivalent mutants (from 12% to 71%) while the number of duplicates is less. In all cases, timed bisimulation was able to process each mutant pair in less than one second.

关键词： model-based mutation testing UPPAAL Bisimulation

来源：评论

学校读者我要写书评

暂无评论

Timed model-based mutation Operators for Simulink models

Timed Model-Based Mutation Operators for Simulink Models

引用

17th IEEE International Conference on Software testing, Verification, and Validation (ICST)

作者： Chen, Jian Alalfi, Manar H. Dean, Thomas R. Queens Univ Dept ECE Kingston ON Canada Toronto Metropolitan Univ Dept Comp Sci Toronto ON Canada

ISBN: (纸本)9798350344806;9798350344790

model-based mutation testing (MBMT) is a specialized area of model-based testing focused on generating faulty model versions to improve test cases. This paper introduces timed mutation operators for Matlab/Simulink (ML/SL) models, aimed at assessing tools that integrate a timed task model for enhanced support in model-in-the-Loop (MIL) simulation. We applied these mutation operators to evaluate SimSched, a tool that incorporates model transformation to integrate scheduling into the model for real-time context validation during simulation. Results indicate SimSched's superiority over the base-case Stateflow Scheduler in identifying time-related faults.

关键词： model-based mutation testing Simulink models Timed mutation operators

来源：评论

学校读者我要写书评

暂无评论

Mutant Equivalence as Monotonicity in Parametric Timed Games 11

Mutant Equivalence as Monotonicity in Parametric Timed Games

引用

IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE)

作者： Basile, Davide ter Beek, Maurice H. Goettmann, Hendrik Lochau, Malte CNR ISTI Pisa Italy Tech Univ Darmstadt Darmstadt Germany Univ Siegen Siegen Germany

ISBN: (纸本)9798350312638

The detection of faults in software systems can be enhanced effectively by model-based mutation testing. The efficiency of this technique is hindered when mutants are equivalent to the original system model, since this makes them useless. Recently, the application of model-based mutation testing to real-time systems modelled as timed games has been investigated, which has resulted in guidelines for statically avoiding equivalent mutants. In this paper, we recast this problem into the framework of parametric timed games. We then prove a correspondence between theoretical results for the detection of equivalent mutants in timed games and the property of monotonicity that is known to hold for a sub-class of parametric timed games called L/U parametric timed games. The presented results not only simplify the theory underlying the detection of equivalent mutants in timed games, but at the same time they improve the expressiveness of a known decidable fragment of parametric timed games for which monotonicity holds.

关键词： parametric timed games mutant equivalence model-based mutation testing

来源：评论

学校读者我要写书评

暂无评论

testing Web Services with model-based mutation 11th

Testing Web Services with Model-Based Mutation

引用

11th International Joint Conference on Software Technologies (ICSOFT-EA)

作者： Siavashi, Faezeh Iqbal, Junaid Truscan, Dragos Vain, Juri Abo Akad Univ Fac Sci & Engn Turku Finland Tallinn Univ Technol Dept Comp Sci Tallinn Estonia

ISBN: (纸本)9783319625690;9783319625683

One way of evaluating the robustness of a web service is to test it against invalid inputs. We introduce a model-based mutation technique which automatically generates faulty test inputs. From the specification of a Web service, a test model is designed using UPPAAL Timed Automata and the conformance between the model and the implementation is validated via online model-based testing with the UPPAAL TRON tool. A set of mutation operators is applied to the test model in order to generate mutant test models. We validate all generated mutants via verification rules and select those that are executable and introduce proper mutations. We employ bisimulation as a tool for detecting and eliminating equivalent mutants, that is those mutants which have identical input-output behavior with the original test model. The resulting mutants are used for online test generation against the service implementation in order to check whether the latter allows for unspecified behavior. We discuss tool support and present an experiment of applying our method for a case study of a blog web service with real-life properties. The experiment shows that the proposed approach of mutating the specifications is effective in detecting errors both in the system functionality and in the test model.

关键词： Web service model-based mutation testing UPPAAL TRON Bisimulation of UPPAAL Timed Automata

来源：评论

学校读者我要写书评

暂无评论

Require, test, and trace IT

引用

INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER 2017年第4期19卷 409-426页

作者： Aichernig, Bernhard K. Hoermaier, Klaus Lorber, Florian Nickovic, Dejan Tiran, Stefan Graz Univ Technol Graz Austria Infineon Technol Austria AG Villach Austria AIT Seibersdorf Austria

We propose a framework for requirement-driven test generation that combines contract-based interface theories with model-based testing. We design a specification language, requirement interfaces, for formalizing different views (aspects) of synchronous data-flow systems from informal requirements. Various views of a system, modeled as requirement interfaces, are naturally combined by conjunction. We develop an incremental test generation procedure with several advantages. The test generation is driven by a single requirement interface at a time. It follows that each test assesses a specific aspect or feature of the system, specified by its associated requirement interface. Since we do not explicitly compute the conjunction of all requirement interfaces of the system, we avoid state space explosion while generating tests. However, we incrementally complete a test for a specific feature with the constraints defined by other requirement interfaces. This allows catching violations of any other requirement during test execution, and not only of the one used to generate the test. This framework defines a natural association between informal requirements, their formal specifications, and the generated tests, thus facilitating traceability. Finally, we introduce a fault-based test-case generation technique, called model-based mutation testing, to requirement interfaces. It generates a test suite that covers a set of fault models, guaranteeing the detection of any corresponding faults in deterministic systems under test. We implemented a prototype test generation tool and demonstrate its applicability in two industrial use cases.

关键词： model-based testing Test-case generation Requirements engineering Traceability Requirement interfaces Formal specification Synchronous systems Consistency checking Incremental test-case generation model-based mutation testing

来源：评论

学校读者我要写书评

暂无评论

Bounded determinization of timed automata with silent transitions

引用

REAL-TIME SYSTEMS 2017年第3期53卷 291-326页

作者： Lorber, Florian Rosenmann, Amnon Nickovic, Dejan Aichernig, Bernhard K. AIT Austrian Inst Technol GmbH Vienna Austria AIT Austrian Inst Technol GmbH Ctr Digital Safety & Secur Vienna Austria Graz Univ Technol Inst Software Technol Graz Austria

Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfortunate since deterministic automata play a major role in model-based testing, observability and implementability. However, by bounding the length of the traces in the automaton, effective determinization becomes possible. We propose a novel procedure for bounded determinization of timed automata. The procedure unfolds the automata to bounded trees, removes all silent transitions and determinizes via disjunction of guards. The proposed algorithms are optimized to the bounded setting and thus are more efficient and can handle a larger class of timed automata than the general algorithms. We show how to apply the approach in a fault-based test-case generation method, called model-based mutation testing, that was previously restricted to deterministic timed automata. The approach is implemented in a prototype tool and evaluated on several scientific examples and one industrial case study. To our best knowledge, this is the first implementation of this type of procedure for timed automata.

关键词： Timed automata Determinization Silent transition removal Diagonal constraints Testcase generation model-based testing model-based mutation testing

来源：评论

学校读者我要写书评

暂无评论

Exploiting model Morphology for Event-based testing

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2015年第2期41卷 113-134页

作者： Belli, Fevzi Beyazit, Mutlu Univ Paderborn Dept Elect Engn & Informat Technol D-33098 Paderborn Germany Izmir Inst Technol Dept Comp Engn Izmir Turkey Yasar Univ Dept Comp Engn Izmir Turkey

model-based testing employs models for testing. model-based mutation testing (MBMT) additionally involves fault models, called mutants, by applying mutation operators to the original model. A problem encountered with MBMT is the elimination of equivalent mutants and multiple mutants modeling the same faults. Another problem is the need to compare a mutant to the original model for test generation. This paper proposes an event-based approach to MBMT that is not fixed on single events and a single model but rather operates on sequences of events of length k >= 1 and invokes a sequence of models that are derived from the original one by varying its morphology based on k. The approach employs formal grammars, related mutation operators, and algorithms to generate test cases, enabling the following: (1) the exclusion of equivalent mutants and multiple mutants;(2) the generation of a test case in linear time to kill a selected mutant without comparing it to the original model;(3) the analysis of morphologically different models enabling the systematic generation of mutants, thereby extending the set of fault models studied in related literature. Three case studies validate the approach and analyze its characteristics in comparison to random testing and another MBMT approach.

关键词： model-based mutation testing grammar-based testing (model) morphology mutant selection test generation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：