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

Size: px
Start display at page:

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

Transcription

1 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

2 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

3 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,

4 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,

5 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,

6 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,

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

Efficient Algorithms for Test Sequence Selection. (Extended Abstract)

Efficient Algorithms for Test Sequence Selection. (Extended Abstract) Efficient Algorithms for Test Sequence Selection (Extended Abstract) David Lee and Ruibing Hao Bell Labs Research China, Beijing, China Abstract:We study the test sequence selection problem. Given a large

More information

FSM Based Interoperability Testing Methods for Multi Stimuli Model

FSM Based Interoperability Testing Methods for Multi Stimuli Model FSM Based Interoperability Testing Methods for Multi Stimuli Model Khaled El-Fakih 1, Vadim Trenkaev 2, Natalia Spitsyna 2, Nina Yevtushenko 2 1 American University of Sharjah, PO Box 26666, Sharjah, United

More information

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

A guided incremental test case generation procedure for conformance testing for CEFSM specified protocols 1 1 A guided incremental test case generation procedure for conformance testing for CEFSM specified protocols 1 C. Bourhfir 2, R. Dssouli 2, E. Aboulhamid 2, N. Rico 3 2 Département d Informatique et de

More information

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

On Code Coverage of Extended FSM Based Test Suites: An Initial Assessment On Code Coverage of Extended FSM Based Test Suites: An Initial Assessment Khaled El-Fakih 1, Tariq Salameh 1, and Nina Yevtushenko 2 1 American University of Sharjah, Sharjah, UAE {Kelfakih,b00046306}@aus.edu

More information

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

On Code Coverage of Extended FSM Based Test Suites: An Initial Assessment On Code Coverage of Extended FSM Based Test Suites: An Initial Assessment Khaled El-Fakih, Tariq Salameh, Nina Yevtushenko To cite this version: Khaled El-Fakih, Tariq Salameh, Nina Yevtushenko. On Code

More information

Towards Compositional Testing of Real-Time Systems

Towards Compositional Testing of Real-Time Systems Towards Compositional Testing of Real-Time Systems Kim G Larsen, Axel Legay, Marius Mikucionis, Brian Nielsen, Ulrik Nyman Aalborg University, DENMARK Compositional Testing Integration of fully conformant

More information

By: Chaitanya Settaluri Devendra Kalia

By: Chaitanya Settaluri Devendra Kalia By: Chaitanya Settaluri Devendra Kalia What is an embedded system? An embedded system Uses a controller to perform some function Is not perceived as a computer Software is used for features and flexibility

More information

Introduction to Embedded Systems

Introduction to Embedded Systems Introduction to Embedded Systems Sanjit A. Seshia UC Berkeley EECS 149/249A Fall 2015 2008-2015: E. A. Lee, A. L. Sangiovanni-Vincentelli, S. A. Seshia. All rights reserved. Chapter 3: Discrete Dynamics,

More information

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

The paper provides an inventory of various fault models used for speciæcationbased hardware and software testing. Various types of speciæcations are c Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography Alexandre Petrenko Centre de Recherche Informatique de Montreal ècrimè, 550 Sherbrooke West, Suite 100, Montreal, H3A

More information

Formal Modeling of Testing Software for Cyber-Physical Automation Systems

Formal Modeling of Testing Software for Cyber-Physical Automation Systems Formal Modeling of Testing Software for Cyber-Physical Automation Systems Igor Buzhinsky, Cheng Pang, Valeriy Vyatkin Computer Technologies Laboratory, ITMO University, St. Petersburg, Russia Department

More information

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

Software Testing IV. Prof. Dr. Holger Schlingloff. Humboldt-Universität zu Berlin Software Testing IV Prof. Dr. Holger Schlingloff Humboldt-Universität zu Berlin and Fraunhofer Institute of Computer Architecture and Software Technology FIRST Outline of this Lecture Series 2006/11/24:

More information

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

EE249 Discussion Petri Nets: Properties, Analysis and Applications - T. Murata. Chang-Ching Wu 10/9/2007 EE249 Discussion Petri Nets: Properties, Analysis and Applications - T. Murata Chang-Ching Wu 10/9/2007 What are Petri Nets A graphical & modeling tool. Describe systems that are concurrent, asynchronous,

More information

COMPOSITIONAL TESTING FOR FSM-BASED

COMPOSITIONAL TESTING FOR FSM-BASED COMPOSITIONAL TESTING FOR FSM-BASED MODELS Bilal Kanso 1 and Omar Chebaro 2 1 Ecole Centrale Paris,Laboratoire de Mathématiques Appliquées aux Systèmes (MAS), Grande Voie des Vignes F-92295 Châtenay-Malabry,

More information

Implementing MSC Tests with Quiescence Observation

Implementing MSC Tests with Quiescence Observation Implementing MSC Tests with Quiescence Observation Sergiy Boroday 1, Alexandre Petrenk, Andreas Ulrich 2 1 Centre de recherche informatique de Montreal (CRIM), 550 Sherbrooke West, Suite 100 Montreal,

More information

From Scenarios to Test Implementations via Promela

From Scenarios to Test Implementations via Promela From Scenarios to Test Implementations via Promela Andreas Ulrich 1, El-Hachemi Alikacem 2, Hesham H. Hallal 3, Sergiy Boroday 2 1 Siemens AG, Corporate Technology, Munich, Germany andreas.ulrich@siemens.com

More information

Solving Parallel Equations with BALM-II

Solving Parallel Equations with BALM-II Solving Parallel Equations with BALM-II G. Castagnetti M. Piccolo T. Villa N. Yevtushenko A. Mishchenko Robert K. Brayton Electrical Engineering and Computer Sciences University of California at Berkeley

More information

Engineering of computer networking protocols : an historical perspective

Engineering of computer networking protocols : an historical perspective Engineering of computer networking protocols : an historical perspective Gregor v. Bochmann University of Ottawa with thanks to Colin West and Dave Rayner http://www.site.uottawa.ca/~bochmann/talks/history.ppt

More information

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

Design for testability: a step-wise approach to protocol testing Proc. 10th Int. Workshop on Testing of Communicating Systems (IWTCS 97), Seoul, Sept. 1997, Chapman & Hall, pp. 125-140. Design for testability: a step-wise approach to protocol testing Hartmut König a,

More information

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

MVSIS v1.1 Manual. Jie-Hong Jiang, Yunjian Jiang, Yinghua Li, Alan Mishchenko*, Subarna Sinha Tiziano Villa**, Robert Brayton MVSIS v1.1 Manual Jie-Hong Jiang, Yunjian Jiang, Yinghua Li, Alan Mishchenko*, Subarna Sinha Tiziano Villa**, Robert Brayton Department of Electrical Engineering and Computer Sciences University of California,

More information

Enabling statistical testing for component-based systems

Enabling statistical testing for component-based systems Enabling statistical testing for component-based systems Thomas Bauer, Robert Eschbach Fraunhofer-Institut für Experimentelles Software Engineering IESE Fraunhofer Platz 1 67663 Kaiserslautern, Germany

More information

Implementation of Lexical Analysis

Implementation of Lexical Analysis Implementation of Lexical Analysis Lecture 4 (Modified by Professor Vijay Ganesh) Tips on Building Large Systems KISS (Keep It Simple, Stupid!) Don t optimize prematurely Design systems that can be tested

More information

A Formalization of Global Simulation Models for Continuous/Discrete Systems

A Formalization of Global Simulation Models for Continuous/Discrete Systems A Formalization of Global Simulation Models for Continuous/Discrete Systems L. Gheorghe, F. Bouchhima, G. Nicolescu, H. Boucheneb Ecole Polytechnique Montréal luiza.gheorghe@polymtl.ca Keywords: Co-Simulation,

More information

Evaluation of test coverage for embedded system testing

Evaluation of test coverage for embedded system testing Evaluation of test coverage for embedded system testing Jinsong Zhu, Son T. Vuong Department of Computer Science University of British Columbia Vancouver, B.C., Canada V6T lz4 Samuel T. Chanson Department

More information

Model checking Timber program. Paweł Pietrzak

Model checking Timber program. Paweł Pietrzak Model checking Timber program Paweł Pietrzak 1 Outline Background on model checking (spam?) The SPIN model checker An exercise in SPIN - model checking Timber Deriving finite models from Timber programs

More information

MBT 2007 Third Workshop on Model-Based Testing

MBT 2007 Third Workshop on Model-Based Testing MBT 2007 Third Workshop on Model-Based Testing March 31 - April 1, 2007 Braga, Portugal Satellite workshop of ETAPS 2007 Organizers Bernd Finkbeiner, Yuri Gurevich, and Alexander K. Petrenko Preface This

More information

Leveraging Formal Verification Throughout the Entire Design Cycle

Leveraging Formal Verification Throughout the Entire Design Cycle Leveraging Formal Verification Throughout the Entire Design Cycle Verification Futures Page 1 2012, Jasper Design Automation Objectives for This Presentation Highlight several areas where formal verification

More information

Extended Finite State Machine based Test Derivation Strategies for Telecommunication Protocols

Extended Finite State Machine based Test Derivation Strategies for Telecommunication Protocols Extended Finite State Machine based Test Derivation Strategies for Telecommunication Protocols Natalia Kushik TELECOM SudParis Evry, France Email: ngkushik@gmail.com Anton Kolomeez Email: anton.kolomeets@gmail.com

More information

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

Reverse Engineering Models from Traces to Validate Distributed Systems An Industrial Case Study Reverse Engineering Models from Traces to Validate Distributed Systems An Industrial Case Study Andreas Ulrich 1 and Alexandre Petrenko 2 1 Siemens AG, Corporate Research & Technologies CT SE 1 Otto-Hahn-Ring

More information

On Source Code Optimization for Interpreted Languages using State Models

On Source Code Optimization for Interpreted Languages using State Models On Source Code Optimization for Interpreted Languages using State Models Jorge López 1,2, Natalia Kushik 2 and Nina Yevtushenko 1 1 Department of Information Technologies, Tomsk State University, Lenin

More information

Overview Graph Coverage Criteria

Overview Graph Coverage Criteria Overview Graph Coverage Criteria Graph Coverage Four Structures for Modeling Software Graphs Logic Input Space Syntax Applied to Applied to Source FSMs Applied to Specs DNF Source Specs Source Models Design

More information

V&V: Model-based testing

V&V: Model-based testing V&V: Model-based testing Systems Engineering BSc Course Budapest University of Technology and Economics Department of Measurement and Information Systems Traceability Platform-based systems design Verification

More information

Implementation of Lexical Analysis

Implementation of Lexical Analysis Implementation of Lexical Analysis Outline Specifying lexical structure using regular expressions Finite automata Deterministic Finite Automata (DFAs) Non-deterministic Finite Automata (NFAs) Implementation

More information

Implementation of Lexical Analysis

Implementation of Lexical Analysis Implementation of Lexical Analysis Outline Specifying lexical structure using regular expressions Finite automata Deterministic Finite Automata (DFAs) Non-deterministic Finite Automata (NFAs) Implementation

More information

A scenario-based test approach for testing reactive concurrent systems

A scenario-based test approach for testing reactive concurrent systems Corporate Technology A scenario-based test approach for testing reactive concurrent systems Andreas Ulrich Siemens AG, Corporate Technology München, Germany ETSI MBT User Conference 2011 October 18 20,

More information

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

Automated Refinement Checking of Asynchronous Processes. Rajeev Alur. University of Pennsylvania Automated Refinement Checking of Asynchronous Processes Rajeev Alur University of Pennsylvania www.cis.upenn.edu/~alur/ Intel Formal Verification Seminar, July 2001 Problem Refinement Checking Given two

More information

Monitoring Interfaces for Faults

Monitoring Interfaces for Faults Monitoring Interfaces for Faults Aleksandr Zaks RV 05 - Fifth Workshop on Runtime Verification Joint work with: Amir Pnueli, Lenore Zuck Motivation Motivation Consider two components interacting with each

More information

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

Introduction to Software Testing Chapter 2, Sec#: 2.5 Graph Coverage for Specifications Introduction to Software Testing Chapter 2, Sec#: 2.5 Graph Coverage for Specifications Paul Ammann & Jeff Offutt http://www.cs.gmu.edu/~offutt/softwa retest/ Design Specifications A design specification

More information

Issues in Testing Electronic Commerce Systems

Issues in Testing Electronic Commerce Systems Issues in Testing Electronic Commerce Systems Kassem Saleh 1 and Robert Probert University of Ottawa, School of Information Technology and Engineering (SITE) P.O.Box 450, Stn A, Ottawa, Ontario, Canada

More information

Model inference to support detection of vulnerabilities

Model inference to support detection of vulnerabilities Model inference to support detection of vulnerabilities Application to Web apps & services Roland GROZ LIG, Université de Grenoble Alpes Savoie, France Séminaire DGA Sécurité & MF Rennes 23 mai 2014 Acknowledgments

More information

Binary Decision Diagrams and Symbolic Model Checking

Binary Decision Diagrams and Symbolic Model Checking Binary Decision Diagrams and Symbolic Model Checking Randy Bryant Ed Clarke Ken McMillan Allen Emerson CMU CMU Cadence U Texas http://www.cs.cmu.edu/~bryant Binary Decision Diagrams Restricted Form of

More information

Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis

Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis Amit Goel Department of ECE, Carnegie Mellon University, PA. 15213. USA. agoel@ece.cmu.edu Randal E. Bryant Computer

More information

Computing Delay with Coupling Using Timed Automata

Computing Delay with Coupling Using Timed Automata Computing Delay with Coupling Using Timed Automata Serdar Taşıran, Yuji Kukimoto and Robert K. Brayton Department of Electrical Engineering and Computer Sciences, University of California, Berkeley Deep

More information

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

Self Stabilization. CS553 Distributed Algorithms Prof. Ajay Kshemkalyani. by Islam Ismailov & Mohamed M. Ali Self Stabilization CS553 Distributed Algorithms Prof. Ajay Kshemkalyani by Islam Ismailov & Mohamed M. Ali Introduction There is a possibility for a distributed system to go into an illegitimate state,

More information

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

Promela and SPIN. Mads Dam Dept. Microelectronics and Information Technology Royal Institute of Technology, KTH. Promela and SPIN Promela and SPIN Mads Dam Dept. Microelectronics and Information Technology Royal Institute of Technology, KTH Promela and SPIN Promela (Protocol Meta Language): Language for modelling discrete, event-driven

More information

Lexical Analysis. Implementation: Finite Automata

Lexical Analysis. Implementation: Finite Automata Lexical Analysis Implementation: Finite Automata Outline Specifying lexical structure using regular expressions Finite automata Deterministic Finite Automata (DFAs) Non-deterministic Finite Automata (NFAs)

More information

Fault Detection of Reachability Testing with Game Theoretic Approach

Fault Detection of Reachability Testing with Game Theoretic Approach Fault Detection of Reachability Testing with Game Theoretic Approach S. Preetha Dr.M. Punithavalli Research Scholar, Karpagam University, Coimbatore. Director, Sri Ramakrishna Engineering College, Coimbatore.

More information

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

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE. (DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)

More information

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

Resource-bound process algebras for Schedulability and Performance Analysis of Real-Time and Embedded Systems Resource-bound process algebras for Schedulability and Performance Analysis of Real-Time and Embedded Systems Insup Lee 1, Oleg Sokolsky 1, Anna Philippou 2 1 RTG (Real-Time Systems Group) Department of

More information

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

Model-based Analysis of Event-driven Distributed Real-time Embedded Systems Model-based Analysis of Event-driven Distributed Real-time Embedded Systems Gabor Madl Committee Chancellor s Professor Nikil Dutt (Chair) Professor Tony Givargis Professor Ian Harris University of California,

More information

Functional Test Generation for Delay Faults in Combinational Circuits

Functional Test Generation for Delay Faults in Combinational Circuits Functional Test Generation for Delay Faults in Combinational Circuits Irith Pomeranz and Sudhakar M. Reddy + Electrical and Computer Engineering Department University of Iowa Iowa City, IA 52242 Abstract

More information

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

Automatic synthesis of switching controllers for linear hybrid systems: Reachability control Automatic synthesis of switching controllers for linear hybrid systems: Reachability control Massimo Benerecetti and Marco Faella Università di Napoli Federico II, Italy Abstract. We consider the problem

More information

Implementation of Lexical Analysis

Implementation of Lexical Analysis Written ssignments W assigned today Implementation of Lexical nalysis Lecture 4 Due in one week y 5pm Turn in In class In box outside 4 Gates Electronically Prof. iken CS 43 Lecture 4 Prof. iken CS 43

More information

Implementation of Lexical Analysis

Implementation of Lexical Analysis Written ssignments W assigned today Implementation of Lexical nalysis Lecture 4 Due in one week :59pm Electronic hand-in Prof. iken CS 43 Lecture 4 Prof. iken CS 43 Lecture 4 2 Tips on uilding Large Systems

More information

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

Introduction to Software Testing Chapter 2, Sections: 2.1 & 2.2 Overview Graph Coverage Criteria Introduction to Software Testing Chapter 2, Sections: 2.1 & 2.2 Overview Graph Coverage Criteria Paul Ammann & Jeff Offutt http://www.cs.gmu.edu/~offutt/softwa retest/ Ch. 2 : Graph Coverage Four Structures

More information

Qualification of Verification Environments Using Formal Techniques

Qualification of Verification Environments Using Formal Techniques Qualification of Verification Environments Using Formal Techniques Raik Brinkmann DVClub on Verification Qualification April 28 2014 www.onespin-solutions.com Copyright OneSpin Solutions 2014 Copyright

More information

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

A Methodology for Constraint-Driven Synthesis of On-Chip Communications A Methodology for Constraint-Driven Synthesis of On-Chip Communications Pinto, Carloni, and Sangiovanni-Vincentelli Discussion session EE 249 Behrooz Shahsavari Outline Overview Methodology and its representation

More information

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

Kernel Korner AEM: A Scalable and Native Event Mechanism for Linux Kernel Korner AEM: A Scalable and Native Event Mechanism for Linux Give your application the ability to register callbacks with the kernel. by Frédéric Rossi In a previous article [ An Event Mechanism

More information

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

Xuandong Li. BACH: Path-oriented Reachability Checker of Linear Hybrid Automata BACH: Path-oriented Reachability Checker of Linear Hybrid Automata Xuandong Li Department of Computer Science and Technology, Nanjing University, P.R.China Outline Preliminary Knowledge Path-oriented Reachability

More information

Verification Finite-state process modeling and reachability analysis

Verification Finite-state process modeling and reachability analysis Verification Finite-state process modeling and reachability analysis Topics: Finite-state process modeling Verification through interactive simulation Concurrent composition of processes Verification through

More information

Don t Cares and Multi-Valued Logic Network Minimization

Don t Cares and Multi-Valued Logic Network Minimization Don t Cares and Multi-Valued Logic Network Minimization Yunian Jiang Robert K. Brayton Department of Electrical Engineering and Computer Sciences University of California, Berkeley wiang,brayton @eecs.berkeley.edu

More information

Composition of State Machines

Composition of State Machines Chapter 5 Composition of State Machines Hongwei Zhang http://www.cs.wayne.edu/~hzhang/ Ack.: this lecture is prepared in part based on slides of Lee, Sangiovanni-Vincentelli, Seshia. Outline Concurrent

More information

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

Reset and Initialization, the Good, the Bad and the Ugly Reset and Initialization, the, the and the Ugly Ping Yeung Design & Verification Technology Mentor Graphics, Fremont, U.S.A. Kaowen Liu Design Technology Division MediaTek Inc, San Jose, U.S.A. Abstract-

More information

A Toolbox for Counter-Example Analysis and Optimization

A Toolbox for Counter-Example Analysis and Optimization A Toolbox for Counter-Example Analysis and Optimization Alan Mishchenko Niklas Een Robert Brayton Department of EECS, University of California, Berkeley {alanmi, een, brayton}@eecs.berkeley.edu Abstract

More information

Lazy Group Sifting for Efficient Symbolic State Traversal of FSMs

Lazy Group Sifting for Efficient Symbolic State Traversal of FSMs Lazy Group Sifting for Efficient Symbolic State Traversal of FSMs Hiroyuki Higuchi Fabio Somenzi Fujitsu Laboratories Ltd. University of Colorado Kawasaki, Japan Boulder, CO Abstract This paper proposes

More information

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

LOGIC SYNTHESIS AND VERIFICATION ALGORITHMS. Gary D. Hachtel University of Colorado. Fabio Somenzi University of Colorado. LOGIC SYNTHESIS AND VERIFICATION ALGORITHMS by Gary D. Hachtel University of Colorado Fabio Somenzi University of Colorado Springer Contents I Introduction 1 1 Introduction 5 1.1 VLSI: Opportunity and

More information

Lecture 9: Reachability

Lecture 9: Reachability Lecture 9: Reachability Outline of Lecture Reachability General Transition Systems Algorithms for Reachability Safety through Reachability Backward Reachability Algorithm Given hybrid automaton H : set

More information

Incremental Methods for FSM Traversal

Incremental Methods for FSM Traversal Incremental Methods for FSM Traversal Gitanjali M. Swamy obert K. Brayton Department of Electrical Engineering and Computer Sciences. Vigyan Singhal Cadence Berkeley Labs University of California at Berkeley

More information

CS505: Distributed Systems

CS505: Distributed Systems Department of Computer Science CS505: Distributed Systems Lecture 13: Distributed Transactions Outline Distributed Transactions Two Phase Commit and Three Phase Commit Non-blocking Atomic Commit with P

More information

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

Separation of Transitions, Actions, and Exceptions in Model-based Testing Separation of Transitions, Actions, and Exceptions in Model-based Testing Cyrille Artho Research Center for Information Security (RCIS), AIST, Tokyo, Japan Abstract. Model-based testing generates test

More information

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

Computational problems. Lecture 2: Combinatorial search and optimisation problems. Computational problems. Examples. Example Lecture 2: Combinatorial search and optimisation problems Different types of computational problems Examples of computational problems Relationships between problems Computational properties of different

More information

EXPRESSING REQUIREMENTS IN MODELICA

EXPRESSING REQUIREMENTS IN MODELICA EXPRESSING REQUIREMENTS IN MODELICA Lena Buffoni and Peter Fritzson Linköping University SE-581 83 Linköping Sweden ABSTRACT As cyber-physical systems grow increasingly complex, the need for methodologies

More information

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

4/6/2011. Model Checking. Encoding test specifications. Model Checking. Encoding test specifications. Model Checking CS 4271 Mel Checking LTL Property System Mel Mel Checking CS 4271 Mel Checking OR Abhik Roychoudhury http://www.comp.nus.edu.sg/~abhik Yes No, with Counter-example trace 2 Recap: Mel Checking for mel-based testing

More information

Automatic test generation based on functional coverage

Automatic test generation based on functional coverage 12 juin 2014 Automatic test generation based on functional coverage Emmanuel Gaudin PragmaDev UCAAT 2014 PragmaDev French SME, Created in 2001 by 2 two experts in modelling tools and languages Since creation

More information

Observability and Controllability Issues in Conformance Testing of Web Service Compositions

Observability and Controllability Issues in Conformance Testing of Web Service Compositions Observability and Controllability Issues in Conformance Testing of Web Service Compositions Jose Pablo Escobedo 1, Christophe Gaston 2, Pascale Le Gall 3 and Ana Cavalli 1 1 TELECOM & Management SudParis

More information

A Test Case Generation Algorithm for Real-Time Systems

A Test Case Generation Algorithm for Real-Time Systems A Test Case Generation Algorithm for Real-Time Systems Anders Hessel and Paul Pettersson Department of Information Technology Uppsala University, P.O. Box 337 SE-751 05 Uppsala, Sweden {hessel,paupet}@it.uu.se

More information

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

Test-Case Generation and Coverage Analysis for Nondeterministic Systems Using Model-Checkers Test-Case Generation and Coverage Analysis for Nondeterministic Systems Using Model-Checkers Gordon Fraser and Franz Wotawa Institute for Software Technology Graz University of Technology Inffeldgasse

More information

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

Research Collection. Formal background and algorithms. Other Conference Item. ETH Library. Author(s): Biere, Armin. Publication Date: 2001 Research Collection Other Conference Item Formal background and algorithms Author(s): Biere, Armin Publication Date: 2001 Permanent Link: https://doi.org/10.3929/ethz-a-004239730 Rights / License: In Copyright

More information

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

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 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 Covering Logic Expressions Logic expressions show up

More information

A New Optimal State Assignment Technique for Partial Scan Designs

A New Optimal State Assignment Technique for Partial Scan Designs A New Optimal State Assignment Technique for Partial Scan Designs Sungju Park, Saeyang Yang and Sangwook Cho The state assignment for a finite state machine greatly affects the delay, area, and testabilities

More information

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

ECE 587 Hardware/Software Co-Design Lecture 11 Verification I ECE 587 Hardware/Software Co-Design Spring 2018 1/23 ECE 587 Hardware/Software Co-Design Lecture 11 Verification I Professor Jia Wang Department of Electrical and Computer Engineering Illinois Institute

More information

Using Finite State Machine at the Testing of Network Protocols

Using Finite State Machine at the Testing of Network Protocols Australian Journal of Basic and Applied Sciences, 5(10): 956-960, 2011 ISSN 1991-8178 Using Finite State Machine at the Testing of Network Protocols 1 Ashraf Abdel-Karim Helal Abu-Ein, 2 Hazem (Moh'd Said)

More information

Model Checking for Hybrid Systems

Model Checking for Hybrid Systems Model Checking for Hybrid Systems Bruce H. Krogh Carnegie Mellon University Hybrid Dynamic Systems Models Dynamic systems with both continuous & discrete state variables Continuous-State Systems differential

More information

Test suite minimization for testing in context

Test suite minimization for testing in context Test suite minimization for testing in context Nina Yevtushenko Tomsk State University 36, Lenin str., Tomsk, 634050, Russia Yevtushenko.RFF@elefot.tsu.tomsk.su Ana Cavalli, Luiz Lima Jr. 1 National Institute

More information

SystemVerilog Essentials Simulation & Synthesis

SystemVerilog Essentials Simulation & Synthesis SystemVerilog Essentials Simulation & Synthesis Course Description This course provides all necessary theoretical and practical know-how to design programmable logic devices using SystemVerilog standard

More information

Lexical Analysis. Chapter 2

Lexical Analysis. Chapter 2 Lexical Analysis Chapter 2 1 Outline Informal sketch of lexical analysis Identifies tokens in input string Issues in lexical analysis Lookahead Ambiguities Specifying lexers Regular expressions Examples

More information

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

A test case generation approach for conformance testing of SDL systems 1 1 A test case generation approach for conformance testing of SDL systems 1 C. Bourhfir 2, E. Aboulhamid 2, R. Dssouli 2, N. Rico 3 2 Département d Informatique et de Recherche Opérationnelle, Pavillon

More information

Observability and Controllability Issues in Conformance Testing of Web Service Compositions

Observability and Controllability Issues in Conformance Testing of Web Service Compositions Observability and Controllability Issues in Conformance Testing of Web Service Compositions Jose Pablo Escobedo 1, Christophe Gaston 2, Pascale Le Gall 3, and Ana Cavalli 1 1 TELECOM & Management SudParis

More information

Computer Science Technical Report

Computer Science Technical Report Computer Science Technical Report Feasibility of Stepwise Addition of Multitolerance to High Atomicity Programs Ali Ebnenasir and Sandeep S. Kulkarni Michigan Technological University Computer Science

More information

Knowledge-based Systems for Industrial Applications

Knowledge-based Systems for Industrial Applications Knowledge-based Systems for Industrial Applications 1 The Topic 2 Tasks Goal: Overview of different tasks Systematic and formal characterization as a requirement for theory and implementation Script: Chap.

More information

An Eclipse Plug-in for Model Checking

An Eclipse Plug-in for Model Checking An Eclipse Plug-in for Model Checking Dirk Beyer, Thomas A. Henzinger, Ranjit Jhala Electrical Engineering and Computer Sciences University of California, Berkeley, USA Rupak Majumdar Computer Science

More information

Automatic Testing with Formal Methods

Automatic Testing with Formal Methods November 30th, 2010 Testing is Inevitable Can be applied to the actual implementation Scales up Can be applied to the actual implementation No need to build a model of the system It is complex to build

More information

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

6.852 Lecture 17. Atomic objects Reading: Chapter 13 Next lecture: Atomic snapshot, read/write register 6.852 Lecture 17 Atomic objects Reading: Chapter 13 Next lecture: Atomic snapshot, read/write register Shared-memory model Single I/O automaton with locality restrictions doesn't exploit I/O automaton

More information

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

Chapter 4. Capturing the Requirements. 4th Edition. Shari L. Pfleeger Joanne M. Atlee Chapter 4 Capturing the Requirements Shari L. Pfleeger Joanne M. Atlee 4th Edition It is important to have standard notations for modeling, documenting, and communicating decisions Modeling helps us to

More information

T Reactive Systems: Kripke Structures and Automata

T Reactive Systems: Kripke Structures and Automata Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Kripke Structures and Automata Spring 2005, Lecture 3 January 31, 2005 Tik-79.186 Reactive Systems 2 Properties of systems invariants: the system

More information

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

Areas related to SW verif. Trends in Software Validation. Your Expertise. Research Trends High level. Research Trends - Ex 2. Research Trends Ex 1 Areas related to SW verif. Trends in Software Validation Abhik Roychoudhury CS 6214 Formal Methods Model based techniques Proof construction techniques Program Analysis Static Analysis Abstract Interpretation

More information

Subsystem Hazard Analysis (SSHA)

Subsystem Hazard Analysis (SSHA) Subsystem Hazard Analysis (SSHA) c "!$#%! Examine subsystems to determine how their Normal performance Operational degradation Functional failure Unintended function Inadvertent function (proper function

More information

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

A Test Sequence Generation Method Based on Dependencies and Slices Jin-peng MO *, Jun-yi LI and Jian-wen HUANG 2017 2nd International Conference on Advances in Management Engineering and Information Technology (AMEIT 2017) ISBN: 978-1-60595-457-8 A Test Sequence Generation Method Based on Dependencies and Slices

More information

XEVE, an ESTEREL Verification Environment

XEVE, an ESTEREL Verification Environment XEVE, an ESTEREL Verification Environment Amar Bouali INRIA, B.P. 93, F-06902 Sophia-Antipolis cedex amar@sophia, inria, fr Abstract. We describe the verification methods and tools we are currently developing

More information

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

L04. Model-based Testing: Principles Henry Muccini. Dipartimento di Informatica, Universityof L Aquila Università degli Studi dell Aquila L04. Model-based Testing: Principles Henry Muccini Dipartimento di Informatica, Universityof L Aquila henry.muccini@univaq.it Copyright Notice The material in these slides

More information

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

Implicit vs. Explicit Data-Flow Requirements in Web Service Composition Goals Implicit vs. Explicit Data-Flow Requirements in Web Service Composition Goals Annapaola Marconi, Marco Pistore, and Paolo Traverso ITC-irst Via Sommarive 18, Trento, Italy {marconi, pistore, traverso}@itc.it

More information