Integration of Formal Methods and Testing for Model-Based Systems Engineering NII Shonan Meeting, Japan, Nov. 30 Dec. 4, 2014

Similar documents
Efficient Algorithms for Test Sequence Selection. (Extended Abstract)

FSM Based Interoperability Testing Methods for Multi Stimuli Model

A guided incremental test case generation procedure for conformance testing for CEFSM specified protocols 1

On Code Coverage of Extended FSM Based Test Suites: An Initial Assessment

On Code Coverage of Extended FSM Based Test Suites: An Initial Assessment

Towards Compositional Testing of Real-Time Systems

By: Chaitanya Settaluri Devendra Kalia

Introduction to Embedded Systems

The paper provides an inventory of various fault models used for speciæcationbased hardware and software testing. Various types of speciæcations are c

Formal Modeling of Testing Software for Cyber-Physical Automation Systems

Software Testing IV. Prof. Dr. Holger Schlingloff. Humboldt-Universität zu Berlin

EE249 Discussion Petri Nets: Properties, Analysis and Applications - T. Murata. Chang-Ching Wu 10/9/2007

COMPOSITIONAL TESTING FOR FSM-BASED

Implementing MSC Tests with Quiescence Observation

From Scenarios to Test Implementations via Promela

Solving Parallel Equations with BALM-II

Engineering of computer networking protocols : an historical perspective

Design for testability: a step-wise approach to protocol testing

MVSIS v1.1 Manual. Jie-Hong Jiang, Yunjian Jiang, Yinghua Li, Alan Mishchenko*, Subarna Sinha Tiziano Villa**, Robert Brayton

Enabling statistical testing for component-based systems

Implementation of Lexical Analysis

A Formalization of Global Simulation Models for Continuous/Discrete Systems

Evaluation of test coverage for embedded system testing

Model checking Timber program. Paweł Pietrzak

MBT 2007 Third Workshop on Model-Based Testing

Leveraging Formal Verification Throughout the Entire Design Cycle

Extended Finite State Machine based Test Derivation Strategies for Telecommunication Protocols

Reverse Engineering Models from Traces to Validate Distributed Systems An Industrial Case Study

On Source Code Optimization for Interpreted Languages using State Models

Overview Graph Coverage Criteria

V&V: Model-based testing

Implementation of Lexical Analysis

Implementation of Lexical Analysis

A scenario-based test approach for testing reactive concurrent systems

Automated Refinement Checking of Asynchronous Processes. Rajeev Alur. University of Pennsylvania

Monitoring Interfaces for Faults

Introduction to Software Testing Chapter 2, Sec#: 2.5 Graph Coverage for Specifications

Issues in Testing Electronic Commerce Systems

Model inference to support detection of vulnerabilities

Binary Decision Diagrams and Symbolic Model Checking

Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis

Computing Delay with Coupling Using Timed Automata

Self Stabilization. CS553 Distributed Algorithms Prof. Ajay Kshemkalyani. by Islam Ismailov & Mohamed M. Ali

Promela and SPIN. Mads Dam Dept. Microelectronics and Information Technology Royal Institute of Technology, KTH. Promela and SPIN

Lexical Analysis. Implementation: Finite Automata

Fault Detection of Reachability Testing with Game Theoretic Approach

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

Resource-bound process algebras for Schedulability and Performance Analysis of Real-Time and Embedded Systems

Model-based Analysis of Event-driven Distributed Real-time Embedded Systems

Functional Test Generation for Delay Faults in Combinational Circuits

Automatic synthesis of switching controllers for linear hybrid systems: Reachability control

Implementation of Lexical Analysis

Implementation of Lexical Analysis

Introduction to Software Testing Chapter 2, Sections: 2.1 & 2.2 Overview Graph Coverage Criteria

Qualification of Verification Environments Using Formal Techniques

A Methodology for Constraint-Driven Synthesis of On-Chip Communications

Kernel Korner AEM: A Scalable and Native Event Mechanism for Linux

Xuandong Li. BACH: Path-oriented Reachability Checker of Linear Hybrid Automata

Verification Finite-state process modeling and reachability analysis

Don t Cares and Multi-Valued Logic Network Minimization

Composition of State Machines

Reset and Initialization, the Good, the Bad and the Ugly

A Toolbox for Counter-Example Analysis and Optimization

Lazy Group Sifting for Efficient Symbolic State Traversal of FSMs

LOGIC SYNTHESIS AND VERIFICATION ALGORITHMS. Gary D. Hachtel University of Colorado. Fabio Somenzi University of Colorado.

Lecture 9: Reachability

Incremental Methods for FSM Traversal

CS505: Distributed Systems

Separation of Transitions, Actions, and Exceptions in Model-based Testing

Computational problems. Lecture 2: Combinatorial search and optimisation problems. Computational problems. Examples. Example

EXPRESSING REQUIREMENTS IN MODELICA

4/6/2011. Model Checking. Encoding test specifications. Model Checking. Encoding test specifications. Model Checking CS 4271

Automatic test generation based on functional coverage

Observability and Controllability Issues in Conformance Testing of Web Service Compositions

A Test Case Generation Algorithm for Real-Time Systems

Test-Case Generation and Coverage Analysis for Nondeterministic Systems Using Model-Checkers

Research Collection. Formal background and algorithms. Other Conference Item. ETH Library. Author(s): Biere, Armin. Publication Date: 2001

Logic Coverage. Moonzoo Kim School of Computing KAIST. The original slides are taken from Chap. 8 of Intro. to SW Testing 2 nd ed by Ammann and Offutt

A New Optimal State Assignment Technique for Partial Scan Designs

ECE 587 Hardware/Software Co-Design Lecture 11 Verification I

Using Finite State Machine at the Testing of Network Protocols

Model Checking for Hybrid Systems

Test suite minimization for testing in context

SystemVerilog Essentials Simulation & Synthesis

Lexical Analysis. Chapter 2

A test case generation approach for conformance testing of SDL systems 1

Observability and Controllability Issues in Conformance Testing of Web Service Compositions

Computer Science Technical Report

Knowledge-based Systems for Industrial Applications

An Eclipse Plug-in for Model Checking

Automatic Testing with Formal Methods

6.852 Lecture 17. Atomic objects Reading: Chapter 13 Next lecture: Atomic snapshot, read/write register

Chapter 4. Capturing the Requirements. 4th Edition. Shari L. Pfleeger Joanne M. Atlee

T Reactive Systems: Kripke Structures and Automata

Areas related to SW verif. Trends in Software Validation. Your Expertise. Research Trends High level. Research Trends - Ex 2. Research Trends Ex 1

Subsystem Hazard Analysis (SSHA)

A Test Sequence Generation Method Based on Dependencies and Slices Jin-peng MO *, Jun-yi LI and Jian-wen HUANG

XEVE, an ESTEREL Verification Environment

L04. Model-based Testing: Principles Henry Muccini. Dipartimento di Informatica, Universityof L Aquila

Implicit vs. Explicit Data-Flow Requirements in Web Service Composition Goals

Transcription:

Alexandre Petrenko Lead Researcher Computer Research Institute of Montreal CRIM, Canada Curiosity driven and industrial research: FranceTelecom, Siemens, Bombardier, SAP, CAE, Ericsson, GM Integration of Formal Methods and Testing for Model-Based Systems Engineering NII Shonan Meeting, Japan, Nov. 30 Dec. 4, 2014

Requirement-based Modelling and Verification A requirement that cannot be tested is not a requirement (a company in automotive industry) Requirements are used to define test purposes and/or scenarios (sequence diagrams) for test generation Consistency of the obtained scenarios needs to be verified before tests are generated Generating Asynchronous Test Cases from Test Purposes, Information and Software Technology, 2011 From Scenarios to Test Implementations via Promela, ICTSS 2010 Implementing MSC Tests with Quiescence Observation, TESTCOM 2009 2

Fault-based Modelling and Testing Fault model is <Spec, Set-of-Imp, Conf-Rel> where Spec and Imp are FSM, EFSM, or IOTS; Set-of-Imp is a subset of the universe of them, explicitly or implicitly specified Generating Complete and Finite Test Suite for ioco: Is It Possible?, MBT 2014 Fault Coverage-Driven Incremental Test Generation, The Computer Journal, 2010 Testing from Partial Deterministic FSM Specifications, IEEE TC, 2005 Confirming Configurations in EFSM Testing, IEEE TSE, 2004 Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography, MOVEP, 2000 Test Generation Driven by User-defined Fault Models, IWTCS'99 Test Suite Generation for a FSM with a Given Type of Implementation Errors, PSTV, 1992 3

Compositional Approaches to Testing (I) Compositional testing is to test components in a system containing COTS which include queues The approach by composing components tested in isolation fails for communications via queues Integration Testing of Communicating Systems with Unknown Components, Annals of Telecom., Springer, 2014 Transition Covering Tests for Systems with Queues, Software Testing, Verification and Reliability, 2009 Test Generation for CEFSM Combining Specification and Fault Coverage, TestCom, 2002 Testing Strategies for Communicating FSMs, IWPTS, 1994 4

Compositional Approaches to Testing (II) Given a global model Spec of a system composed of component(s) to test and the rest of the system, Context, the model of component(s) to test is a largest solution Context Spec to the equation Context X = Spec The solution is nondeterministic, modelling component(s) to test; even if they are perfectly deterministic The Unknown Component Problem: Theory and Applications, (Villa, T., Yevtushenko, N., Brayton, R. K., Mishchenko, A., Petrenko, A., Sangiovanni- Vincentelli A. L.), Springer, 2012 Testing in Context and Synthesis of the Unknown Component: Two Faces of the Same Coin, IEEE/ACM IWLS, 2009 Solving Asynchronous Equations, FORTE, 1998 Testing in Context: Framework and Test Derivation, Computer Communications, 1996 5

Learning Approaches to Testing Learning without the Teacher answering your queries YES/NO is inference, isn't? Test suite is complete for a given fault model iff only Spec can be inferred from the test suite Inferring Approximated Models for Systems Engineering, IEEE HASE, 2014 Checking Completeness of Tests for Finite State Machines, IEEE TC, 2010 Inferring Behavioral Models from Traces of Business Applications, IEEE Web Services, 2009 Modular System Verification by Inference, Testing and Reachability Analysis, TESTCOM 2008 On Fault Coverage of Tests for Finite State Specifications, Computer Networks and ISDN Systems, 1996 6

Adding to Technology Vectors Interactive tools for test development Combining model and code-based testing 7