Formal Methods in software development

Slides:



Advertisements
Similar presentations
Probability for a First-Order Language Ken Presting University of North Carolina at Chapel Hill.
Advertisements

Chapter 2 The Operations of Fuzzy Set. Outline Standard operations of fuzzy set Fuzzy complement Fuzzy union Fuzzy intersection Other operations in fuzzy.
Event structures Mauro Piccolo. Interleaving Models Trace Languages:  computation described through a non-deterministic choice between all sequential.
Discrete Mathematics I Lectures Chapter 6
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
Instructor: Hayk Melikya
(CSC 102) Discrete Structures Lecture 14.
Denoting the beginning
Operations on Sets Union Intersection: Two sets are disjoint if their intersection is the null set. Difference A - B. Complement of a set A.
Boolean Algebra Discussion D6.1 Sections 13-3 – 13-6.
Orderings and Bounds Parallel FSM Decomposition Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 10 Update and modified by Marek.
Boolean Algebra Discussion D2.2. Boolean Algebra and Logic Equations George Boole Switching Algebra Theorems Venn Diagrams.
Section 4.2 Intersections, Unions & Compound Inequalities  Using Set Diagrams and Notation  Intersections of Sets Conjunctions of Sentences and  Unions.
Chapter 2 Sets, Relations, and Functions SET OPERATIONS The union of A and B.
ORDINAL NUMBERS VINAY SINGH MARCH 20, 2012 MAT 7670.
Sets, POSets, and Lattice © Marcelo d’Amorim 2010.
Section Section Summary Introduction to Boolean Algebra Boolean Expressions and Boolean Functions Identities of Boolean Algebra Duality The Abstract.
Boolean Algebra Computer Organization 1 © McQuain Boolean Algebra A Boolean algebra is a set B of values together with: -two binary operations,
Logics for Data and Knowledge Representation Introduction to Algebra Chiara Ghidini, Luciano Serafini, Fausto Giunchiglia and Vincenzo Maltese.
Categories and Computer Science
Inclusion-Exclusion Selected Exercises Powerpoint Presentation taken from Peter Cappello’s webpage
1.6 Solving Compound Inequalities Understanding that conjunctive inequalities take intersections of intervals and disjunctive inequalities take unions.
C I AC I AD U OD U O disjunction conjunction union intersection orand U U Notes 4.2 Compound Inequalities unite, combinewhere they cross, what they share.
Copyright © 2014 Curt Hill Sets Introduction to Set Theory.
LDK R Logics for Data and Knowledge Representation PL of Classes.
Chapter 2 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesBoolean Algebra.
CSE 20: Lecture 7 Boolean Algebra CK Cheng
Mathematical Preliminaries
The theory behind Functional Programming Functional: based on lambda calculus / combinators, recursion theory, category theory. By contrast with other.
Slide 7- 1 Copyright © 2012 Pearson Education, Inc.
UNIT 01 – LESSON 10 - LOGIC ESSENTIAL QUESTION HOW DO YOU USE LOGICAL REASONING TO PROVE STATEMENTS ARE TRUE? SCHOLARS WILL DETERMINE TRUTH VALUES OF NEGATIONS,
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.
Discrete Mathematics Lecture # 10 Venn Diagram. Union  Let A and B be subsets of a universal set U. The union of sets A and B is the set of all elements.
Section 1.2 – 1.3 Outline Intersection  Disjoint Sets (A  B=  ) AND Union  OR Universe The set of items that are possible for membership Venn Diagrams.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesBoolean Algebra.
Advanced Digital Designs Jung H. Kim. Chapter 1. Sets, Relations, and Lattices.
6.6 Rings and fields Rings  Definition 21: A ring is an Abelian group [R, +] with an additional associative binary operation (denoted ·) such that.
Venn Diagrams.
Algebra 2 Chapter 12 Venn Diagrams, Permutations, and Combinations Lesson 12.2.
7/7/20161 Formal Methods in software development a.a.2015/2016 Prof.Anna Labella.
Basic Operations Algebra of Bags
The Language of Sets If S is a set, then
Unions and Intersections of Sets
Sequences and Series IB standard
Unit-III Algebraic Structures
Formal Methods in software development
Formal Modeling Concepts
What is Probability? Quantification of uncertainty.
Boolean Algebra A Boolean algebra is a set B of values together with:
CSE 2353 – September 22nd 2003 Sets.
Section 2.3B Venn Diagrams and Set Operations
Set Operations Section 2.2.
Concurrent Models of Computation
A Brief Summary for Exam 1
Formal Methods in software development
Properties of Real Numbers
Formal Methods in software development
The Hodge theory of a smooth, oriented, compact Riemannian manifold
Formal Methods in software development
Formal Methods in software development
Lecture 10: Fixed Points ad Infinitum M.C. Escher, Moebius Ants
This diagram helps explains why angles at a point add to 360o.
AND.
Algebra 1 Section 4.7.
Ordered Pair – (11 - 2) CS-708.
Formal Methods in software development
Ch. 3 Vocabulary 10.) Union 11.) Intersection 12.) Disjoint sets.
6.2 Multiplying Powers with the Same Base
Boolean Algebra.
Presentation transcript:

Formal Methods in software development a.a.2017/2018 Prof.Anna Labella 4/15/2019

Exercises 4/15/2019 4/15/2019 2

Programs as functions In view of an interpretation of programs in terms of continuous partial functions …. Why functions? Because a command can be thought of as a function from states to states In general a non-total one Why continuous? Because we have to preserve l.u.b., in particular fixed points 4/15/2019 4/15/2019 3

Programs as functions We have to guarantee that some constructions give rise to cpo’s and to continuous functions Remember that continuous partial functions are in a cpo. 4/15/2019 4/15/2019 4

4/15/2019 4/15/2019 5

4/15/2019 4/15/2019 6

4/15/2019 4/15/2019 7

4/15/2019 4/15/2019 8

What is a product? Given A and B, two structures of the same kind we are looking for an object with two projections in A and B, preserving the structure and s.t. given another object with two morphisms f and g in A and B, there is a unique l making the following diagram commute: 4/15/2019 4/15/2019 9

Theorem Product, if it does exist, is unique up to isomorphisms examples 4/15/2019 4/15/2019 10

Examples Cartesian product in Sets Intersection in P(X) Conjunction in a boolean algebra ……….. 4/15/2019 4/15/2019 11

What is a sum? Given A and B, two structures of the same kind we are looking for an object with two injections from A and B, preserving the structure and s.t. given another object with two morphisms h and k from A and B, there is a unique m making the following diagram commute: 4/15/2019 4/15/2019 12

Theorem Sum, if it does exist, is unique up to isomorphisms Duality 4/15/2019 4/15/2019 13

Examples Disjoint union in Sets Union in P(X) Disjunction in a boolean algebra ……….. 4/15/2019 4/15/2019 14

Example: in the universe of domains Given two domains A and B, we could add a bottom element 4/15/2019 4/15/2019 15

Examples or make the two bottom elements coincide 4/15/2019 4/15/2019 16

Which is the sum? 4/15/2019 4/15/2019 17