Real-Time Systems, COSC , Lecture 18

Slides:



Advertisements
Similar presentations
Formal Methods and Testing Goal: software reliability Use software engineering methodologies to develop the code. Use formal methods during code development.
Advertisements

Auto-Generation of Test Cases for Infinite States Reactive Systems Based on Symbolic Execution and Formula Rewriting Donghuo Chen School of Computer Science.
Modeling Main issues: What do we want to build How do we write this down.
BDDs & Theorem Proving Binary Decision Diagrams Dr. Eng. Amr T. Abdel-Hamid NETW 703 Winter 2012 Network Protocols Lectures are based on slides by: K.
ECOE 560 Design Methodologies and Tools for Software/Hardware Systems Spring 2004 Serdar Taşıran.
Planning based on Model Checking Dept. of Information Systems and Applied CS Bamberg University Seminar Paper Svetlana Balinova.
An Introduction to the Model Verifier verds Wenhui Zhang September 15 th, 2010.
François Fages MPRI Bio-info 2006 Formal Biology of the Cell Modeling, Computing and Reasoning with Constraints François Fages, Constraints Group, INRIA.
Modeling Main issues: What do we want to build How do we write this down ©2008 John Wiley & Sons Ltd. vliet.
SYMBOLIC MODEL CHECKING: STATES AND BEYOND J.R. Burch E.M. Clarke K.L. McMillan D. L. Dill L. J. Hwang Presented by Rehana Begam.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
Review of topics Final exam : -May 2nd to May 7 th - Projects due on May 7th.
Unified Modeling Language
Spring 07, Feb 13 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 Binary Decision Diagrams Vishwani D. Agrawal James.
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
Binary Decision Diagrams1 BINARY DECISION DIAGRAMS.
Lecture #4 Agenda Cell phones off & name signs out Review Questions? Objects The birds-and-the-bees talk.
Fall 2005CSE 115/503 Introduction to Computer Science I1 Lecture #4 Agenda Announcements Review Questions? Classes and objects UML class diagrams Creating.
C SC 520 Principles of Programming Languages 1 C SC 520: Principles of Programming Languages Peter J. Downey Department of Computer Science Spring 2006.
Embedded Systems Laboratory Department of Computer and Information Science Linköping University Sweden Formal Verification and Model Checking Traian Pop.
Semantics with Applications Mooly Sagiv Schrirber html:// Textbooks:Winskel The.
Unified Modeling Language (UML)
Chapter 3 Planning Your Solution
UML class diagrams (1) UML = Unified Modeling Language We use only class diagrams, not other UML diagrams Purpose: –keep OO concepts separate from implementation.
Software Engineering CSE470: Cheng and McUmber Software Engineering CSE470 (Fall 2001) Instructors: Dr. B. Cheng (Sect. 1-3) Dr. W. McUmber (Sect. 4-6)
Chapter 28 Activity Diagrams Model processes: –Business processes –Workflow –Data flow –Complex algorithms.
02/06/05 “Investigating a Finite–State Machine Notation for Discrete–Event Systems” Nikolay Stoimenov.
Introduction to Software Testing Chapter 9.4 Model-Based Grammars Paul Ammann & Jeff Offutt
Digitaalsüsteemide verifitseerimise kursus1 Formal verification: BDD BDDs applied in equivalence checking.
Model Checking Lecture 4 Tom Henzinger. Model-Checking Problem I |= S System modelSystem property.
SOFTWARE DESIGN AND ARCHITECTURE LECTURE 21. Review ANALYSIS PHASE (OBJECT ORIENTED DESIGN) Functional Modeling – Use case Diagram Description.
Author: Graham Hughes, Tevfik Bultan Computer Science Department, University of California, Santa Barbara, CA 93106, USA Source: International Journal.
Object Management Group (OMG) Specifies open standards for every aspect of distributed computing Multiplatform Model Driven Architecture (MDA)
10/19/2015COSC , Lecture 171 Real-Time Systems, COSC , Lecture 17 Stefan Andrei.
10/25/2015COSC , Lecture 151 Real-Time Systems, COSC , Lecture 15 Stefan Andrei.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View BDDs.
Verification of behavioural elements of UML models using B Truong, Ninh-Thuan and Souquieres, Jeanine In Proceedings of the 2005 ACM Symposium on.
Modeling as a Design Technique Chapter 2 Part 1: Modeling Concepts Object-Oriented Modeling and Design Byung-Hyun Ha
3.2 Semantics. 2 Semantics Attribute Grammars The Meanings of Programs: Semantics Sebesta Chapter 3.
ISBN Chapter 3 Describing Semantics.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Data Structures Using C++ 2E
© 2006 Pearson Addison-Wesley. All rights reserved 2-1 Chapter 2 Principles of Programming & Software Engineering.
Lecture 9-1 : Intro. to UML (Unified Modeling Language)
Verification & Validation By: Amir Masoud Gharehbaghi
Practical Object-Oriented Design with UML 2e Slide 1/1 ©The McGraw-Hill Companies, 2004 PRACTICAL OBJECT-ORIENTED DESIGN WITH UML 2e Chapter 1: Introduction.
1 Technical & Business Writing (ENG-715) Muhammad Bilal Bashir UIIT, Rawalpindi.
UML Course Instructor: Rizwana Noor. Overview  Modeling  What is UML?  Why UML?  UML Diagrams  Use Case  Components  Relationships  Notations.
Industrial Group Project Introduction to Object Oriented Programming Adelina Basholli, February, 2016.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
Software Engineering: Models David Millard
Chapter 1 Overview of UML for Java Programmers. 2 Outline Diagram Types Diagram Types Class Diagrams Class Diagrams Object Diagrams Object Diagrams Sequence.
Basic concepts of Model Checking
Main issues: • What do we want to build • How do we write this down
Object-Oriented Analysis and Design
Computational Thinking, Problem-solving and Programming: General Principals IB Computer Science.
Chapter 5: Object Oriented Analysis and Design
Planning as model checking, (OBDDs)
About the Presentations
Microsoft Visual Basic 2005 BASICS
Systems Analysis Overview.
Binary Decision Diagrams
Formal Methods in software development
Albert M. K. Cheng Real-Time Systems Laboratory University of Houston
Formal Methods in software development
Dichotomies in CSP Karl Lieberherr inspired by the paper:
Verifying Programs with BDDs Sept. 22, 2006
Program correctness Model-checking CTL
Boolean Algebra for CAD Applications
Presentation transcript:

Real-Time Systems, COSC-4301-01, Lecture 18 Stefan Andrei 10/23/2019 COSC-4301-01, Lecture 18

Reminder of the last lecture Model checking of finite-state systems 10/23/2019 COSC-4301-01, Lecture 18

Overview of This Lecture Symbolic model checking of finite-state systems (Ordered) Binary Decision Diagrams 10/23/2019 COSC-4301-01, Lecture 18

Boolean functions 10/23/2019 COSC-4301-01, Lecture 18

Representing boolean functions 10/23/2019 COSC-4301-01, Lecture 18

Binary decision trees 10/23/2019 COSC-4301-01, Lecture 18

Problems 10/23/2019 COSC-4301-01, Lecture 18

Binary decision diagrams (BDDs) 10/23/2019 COSC-4301-01, Lecture 18

Reduction rules 10/23/2019 COSC-4301-01, Lecture 18

Reduction rules (cont) 10/23/2019 COSC-4301-01, Lecture 18

Variable ordering 10/23/2019 COSC-4301-01, Lecture 18

Summary of reduction rules 10/23/2019 COSC-4301-01, Lecture 18

Operations on BDDs 10/23/2019 COSC-4301-01, Lecture 18

Predicates 10/23/2019 COSC-4301-01, Lecture 18

Equivalence of functions 10/23/2019 COSC-4301-01, Lecture 18

Operations 10/23/2019 COSC-4301-01, Lecture 18

Ordered BDDs (OBDDs) 10/23/2019 COSC-4301-01, Lecture 18

Properties of OBBDs 10/23/2019 COSC-4301-01, Lecture 18

Properties of reduced OBBDs 10/23/2019 COSC-4301-01, Lecture 18

Properties of reduced OBBDs (cont) 10/23/2019 COSC-4301-01, Lecture 18

OBBDs and variable ordering 10/23/2019 COSC-4301-01, Lecture 18

Reduction for OBDDs 10/23/2019 COSC-4301-01, Lecture 18

Labeling algorithm Mistake: Label all 0’s with 0. 10/23/2019 COSC-4301-01, Lecture 18

Labeling algorithm 3. If there is a node m with the same variable as n such that l(n)=l(m) and h(n)=h(m), label n with m’s label. 10/23/2019 COSC-4301-01, Lecture 18

Complexity 10/23/2019 COSC-4301-01, Lecture 18

Summary Symbolic model checking of finite-state systems (Ordered) Binary Decision Diagrams Models and modelling (analysis & design models) A model is totality of information to describe the 5 views Methodologies = defines a number of models that can be used to develop a system = Examples (structured methods, OO methods) = Formal notations (OO model = UML) UML = unification of earlier OO modelling languages Design models and code (the models used in the design of a system present an abstract view of it, and an implementation adds enough detail to make these models executable). The software development process (Unified Process) 10/23/2019 COSC-4301-01, Lecture 18

Reading suggestions Chapter 4 of [Cheng; 2002] Chapter 6 of [Huth and Ryan; 2004], where this is: M. Huth and M. Ryan: Logic in Computer Science. Modelling and Reasoning about Systems. Cambridge University Press, 2004, ISBN 978-0521-543101 10/23/2019 COSC-4301-01, Lecture 18

Coming up next Visual formalism, statecharts, and STATEMATE (Chapter 5 of [Cheng; 2002]) 10/23/2019 COSC-4301-01, Lecture 18

Thank you for your attention! Questions? 10/23/2019 COSC-4301-01, Lecture 18