AAA616: Program Analysis. Lecture 7 The Octagon Abstract Domain
|
|
- Elfreda Smith
- 6 years ago
- Views:
Transcription
1 AAA616: Program Analysis Lecture 7 The Octagon Abstract Domain Hakjoo Oh 2016 Fall Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
2 Reference Antoine Miné. The Octagon Abstract Domain. Higher-Order and Symbolic Computation. Volume 19 Issue 1, March 2006 Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
3 Numerical Abstract Domains Infer numerical properties of program variables: e.g., division by zero, array index out of bounds, integer overflow, etc. Well-known numerical domains: interval domain: x [l, u] octagon domain: ±x ± y c polyhedron domain (affine inequalities): a 1 x a n x n c Karr s domain (affine equalities): a 1 x a n x n = c congruence domain: x az + b The octagon domain is a restriction of the polyhedron domain where each constraint involves at most two variables and unit coefficients. Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
4 Interval vs. Octagon Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
5 Example Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
6 Example Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
7 Example Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
8 Example Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
9 Example Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
10 Octagon A finite set V = {V 1,..., V n } of variables. An environment ρ (V I) (ρ I n ), where I can be Z, Q, or R. An octagonal constraint is a constraint of the form ±V i ± V j c. An octagon is the set of points satisfying a conjunction of octagonal constraints. Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
11 Potential Constraints A potential constraint (i.e., difference constraint): V i V j c. Let C be a set of potential constraints. C can be represented by a potential graph G = (V, ). ( ) V V I V i c V j (V j V i c) C Assume that, for every Vi, V j, there is at most one arc from V i to V j. A potential set of C is the set of points in I n that satisfy C. Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
12 Difference Bound Matrices (DBMs) A DBM m is a n n square matrix, where n is the number of program variables, with elements in Ī = I {+ }. { c (Vi V m ij = j c) C + o.w. DBM = Ī n n : the set of all DBMS. The potential set described by m: γ Pot (m) = {(v 1,..., v n ) I n i, j.v j v i m ij } Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
13 Example Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
14 Encoding Octagonal Constraints as Potential Constraints V = {V 1,..., V n }: the set of program variables. Define V = {V 1,..., V 2n }, where each V i V has both a positive form V 2n 1 and a negative form V 2n V 2n 1 = V i and V 2n = V n A conjunction of octagonal constraints on V can be represented as a conjunction of potential constraints on V. 2n 2n DBM with elements in Ī i, V 2i 1 = V 2i holds for any DBM that encodes octagonal constraints Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
15 Concretization Given a DBM m of dimension 2n, the octagon described by m is defined as follows: γ Oct : DBM (V I) γ Oct (m) = {(v 1,..., v n ) I n (v 1, v 1,..., v n, v n ) γ Pot (m)} Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
16 Coherence A DBM m must be coherent if it encodes a set of octagonal constraints: m is coherent i, j. m ij = m jī where switches between the positive and negative forms of a variable: { i + 1 if i is odd ī = i 1 if i is even Let CDBM be the set of all coherent DBMs. Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
17 Lattice Structure The set of DBMs forms a complete lattice (I Q): (CDBM,,,,, ) is a DBM such that ij = + is a new smallest element m. m m. m = m = m m. m = m = m m, n. m n i, j. m ij n ij (m, n ) m, n. (m n) ij = max(m ij, n ij ) (m, n ) m, n. (m n) ij = min(m ij, n ij ) (m, n ) Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
18 Galois Connection α Oct ( ) = ( α Oct (R) ) ij = γ Oct (V I) CDBM α Oct max{ρ(v l ) ρ(v k ) ρ R} i = 2k 1, j = 2l 1 or i = 2l, j = 2k max{ρ(v l ) + ρ(v k ) ρ R} i = 2k, j = 2l 1 max{ ρ(v l ) ρ(v k ) ρ R} i = 2k 1, j = 2l Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
19 Normalization Different, incomparable DBMs may represent the same potential set: Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
20 Shortest-Path Closure The shortest-path closure m of m is defined as follows: The closure m of m is the smallest DBM representing γ Pot (m): X DBM. γ Pot (m) = γ Pot (X) = m X Floyd-Warshall Algorithm: Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
21 Implicit Constraints Closuring a DBM makes implicit constraints explicit: V j V k c V k V l d = V j V i c + d Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
22 Strong Closure The closure m of m may not be the smallest DBM representing γ Oct (m): Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
23 Strong Closure The strong closure m of m is the smallest DBM representing γ Oct. m is strongly closed iff: i, j, k. m ij m ik + m kj i, j. m ij (m i ī + m jj )/2 i, m ii = 0 The encoding of octagonal constraints implies V j V j c V ī V i d = V j V i (c + d)/2 Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
24 Abstract Transfer Functions Abstract counterparts of concrete transfer functions: union, intersection assignment test (guard) Soundness condition: F γ γ ˆF Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
25 Union The union of two octagons may not be an octagon. gives a sound approximation. Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
26 Intersection The intersection of two octagons is always an octagon. gives the exact intersection of two octagons. Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
27 Assignment (the forget operator) Concrete semantics: Abstract semantics: Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
28 Assignment (the forget operator) When the argument is strongly closed, the result is exact: Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
29 Assignments Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
30 Variable Clustering A collection Π : ( (V)) of variable clusters such that The complete lattice: π Π π = V O Π = π Π where O π is the lattice of Octagon for variables in π. Challenge: How to choose a good Π? Heo et al. Learning a Variable-Clustering Strategy for Octagon from Labeled Data Generated by a Static Analysis. SAS 2016 O π Hakjoo Oh AAA Fall, Lecture 7 November 3, / 30
The Octagon Abstract Domain
The Octagon Abstract Domain Antoine Miné (mine@di.ens.fr) Département d Informatique, École Normale Supérieure Abstract. This article presents the octagon abstract domain, a relational numerical abstract
More informationThe Octagon Abstract Domain
1 The Octagon Abstract Domain Antoine Miné École Normale Supérieure de Paris, France, mine@di.ens.fr, http://www.di.ens.fr/~mine arxiv:cs/0703084v2 cs.pl] 16 Mar 2007 Abstract This article presents a new
More informationA New Numerical Abstract Domain Based on Difference-Bound Matrices
A New Numerical Abstract Domain Based on Difference-Bound Matrices Antoine Miné École Normale Supérieure de Paris, France, mine@di.ens.fr, http://www.di.ens.fr/~mine Abstract. This paper presents a new
More informationCircles & Interval & Set Notation.notebook. November 16, 2009 CIRCLES. OBJECTIVE Graph a Circle given the equation in standard form.
OBJECTIVE Graph a Circle given the equation in standard form. Write the equation of a circle in standard form given a graph or two points (one being the center). Students will be able to write the domain
More informationCOSE212: Programming Languages. Lecture 1 Inductive Definitions (1)
COSE212: Programming Languages Lecture 1 Inductive Definitions (1) Hakjoo Oh 2017 Fall Hakjoo Oh COSE212 2017 Fall, Lecture 1 September 4, 2017 1 / 9 Inductive Definitions Inductive definition (induction)
More informationCOSE212: Programming Languages. Lecture 1 Inductive Definitions (1)
COSE212: Programming Languages Lecture 1 Inductive Definitions (1) Hakjoo Oh 2018 Fall Hakjoo Oh COSE212 2018 Fall, Lecture 1 September 5, 2018 1 / 10 Inductive Definitions Inductive definition (induction)
More informationA Few Graph-Based Relational Numerical Abstract Domains
A Few Graph-Based Relational Numerical Abstract Domains Antoine Miné École Normale Supérieure de Paris, France, mine@di.ens.fr, http://www.di.ens.fr/~mine Abstract This article presents the systematic
More informationAn Abstract Domain to Infer Octagonal Constraints with Absolute Value
An Abstract Domain to Infer Octagonal Constraints with Absolute Value Liqian Chen 1, Jiangchao Liu 2, Antoine Miné 2,3, Deepak Kapur 4, and Ji Wang 1 1 National Laboratory for Parallel and Distributed
More informationCVO103: Programming Languages. Lecture 2 Inductive Definitions (2)
CVO103: Programming Languages Lecture 2 Inductive Definitions (2) Hakjoo Oh 2018 Spring Hakjoo Oh CVO103 2018 Spring, Lecture 2 March 13, 2018 1 / 20 Contents More examples of inductive definitions natural
More informationMatrices and Vectors
Matrices and Vectors James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 11, 2013 Outline 1 Matrices and Vectors 2 Vector Details 3 Matrix
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationOctagonal Domains for Continuous Constraints
Octagonal Domains for Continuous Constraints Marie Pelleau Charlotte Truchet Frédéric Benhamou TASC, University of Nantes CP 2011 September 13, 2011 September 13, 2011 1 / 22 Outline Table of contents
More informationBL-Functions and Free BL-Algebra
BL-Functions and Free BL-Algebra Simone Bova bova@unisi.it www.mat.unisi.it/ bova Department of Mathematics and Computer Science University of Siena (Italy) December 9, 008 Ph.D. Thesis Defense Outline
More informationNatural Numbers: Also called the counting numbers The set of natural numbers is represented by the symbol,.
Name Period Date: Topic: Real Numbers and Their Graphs Standard: 9-12.A.1.3 Objective: Essential Question: What is the significance of a point on a number line? Determine the relative position on the number
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationICS141: Discrete Mathematics for Computer Science I
ICS4: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
More informationExact Join Detection for Convex Polyhedra and Other Numerical Abstractions
Exact Join Detection for Convex Polyhedra and Other Numerical Abstractions Roberto Bagnara, Patricia M. Hill, Enea Zaffanella Department of Mathematics, University of Parma, Italy Abstract Deciding whether
More informationTime(d) Petri Net. Serge Haddad. Petri Nets 2016, June 20th LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA
Time(d) Petri Net Serge Haddad LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA haddad@lsv.ens-cachan.fr Petri Nets 2016, June 20th 2016 1 Time and Petri Nets 2 Time Petri Net: Syntax and Semantic
More informationFinite Automata and Formal Languages
Finite Automata and Formal Languages TMV26/DIT32 LP4 2 Lecture 6 April 5th 2 Regular expressions (RE) are an algebraic way to denote languages. Given a RE R, it defines the language L(R). Actually, they
More informationEE263 Review Session 1
EE263 Review Session 1 October 5, 2018 0.1 Importing Variables from a MALAB.m file If you are importing variables given in file vars.m, use the following code at the beginning of your script. close a l
More informationEquivalence, Order, and Inductive Proof
2/ chapter 4 Equivalence, Order, and Inductive Proof Good order is the foundation of all things. Edmund Burke (729 797) Classifying things and ordering things are activities in which we all engage from
More informationRegular Expressions. Definitions Equivalence to Finite Automata
Regular Expressions Definitions Equivalence to Finite Automata 1 RE s: Introduction Regular expressions are an algebraic way to describe languages. They describe exactly the regular languages. If E is
More informationMax-plus algebra. Max-plus algebra. Monika Molnárová. Technická univerzita Košice. Max-plus algebra.
Technická univerzita Košice monika.molnarova@tuke.sk Outline 1 Digraphs Maximum cycle-mean and transitive closures of a matrix Reducible and irreducible matrices Definite matrices Digraphs Complete digraph
More informationLesson 3-6: Compound Inequalities Name:
Lesson 3-6: Compound Inequalities Name: W hen people plan a house, they often have many requirements in mind that can be written as inequalities. Such requirements could be the dimensions of rooms or the
More information2-7 Solving Quadratic Inequalities. ax 2 + bx + c > 0 (a 0)
Quadratic Inequalities In One Variable LOOKS LIKE a quadratic equation but Doesn t have an equal sign (=) Has an inequality sign (>,
More informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CSE 5311 Lecture 22 All-Pairs Shortest Paths Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 All Pairs
More informationStatic Program Analysis using Abstract Interpretation
Static Program Analysis using Abstract Interpretation Introduction Static Program Analysis Static program analysis consists of automatically discovering properties of a program that hold for all possible
More informationCOSE312: Compilers. Lecture 2 Lexical Analysis (1)
COSE312: Compilers Lecture 2 Lexical Analysis (1) Hakjoo Oh 2017 Spring Hakjoo Oh COSE312 2017 Spring, Lecture 2 March 12, 2017 1 / 15 Lexical Analysis ex) Given a C program float match0 (char *s) /* find
More information--------------------------------------------------------------------------------------------- Math 6023 Topics: Design and Graph Theory ---------------------------------------------------------------------------------------------
More informationCountable and uncountable sets. Matrices.
Lecture 11 Countable and uncountable sets. Matrices. Instructor: Kangil Kim (CSE) E-mail: kikim01@konkuk.ac.kr Tel. : 02-450-3493 Room : New Milenium Bldg. 1103 Lab : New Engineering Bldg. 1202 Next topic:
More informationWarshall s algorithm
Regular Expressions [1] Warshall s algorithm See Floyd-Warshall algorithm on Wikipedia The Floyd-Warshall algorithm is a graph analysis algorithm for finding shortest paths in a weigthed, directed graph
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More information2.5 Compound Inequalities
Section.5 Compound Inequalities 89.5 Compound Inequalities S 1 Find the Intersection of Two Sets. Solve Compound Inequalities Containing and. Find the Union of Two Sets. 4 Solve Compound Inequalities Containing
More informationAutomata Theory for Presburger Arithmetic Logic
Automata Theory for Presburger Arithmetic Logic References from Introduction to Automata Theory, Languages & Computation and Constraints in Computational Logic Theory & Application Presented by Masood
More informationLecture #14: NP-Completeness (Chapter 34 Old Edition Chapter 36) Discussion here is from the old edition.
Lecture #14: 0.0.1 NP-Completeness (Chapter 34 Old Edition Chapter 36) Discussion here is from the old edition. 0.0.2 Preliminaries: Definition 1 n abstract problem Q is a binary relations on a set I of
More informationHW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.
HW1 solutions Exercise 1 (Some sets of probability distributions.) Let x be a real-valued random variable with Prob(x = a i ) = p i, i = 1,..., n, where a 1 < a 2 < < a n. Of course p R n lies in the standard
More informationDiscrete Mathematics. Chapter 4. Relations and Digraphs Sanguk Noh
Discrete Mathematics Chapter 4. Relations and Digraphs Sanguk Noh Table Product sets and partitions Relations and digraphs Paths in relations and digraphs Properties of relations Equivalence relations
More information9th and 10th Grade Math Proficiency Objectives Strand One: Number Sense and Operations
Strand One: Number Sense and Operations Concept 1: Number Sense Understand and apply numbers, ways of representing numbers, the relationships among numbers, and different number systems. Justify with examples
More informationGeneration of. Polynomial Equality Invariants. by Abstract Interpretation
Generation of Polynomial Equality Invariants by Abstract Interpretation Enric Rodríguez-Carbonell Universitat Politècnica de Catalunya (UPC) Barcelona Joint work with Deepak Kapur (UNM) 1 Introduction
More information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More informationMath 42, Discrete Mathematics
c Fall 2018 last updated 12/05/2018 at 15:47:21 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More informationLecture 3. 1 Polynomial-time algorithms for the maximum flow problem
ORIE 633 Network Flows August 30, 2007 Lecturer: David P. Williamson Lecture 3 Scribe: Gema Plaza-Martínez 1 Polynomial-time algorithms for the maximum flow problem 1.1 Introduction Let s turn now to considering
More informationDECIDING CONDITIONAL TERMINATION
Logical Methods in Computer Science Vol. 1(3:8)214, pp. 1 61 www.lmcs-online.org Submitted Sep. 3, 212 Published Aug. 21, 214 DECIDING CONDITIONAL TERMINATION MARIUS BOZGA a, RADU IOSIF b, AND FILIP KONEČNÝc
More informationarxiv: v1 [math.co] 27 Jul 2015
Perfect Graeco-Latin balanced incomplete block designs and related designs arxiv:1507.07336v1 [math.co] 27 Jul 2015 Sunanda Bagchi Theoretical Statistics and Mathematics Unit Indian Statistical Institute
More informationGeometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants
Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants Deepak Kapur 1 Zhihai Zhang 2 Matthias Horbach 1 Hengjun Zhao 3 Qi Lu 1 and ThanhVu Nguyen 1 1
More informationAAA616: Program Analysis. Lecture 3 Denotational Semantics
AAA616: Program Analysis Lecture 3 Denotational Semantics Hakjoo Oh 2018 Spring Hakjoo Oh AAA616 2018 Spring, Lecture 3 March 28, 2018 1 / 33 Denotational Semantics In denotational semantics, we are interested
More informationCOSE312: Compilers. Lecture 17 Intermediate Representation (2)
COSE312: Compilers Lecture 17 Intermediate Representation (2) Hakjoo Oh 2017 Spring Hakjoo Oh COSE312 2017 Spring, Lecture 17 May 31, 2017 1 / 19 Common Intermediate Representations Three-address code
More informationCS412: Lecture #17. Mridul Aanjaneya. March 19, 2015
CS: Lecture #7 Mridul Aanjaneya March 9, 5 Solving linear systems of equations Consider a lower triangular matrix L: l l l L = l 3 l 3 l 33 l n l nn A procedure similar to that for upper triangular systems
More informationWest Windsor-Plainsboro Regional School District Algebra Grade 8
West Windsor-Plainsboro Regional School District Algebra Grade 8 Content Area: Mathematics Unit 1: Foundations of Algebra This unit involves the study of real numbers and the language of algebra. Using
More informationContent Standard 1: Numbers, Number Sense, and Computation Place Value
Content Standard 1: Numbers, Number Sense, and Computation Place Value Fractions Comparing and Ordering Counting Facts Estimating and Estimation Strategies Determine an approximate value of radical and
More informationMath 354 Transition graphs and subshifts November 26, 2014
Math 54 Transition graphs and subshifts November 6, 04. Transition graphs Let I be a closed interval in the real line. Suppose F : I I is function. Let I 0, I,..., I N be N closed subintervals in I with
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More informationCOT3100 SI Final Exam Review
1 Symbols COT3100 SI Final Exam Review Jarrett Wendt Spring 2018 You ve learned a plethora of new Mathematical symbols this semester. Let s see if you know them all and what they re used for. How many
More informationTimed Automata. Semantics, Algorithms and Tools. Zhou Huaiyang
Timed Automata Semantics, Algorithms and Tools Zhou Huaiyang Agenda } Introduction } Timed Automata } Formal Syntax } Operational Semantics } Verification Problems } Symbolic Semantics & Verification }
More informationChapter 2 Linear Equations and Inequalities in One Variable
Chapter 2 Linear Equations and Inequalities in One Variable Section 2.1: Linear Equations in One Variable Section 2.3: Solving Formulas Section 2.5: Linear Inequalities in One Variable Section 2.6: Compound
More informationPrentice Hall Algebra 1, Foundations Series 2011 Correlated to: Washington Mathematics Standards, Algebra 1 (2008)
Algebra 1 A1.1. Core Content: Solving problems (Algebra) Students learn to solve many new types of problems in Algebra 1, and this first core content area highlights the types of problems students will
More informationWHAT IS AN SMT SOLVER? Jaeheon Yi - April 17, 2008
WHAT IS AN SMT SOLVER? Jaeheon Yi - April 17, 2008 WHAT I LL TALK ABOUT Propositional Logic Terminology, Satisfiability, Decision Procedure First-Order Logic Terminology, Background Theories Satisfiability
More informationComputing (the smallest) fixed points of monotone maps arising in static analysis by AI
Computing (the smallest fixed points of monotone maps arising in static analysis by AI Joint work, over the last 4 years: Stéphane Gaubert 1, Assalé Adjé, Eric Goubault 3, Sylvie Putot, Alexandru Costan,
More informationLinear equations The first case of a linear equation you learn is in one variable, for instance:
Math 52 0 - Linear algebra, Spring Semester 2012-2013 Dan Abramovich Linear equations The first case of a linear equation you learn is in one variable, for instance: 2x = 5. We learned in school that this
More informationPatterns and Relations (Patterns)
Patterns and Relations (Patterns) Kindergarten Grade 1 Grade 2 Grade 3 Grade 4 Specific Learning Outcomes Specific Learning Outcomes Specific Learning Outcomes Specific Learning Outcomes Specific Learning
More informationAAA615: Formal Methods. Lecture 2 First-Order Logic
AAA615: Formal Methods Lecture 2 First-Order Logic Hakjoo Oh 2017 Fall Hakjoo Oh AAA615 2017 Fall, Lecture 2 September 24, 2017 1 / 29 First-Order Logic An extension of propositional logic with predicates,
More informationSquare 2-designs/1. 1 Definition
Square 2-designs Square 2-designs are variously known as symmetric designs, symmetric BIBDs, and projective designs. The definition does not imply any symmetry of the design, and the term projective designs,
More informationChapter 8 Dynamic Programming
Chapter 8 Dynamic Programming Copyright 007 Pearson Addison-Wesley. All rights reserved. Dynamic Programming Dynamic Programming is a general algorithm design technique for solving problems defined by
More informationOptimal Fractional Factorial Plans for Asymmetric Factorials
Optimal Fractional Factorial Plans for Asymmetric Factorials Aloke Dey Chung-yi Suen and Ashish Das April 15, 2002 isid/ms/2002/04 Indian Statistical Institute, Delhi Centre 7, SJSS Marg, New Delhi 110
More informationHonors Integrated Algebra/Geometry 3 Critical Content Mastery Objectives Students will:
Content Standard 1: Numbers, Number Sense, and Computation Place Value Fractions Comparing and Ordering Counting Facts Estimating and Estimation Strategies Determine an approximate value of radical and
More informationWeek 4-5: Binary Relations
1 Binary Relations Week 4-5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
More information7. Shortest Path Problems and Deterministic Finite State Systems
7. Shortest Path Problems and Deterministic Finite State Systems In the next two lectures we will look at shortest path problems, where the objective is to find the shortest path from a start node to an
More informationGRAPH ALGORITHMS Week 3 (16-21 October 2017)
GRAPH ALGORITHMS Week 3 (16-21 October 2017) C. Croitoru croitoru@info.uaic.ro FII October 15, 2017 1 / 63 OUTLINE Graph Theory Vocabulary 1 Definition of a Graph 2 Variations in the Definition of a Graph
More informationLecture 7: Shortest Paths in Graphs with Negative Arc Lengths. Reading: AM&O Chapter 5
Lecture 7: Shortest Paths in Graphs with Negative Arc Lengths Reading: AM&O Chapter Label Correcting Methods Assume the network G is allowed to have negative arc lengths but no directed negativelyweighted
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationCS100: DISCRETE STRUCTURES. Lecture 3 Matrices Ch 3 Pages:
CS100: DISCRETE STRUCTURES Lecture 3 Matrices Ch 3 Pages: 246-262 Matrices 2 Introduction DEFINITION 1: A matrix is a rectangular array of numbers. A matrix with m rows and n columns is called an m x n
More informationMath.3336: Discrete Mathematics. Chapter 9 Relations
Math.3336: Discrete Mathematics Chapter 9 Relations Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
More informationChapter 8 Dynamic Programming
Chapter 8 Dynamic Programming Copyright 2007 Pearson Addison-Wesley. All rights reserved. Dynamic Programming Dynamic Programming is a general algorithm design technique for solving problems defined by
More informationcorrelated to the Sunshine State Standards for Mathematics Grades 9 12
correlated to the Sunshine State for Mathematics Grades 9 12 9/2002 2001 McDougal Littell Geometry 2001 correlated to the Florida Sunshine State for Mathematics Grades 9-12 Number Sense, Concepts, and
More informationTimed Automata: Semantics, Algorithms and Tools
Timed Automata: Semantics, Algorithms and Tools Johan Bengtsson and Wang Yi Uppsala University {johanb,yi}@it.uu.se Abstract. This chapter is to provide a tutorial and pointers to results and related work
More information5. Partitions and Relations Ch.22 of PJE.
5. Partitions and Relations Ch. of PJE. We now generalize the ideas of congruence classes of Z to classes of any set X. The properties of congruence classes that we start with here are that they are disjoint
More informationNPDA, CFG equivalence
NPDA, CFG equivalence Theorem A language L is recognized by a NPDA iff L is described by a CFG. Must prove two directions: ( ) L is recognized by a NPDA implies L is described by a CFG. ( ) L is described
More informationOn the Exponent of the All Pairs Shortest Path Problem
On the Exponent of the All Pairs Shortest Path Problem Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Zvi Galil Department of Computer Science Sackler Faculty
More informationAn Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints Mathias Péron, Nicolas Halbwachs To cite this version: Mathias Péron, Nicolas Halbwachs. An Abstract Domain Extending
More informationb 1 b 2.. b = b m A = [a 1,a 2,...,a n ] where a 1,j a 2,j a j = a m,j Let A R m n and x 1 x 2 x = x n
Lectures -2: Linear Algebra Background Almost all linear and nonlinear problems in scientific computation require the use of linear algebra These lectures review basic concepts in a way that has proven
More informationCours M.2-6 «Interprétation abstraite: applications à la vérification et à l analyse statique» Examen partiel. Patrick Cousot.
Master Parisien de Recherche en Informatique École normale supérieure Année scolaire 2010/2011 Cours M.2-6 «Interprétation abstraite: applications à la vérification et à l analyse statique» Examen partiel
More informationOgden s Lemma for CFLs
Ogden s Lemma for CFLs Theorem If L is a context-free language, then there exists an integer l such that for any u L with at least l positions marked, u can be written as u = vwxyz such that 1 x and at
More informationWeek 4-5: Binary Relations
1 Binary Relations Week 4-5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationCMPS 6610 Fall 2018 Shortest Paths Carola Wenk
CMPS 6610 Fall 018 Shortest Paths Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk Paths in graphs Consider a digraph G = (V, E) with an edge-weight function w
More information9. Quantifier-free Equality and Data Structures
9. Quantifier-free Equality and Data Structures The Theory of Equality T E Σ E : {=, a, b, c,..., f, g, h,..., p, q, r,...} uninterpreted symbols: constants a, b, c,... functions f, g, h,... predicates
More informationLearning Outcomes Framework
Learning Outcomes Framework May 2004 Mathematics Grades 7 9 Learning Outcomes Framework Mathematics Grades 7 9 GRADE 7 Grade 7 GCO A: Students will demonstrate number sense and apply number-theory concepts.
More informationSECONDARY MATHEMATICS I
SECONDARY MATHEMATICS I The fundamental purpose of SECONDARY Mathematics I is to formalize and extend the mathematics that students learned in the middle grades. The critical areas, organized into units,
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationDynamic Programming: Shortest Paths and DFA to Reg Exps
CS 374: Algorithms & Models of Computation, Spring 207 Dynamic Programming: Shortest Paths and DFA to Reg Exps Lecture 8 March 28, 207 Chandra Chekuri (UIUC) CS374 Spring 207 / 56 Part I Shortest Paths
More informationDFA to Regular Expressions
DFA to Regular Expressions Proposition: If L is regular then there is a regular expression r such that L = L(r). Proof Idea: Let M = (Q,Σ, δ, q 1, F) be a DFA recognizing L, with Q = {q 1,q 2,...q n },
More informationand e 2 ~ e 2 iff e 1
Section 4. Equivalence Relations A binary relation is an equivalence relation if it has the three properties reflexive, symmetric, and transitive (RST). Examples. a. Equality on any set. b. x ~ y iff x
More informationCME Project, Geometry 2009 Correlated to: Kentucky Core Content for Mathematics Assessment 4.1 (High School, Grade 11)
Number Properties and Operations High school students should enter high school with a strong background in rational numbers and numerical operations and expand this to real numbers. This becomes the foundation
More informationChapter 0: Preliminaries
Chapter 0: Preliminaries Adam Sheffer March 28, 2016 1 Notation This chapter briefly surveys some basic concepts and tools that we will use in this class. Graduate students and some undergrads would probably
More informationCSC 1700 Analysis of Algorithms: Warshall s and Floyd s algorithms
CSC 1700 Analysis of Algorithms: Warshall s and Floyd s algorithms Professor Henry Carter Fall 2016 Recap Space-time tradeoffs allow for faster algorithms at the cost of space complexity overhead Dynamic
More informationTemporal Constraint Networks
Ch. 5b p.1/49 Temporal Constraint Networks Addition to Chapter 5 Ch. 5b p.2/49 Outline Temporal reasoning Qualitative networks The interval algebra The point algebra Quantitative temporal networks Reference:
More informationSolving the MWT. Recall the ILP for the MWT. We can obtain a solution to the MWT problem by solving the following ILP:
Solving the MWT Recall the ILP for the MWT. We can obtain a solution to the MWT problem by solving the following ILP: max subject to e i E ω i x i e i C E x i {0, 1} x i C E 1 for all critical mixed cycles
More informationTemporal Constraint Networks
Ch. 6b p.1/49 Temporal Constraint Networks Addition to Chapter 6 Ch. 6b p.2/49 Outline Temporal reasoning Qualitative networks The interval algebra The point algebra Quantitative temporal networks Reference:
More information