Delta-net: Real-time Network Verification Using Atoms
|
|
- Polly Quinn
- 6 years ago
- Views:
Transcription
1 Delta-net: Real-time Network Verification Using Atoms Alex Horn 1, Ali Kheradmand 2 and Mukul R. Prasad 1 1 Fujitsu Labs of America 2 University of Illinois at Urbana-Champaign (Internship) NSDI 2017, Boston, March 29
2 Context: Network Verification 1 Control Plane Network [Canini et al., NSDI 2012], NICE [Ball et al., PLDI 2014], VeriCon [Fayaz et., NSDI 2016], BUZZ [Stoenescu et al., SIGCOMM 2016], SymNet [Fogel et al., NSDI 2015], Batfish [Lopes et al., NSDI 2015], NoD in Z3 Staged, or actual data plane [Khurshid et al., NSDI 2013], Veriflow [Kazemian et al., NSDI 2013], NetPlumber [Yang and Lam, ICNP 2013], AP Verifier Goal: detect network outages before they occur
3 Context: Network Verification 2 Undecidable Control Plane Network [Canini et al., NSDI 2012], NICE [Ball et al., PLDI 2014], VeriCon [Fayaz et., NSDI 2016], BUZZ [Stoenescu et al., SIGCOMM 2016], SymNet [Fogel et al., NSDI 2015], Batfish [Lopes et al., NSDI 2015], NoD in Z3 Decidable Staged, or actual data plane [Khurshid et al., NSDI 2013], Veriflow [Kazemian et al., NSDI 2013], NetPlumber [Yang and Lam, ICNP 2013], AP Verifier Goal: detect network outages before they occur
4 Big Picture of Real-time Network Verification 2 Properties + e.g., forwarding loop Staged, or actual data plane Forwarding Table Data Plane Checker Priority IP Prefix Action Next Hop /31 Forward Forwarding Rule z z z Errors
5 Taxonomy Real-time Network Verification Packet Equivalence Classes [Khurshid et al., NSDI 2013] [Kazemian et al., NSDI 2013] [Yang and Lam, ICNP 2013] Incremental Network Verification [Khurshid et al., NSDI 2013] 4
6 Taxonomy New Local Similarity Real-time Network Verification Packet Equivalence Classes [Khurshid et al., NSDI 2013] [Kazemian et al., NSDI 2013] [Yang and Lam, ICNP 2013] Incremental Network Verification [Khurshid et al., NSDI 2013] 5
7 Incremental Network Verification 5 Data plane 2 Control Plane Data plane 2 1 Data plane 2 2 Network Data plane k
8 Incremental Network Verification 6 Data plane 2 Control Plane Data plane 2 1 Possibly a lot of overlap 2 Data plane 2 Network Data plane k
9 Incremental Network Verification 7 Data plane 2 Control Plane Data plane 2 1 Possibly a lot of overlap 2 Data plane 2 Network Data plane k Problem: disruptive changes (e.g. outages) are still challenging to analyze in real-time.
10 Our Contribution: Delta-net 9 delta of deltas Exploit similarity among forwarding behavior of packets through parts of the network, rather than its entirety. Experiments: x faster on network-wide use cases Example next...
11 Forwarding Graphs Per Equivalence Class 10 s 2 r 2 s 3 r 4 Highest priority s 1 r 4 s 4 r 2 Lowest priority range of IP addresses
12 Forwarding Graphs Per Equivalence Class 11 s 2 r 2 s 3 r 4 s 1 r 4 s 4 r 2
13 Forwarding Graphs Per Equivalence Class 12 s 2 r 2 s 3 r 4 s 1 r 4 s 4 r 2
14 Forwarding Graphs Per Equivalence Class 13 s 2 r 2 s 3 r 4 s 1 r 4 s 4 r 2
15 Our Contribution: Delta-net 14 delta of deltas α 2, α = α 1 α 3 α 2, α 3, α 4 Rather than re-computing forwarding graphs incrementally maintain a single edge-labelled graph; represents all packet flows.
16 Our Contribution: Delta-net 15 delta of deltas α 2, α = α 1 α 3 α 2, α 3, α 4 Rather than re-computing forwarding graphs incrementally maintain a single edge-labelled graph; represents all packet flows. Single graph data structure to answer reachability queries, exposed through a simple C++ API.
17 Our Contribution: Delta-net 16 delta of deltas atoms α 2, α = α 1 α 3 α 2, α 3, α 4 Rather than re-computing forwarding graphs incrementally maintain a single edge-labelled graph; represents all packet flows. Single graph data structure to answer reachability queries, exposed through a simple C++ API.
18 Atoms Complex Stuff = Σ Simpler Stuff Example: factorization into prime numbers, e.g = For IP prefix based networks, atoms: α 1 α 2 α 3 range of IP addresses 17
19 Compactness of Atoms 18 More compact than a Patricia tree, e.g. consider α 0 = [0 : 10): [0 : 8) = 00*** [0 : 8) [8 : 10) = 0100* 0 [8 : 10)
20 Atoms and Graph Transformation 19 s 2 s 3 r 2 α 1 α 2 α 3 r 4 s 1 s 4 r 2
21 Atoms and Graph Transformation 20 s 2 s 3 r 2 α 1 α 2 α 3 r 4 s 1 s 4 r 2 α 2, α 3 α 1, α 2, α 3 α 3
22 Atoms and Graph Transformation 21 s 2 s 3 r 2 α 1 α 4 α 2 α 3 r 4 s 1 r 4 s 4 r 2 α 2, α 3 α 1, α 2, α 3, α 4 α 3
23 Atoms and Graph Transformation 22 s 2 s 3 r 2 α 1 α 4 α 2 α 3 r 4 s 1 r 4 s 4 r 2 α 2, α 3 α 1, α 2, α 3, α 4 α 3
24 Atoms and Graph Transformation 23 s 2 s 3 r 2 α 1 α 4 α 2 α 3 r 4 s 1 r 4 s 4 r 2 α 2, α 3 α 2, α 3 α 1, α 2, α 3, α 4 α 3 α 1 α 3 Graph Transformation α 2, α 3, α 4
25 High-level Flowchart 24 Start Modify forwarding table New atoms required? Yes No Create new atoms Refine precision of abstraction Yes Transform edge-labelled graph Check properties More modifications? End No
26 All-Pairs Reachability 25 Essential for Datalog-style what-if queries: α 2, α 3 α 1, α 2 α 3 α 2, α 3 Adaptation of Floyd-Warshall Algorithm
27 All-Pairs Reachability 26 Essential for Datalog-style what-if queries: α 2 α 2, α 3 α 1, α 2 α 3 α 2, α 3 Adaptation of Floyd-Warshall Algorithm
28 All-Pairs Reachability 27 Essential for Datalog-style what-if queries: α 3 α 2 α 2, α 3 α 1, α 2 α 3 α 2, α 3 Adaptation of Floyd-Warshall Algorithm
29 Experimental Setup (2 Classes of Data Sets) 28 Synthetic data sets similar to [Zeng et al., NSDI 2014] Rocketfuel and Berkeley topologies from [Narayana et al., NSDI 2016] IP prefixes from RouteViews project SDN-IP [Lin et al., SIGCOMM 2013] in ONOS Globally deployed, ONOS flagship application
30 SDN-IP Experimental Setup 29
31 Data Sets 30 Hundreds of million IP prefix rule insertions + removals Synthetic SDN-IP
32 Experiments: Measuring Rule Updates 31 Find all forwarding loops introduced by a rule insertion.
33 Experiments: Measuring Rule Updates 32 Find all forwarding loops introduced by a rule insertion. Vast majority of rule updates analyzed in << 1 ms
34 Experiments: Beyond Network Updates 33 What parts of the network are affected by link failures? Query proposed by [Khurshid et al., NSDI 2013]. Summary: Delta-net can answer queries where Veriflow-RI times out.
35 Concluding Remarks 34 Delta-net, a new real-time data plane checker. Our research considers the delta of deltas. Opens up new Datalog-style use cases, previously out of reach. Data sets publically available now: For questions and comments, contact: ahorn@us.fujitsu.com. We are also looking for industry/academic partners, interns etc. Future work: Parallelization Multi-range support Avoid space/time trade-offs, at what cost for query expressiveness?
CSC 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 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 informationSoftware Verification using Predicate Abstraction and Iterative Refinement: Part 1
using Predicate Abstraction and Iterative Refinement: Part 1 15-414 Bug Catching: Automated Program Verification and Testing Sagar Chaki November 28, 2011 Outline Overview of Model Checking Creating Models
More informationRouting Algorithms. CS60002: Distributed Systems. Pallab Dasgupta Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur
Routing Algorithms CS60002: Distributed Systems Pallab Dasgupta Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur Main Features Table Computation The routing tables must be computed
More informationDiagnosing Missing Events in Distributed Systems with Negative Provenance
Diagnosing Missing Events in Distributed Systems with Negative Provenance Yang Wu* Andreas Haeberlen* * Mingchen Zhao* Wenchao Zhou+ University of Pennsylvania + Boon Thau Loo* Georgetown University 1
More informationiretilp : An efficient incremental algorithm for min-period retiming under general delay model
iretilp : An efficient incremental algorithm for min-period retiming under general delay model Debasish Das, Jia Wang and Hai Zhou EECS, Northwestern University, Evanston, IL 60201 Place and Route Group,
More informationUnderstanding IC3. Aaron R. Bradley. ECEE, CU Boulder & Summit Middle School. Understanding IC3 1/55
Understanding IC3 Aaron R. Bradley ECEE, CU Boulder & Summit Middle School Understanding IC3 1/55 Further Reading This presentation is based on Bradley, A. R. Understanding IC3. In SAT, June 2012. http://theory.stanford.edu/~arbrad
More informationScattering amplitudes and the Feynman rules
Scattering amplitudes and the Feynman rules based on S-10 We have found Z( J ) for the phi-cubed theory and now we can calculate vacuum expectation values of the time ordered products of any number of
More informationCS 410/584, Algorithm Design & Analysis, Lecture Notes 4
CS 0/58,, Biconnectivity Let G = (N,E) be a connected A node a N is an articulation point if there are v and w different from a such that every path from 0 9 8 3 5 7 6 David Maier Biconnected Component
More informationComplex Networks CSYS/MATH 303, Spring, Prof. Peter Dodds
Complex Networks CSYS/MATH 303, Spring, 2011 Prof. Peter Dodds Department of Mathematics & Statistics Center for Complex Systems Vermont Advanced Computing Center University of Vermont Licensed under the
More informationA Coalgebraic Decision Procedure for NetKAT
A Coalgebraic Decision Procedure for NetKAT Dexter Kozen Cornell University MFPS XXX June 12, 2014 Dexter Kozen June 12, 2014 A Coalgebraic Decision Procedure for NetKAT 1 / 44 NetKAT Collaborators Carolyn
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 informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CSE 5311 Lecture 21 Single-Source Shortest Paths Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 Single-Source
More information1. (12 points) Give a table-driven parse table for the following grammar: 1) X ax 2) X P 3) P DT 4) T P 5) T ε 7) D 1
1. (12 points) Give a table-driven parse table for the following grammar: 1) X ax 2) X P 3) P DT 4) T P 5) T ε 6) D 0 7) D 1 4. Recall that our class database has the following schemas: SNAP(StudentID,
More informationSummary of free theory: one particle state: vacuum state is annihilated by all a s: then, one particle state has normalization:
The LSZ reduction formula based on S-5 In order to describe scattering experiments we need to construct appropriate initial and final states and calculate scattering amplitude. Summary of free theory:
More informationBinary Decision Diagrams
Binary Decision Diagrams An Introduction and Some Applications Manas Thakur PACE Lab, IIT Madras Manas Thakur (IIT Madras) BDDs 1 / 25 Motivating Example Binary decision tree for a truth table Manas Thakur
More informationREVIEW REVIEW. Quantum Field Theory II
Quantum Field Theory II PHYS-P 622 Radovan Dermisek, Indiana University Notes based on: M. Srednicki, Quantum Field Theory Chapters: 13, 14, 16-21, 26-28, 51, 52, 61-68, 44, 53, 69-74, 30-32, 84-86, 75,
More informationQuantum Field Theory II
Quantum Field Theory II PHYS-P 622 Radovan Dermisek, Indiana University Notes based on: M. Srednicki, Quantum Field Theory Chapters: 13, 14, 16-21, 26-28, 51, 52, 61-68, 44, 53, 69-74, 30-32, 84-86, 75,
More informationCSE 4502/5717 Big Data Analytics Spring 2018; Homework 1 Solutions
CSE 502/5717 Big Data Analytics Spring 2018; Homework 1 Solutions 1. Consider the following algorithm: for i := 1 to α n log e n do Pick a random j [1, n]; If a[j] = a[j + 1] or a[j] = a[j 1] then output:
More informationReview of scalar field theory. Srednicki 5, 9, 10
Review of scalar field theory Srednicki 5, 9, 10 2 The LSZ reduction formula based on S-5 In order to describe scattering experiments we need to construct appropriate initial and final states and calculate
More informationCS 5522: Artificial Intelligence II
CS 5522: Artificial Intelligence II Bayes Nets: Independence Instructor: Alan Ritter Ohio State University [These slides were adapted from CS188 Intro to AI at UC Berkeley. All materials available at http://ai.berkeley.edu.]
More informationQuantum Field Theory II
Quantum Field Theory II PHYS-P 622 Radovan Dermisek, Indiana University Notes based on: M. Srednicki, Quantum Field Theory Chapters: 13, 14, 16-21, 26-28, 51, 52, 61-68, 44, 53, 69-74, 30-32, 84-86, 75,
More informationIC3 and Beyond: Incremental, Inductive Verification
IC3 and Beyond: Incremental, Inductive Verification Aaron R. Bradley ECEE, CU Boulder & Summit Middle School IC3 and Beyond: Incremental, Inductive Verification 1/62 Induction Foundation of verification
More informationCSE182-L7. Protein Sequence Analysis Patterns (regular expressions) Profiles HMM Gene Finding CSE182
CSE182-L7 Protein Sequence Analysis Patterns (regular expressions) Profiles HMM Gene Finding 10-07 CSE182 Bell Labs Honors Pattern matching 10-07 CSE182 Just the Facts Consider the set of all substrings
More informationDryVR: Data-driven verification and compositional reasoning for automotive systems
DryVR: Data-driven verification and compositional reasoning for automotive systems Chuchu Fan, Bolun Qi, Sayan Mitra, Mahesh Viswannathan University of Illinois at Urbana-Champaign CAV 2017, Heidelberg,
More informationDynamic Scheduling for Work Agglomeration on Heterogeneous Clusters
Dynamic Scheduling for Work Agglomeration on Heterogeneous Clusters Jonathan Lifflander, G. Carl Evans, Anshu Arya, Laxmikant Kale University of Illinois Urbana-Champaign May 25, 2012 Work is overdecomposed
More informationDynamic Programming: Shortest Paths and DFA to Reg Exps
CS 374: Algorithms & Models of Computation, Fall 205 Dynamic Programming: Shortest Paths and DFA to Reg Exps Lecture 7 October 22, 205 Chandra & Manoj (UIUC) CS374 Fall 205 / 54 Part I Shortest Paths with
More informationFinite-State Model Checking
EECS 219C: Computer-Aided Verification Intro. to Model Checking: Models and Properties Sanjit A. Seshia EECS, UC Berkeley Finite-State Model Checking G(p X q) Temporal logic q p FSM Model Checker Yes,
More informationA Different Kind of Flow Analysis. David M Nicol University of Illinois at Urbana-Champaign
A Different Kind of Flow Analysis David M Nicol University of Illinois at Urbana-Champaign 2 What Am I Doing Here??? Invite for ICASE Reunion Did research on Peformance Analysis Supporting Supercomputing
More informationAutomatic Verification of Parameterized Data Structures
Automatic Verification of Parameterized Data Structures Jyotirmoy V. Deshmukh, E. Allen Emerson and Prateek Gupta The University of Texas at Austin The University of Texas at Austin 1 Outline Motivation
More informationcs/ee/ids 143 Communication Networks
cs/ee/ids 143 Communication Networks Chapter 5 Routing Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also
More informationBayes Nets: Independence
Bayes Nets: Independence [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available at http://ai.berkeley.edu.] Bayes Nets A Bayes
More informationPOLYNOMIAL SPACE QSAT. Games. Polynomial space cont d
T-79.5103 / Autumn 2008 Polynomial Space 1 T-79.5103 / Autumn 2008 Polynomial Space 3 POLYNOMIAL SPACE Polynomial space cont d Polynomial space-bounded computation has a variety of alternative characterizations
More informationProperty Directed Equivalence via Abstract Simulation. Grigory Fedyukovich, Arie Gurfinkel, and Natasha Sharygina
Property Directed Equivalence via Abstract Simulation Grigory Fedyukovich, Arie Gurfinkel, and Natasha Sharygina CAV, Jul 23, 2016 Motivation / Goals Little Leaks Add Up to Big Bills software safety must
More informationSoftware Verification
Software Verification Grégoire Sutre LaBRI, University of Bordeaux, CNRS, France Summer School on Verification Technology, Systems & Applications September 2008 Grégoire Sutre Software Verification VTSA
More informationKindergarten. Energy. Slide 1 / 33 Slide 2 / 33. Slide 3 / 33. Slide 4 / 33. Slide 6 / 33. Slide 5 / 33. Energy. Teacher Page.
Slide 1 / 33 Slide 2 / 33 Kindergarten 2015-12-02 www.njctl.org Slide 3 / 33 Table of Contents Slide 4 / 33 Types of Transfer Click on the topic to go to that section This presentation is designed to be
More informationKnowledge Compilation and Theory Approximation. Henry Kautz and Bart Selman Presented by Kelvin Ku
Knowledge Compilation and Theory Approximation Henry Kautz and Bart Selman Presented by Kelvin Ku kelvin@cs.toronto.edu 1 Overview Problem Approach Horn Theory and Approximation Computing Horn Approximations
More informationRoad to GIS, PSE s past, present and future
Road to GIS, PSE s past, present and future PSE Gas Mapping History 1840 Early 1900 s Gas piping was captured in Field Books which were than converted onto Mylar maps using Pen and Ink. 1955 Washington
More informationAP Environmental Science Math Problems
Name AP Environmental Science Math Problems After reviewing APES Math Prep and suggested resources. Please answer the following questions. Solve the problems to the questions using the Math answer sheets
More informationLab 16 Forces: Hooke s Law
Lab 16 Forces: Hooke s Law Name Partner s Name 1. Introduction/Theory Consider Figure 1a, which shows a spring in its equilibrium position that is, the spring is neither compressed nor stretched. If we
More informationBotany Math Problems. What question was being investigated with this experiment? What is the possible hypothesis for this experiment?
Botany Math Problems Problem set 1 A particular species of flower will only flower at particular times of the year. An experiment was done with 100 plants. 50 of the plants were exposed to 14 hours of
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 informationAnnouncements. CS 188: Artificial Intelligence Fall Causality? Example: Traffic. Topology Limits Distributions. Example: Reverse Traffic
CS 188: Artificial Intelligence Fall 2008 Lecture 16: Bayes Nets III 10/23/2008 Announcements Midterms graded, up on glookup, back Tuesday W4 also graded, back in sections / box Past homeworks in return
More informationAnalysis of Algorithms. Outline. Single Source Shortest Path. Andres Mendez-Vazquez. November 9, Notes. Notes
Analysis of Algorithms Single Source Shortest Path Andres Mendez-Vazquez November 9, 01 1 / 108 Outline 1 Introduction Introduction and Similar Problems General Results Optimal Substructure Properties
More informationTemporal Modeling and Basic Speech Recognition
UNIVERSITY ILLINOIS @ URBANA-CHAMPAIGN OF CS 498PS Audio Computing Lab Temporal Modeling and Basic Speech Recognition Paris Smaragdis paris@illinois.edu paris.cs.illinois.edu Today s lecture Recognizing
More informationSanjit A. Seshia EECS, UC Berkeley
EECS 219C: Computer-Aided Verification Explicit-State Model Checking: Additional Material Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: G. Holzmann Checking if M satisfies : Steps 1. Compute Buchi
More informationSiteswap state diagrams
Siteswap state diagrams Hans Lundmark (halun@mai.liu.se) October, 200 This document contains diagrams that can be used for quickly finding valid siteswap juggling patterns and transitions between different
More informationSAT-Based Verification with IC3: Foundations and Demands
SAT-Based Verification with IC3: Foundations and Demands Aaron R. Bradley ECEE, CU Boulder & Summit Middle School SAT-Based Verification with IC3:Foundations and Demands 1/55 Induction Foundation of verification
More informationRandomized Selection on the GPU. Laura Monroe, Joanne Wendelberger, Sarah Michalak Los Alamos National Laboratory
Randomized Selection on the GPU Laura Monroe, Joanne Wendelberger, Sarah Michalak Los Alamos National Laboratory High Performance Graphics 2011 August 6, 2011 Top k Selection on GPU Output the top k keys
More informationImpression Store: Compressive Sensing-based Storage for. Big Data Analytics
Impression Store: Compressive Sensing-based Storage for Big Data Analytics Jiaxing Zhang, Ying Yan, Liang Jeff Chen, Minjie Wang, Thomas Moscibroda & Zheng Zhang Microsoft Research The Curse of O(N) in
More informationCompositional Reasoning
EECS 219C: Computer-Aided Verification Compositional Reasoning and Learning for Model Generation Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: Avrim Blum Compositional Reasoning S. A. Seshia 2 1
More informationTime Dependent Contraction Hierarchies Basic Algorithmic Ideas
Time Dependent Contraction Hierarchies Basic Algorithmic Ideas arxiv:0804.3947v1 [cs.ds] 24 Apr 2008 Veit Batz, Robert Geisberger and Peter Sanders Universität Karlsruhe (TH), 76128 Karlsruhe, Germany
More informationINTRODUCTION TO SCIENCE CHAPTER 1
INTRODUCTION TO SCIENCE CHAPTER 1 1 Science is the study of Everything!! A way of learning about the natural world. Scientist: a person who studies, or has expert WHAT IS SCIENCE? knowledge of a natural
More informationGradient Coding: Mitigating Stragglers in Distributed Gradient Descent.
Gradient Coding: Mitigating Stragglers in Distributed Gradient Descent. Alex Dimakis joint work with R. Tandon, Q. Lei, UT Austin N. Karampatziakis, Microsoft Setup Problem: Large-scale learning. Given
More informationAsymptotics, asynchrony, and asymmetry in distributed consensus
DANCES Seminar 1 / Asymptotics, asynchrony, and asymmetry in distributed consensus Anand D. Information Theory and Applications Center University of California, San Diego 9 March 011 Joint work with Alex
More informationThe Immerman-Szelepcesnyi Theorem and a hard problem for EXPSPACE
The Immerman-Szelepcesnyi Theorem and a hard problem for EXPSPACE Outline for today A new complexity class: co-nl Immerman-Szelepcesnyi: NoPATH is complete for NL Introduction to Vector Addition System
More informationFormal Verification Techniques. Riccardo Sisto, Politecnico di Torino
Formal Verification Techniques Riccardo Sisto, Politecnico di Torino State exploration State Exploration and Theorem Proving Exhaustive exploration => result is certain (correctness or noncorrectness proof)
More informationSocViz: Visualization of Facebook Data
SocViz: Visualization of Facebook Data Abhinav S Bhatele Department of Computer Science University of Illinois at Urbana Champaign Urbana, IL 61801 USA bhatele2@uiuc.edu Kyratso Karahalios Department of
More informationCS 243 Lecture 11 Binary Decision Diagrams (BDDs) in Pointer Analysis
CS 243 Lecture 11 Binary Decision Diagrams (BDDs) in Pointer Analysis 1. Relations in BDDs 2. Datalog -> Relational Algebra 3. Relational Algebra -> BDDs 4. Context-Sensitive Pointer Analysis 5. Performance
More informationData mining in large graphs
Data mining in large graphs Christos Faloutsos University www.cs.cmu.edu/~christos ALLADIN 2003 C. Faloutsos 1 Outline Introduction - motivation Patterns & Power laws Scalability & Fast algorithms Fractals,
More informationThe Max Flow Problem
The Max Flow Problem jla,jc@imm.dtu.dk Informatics and Mathematical Modelling Technical University of Denmark 1 1 3 4 6 6 1 2 4 3 r 3 2 4 5 7 s 6 2 1 8 1 3 3 2 6 2 Max-Flow Terminology We consider a digraph
More informationCS 188: Artificial Intelligence Fall 2008
CS 188: Artificial Intelligence Fall 2008 Lecture 14: Bayes Nets 10/14/2008 Dan Klein UC Berkeley 1 1 Announcements Midterm 10/21! One page note sheet Review sessions Friday and Sunday (similar) OHs on
More informationb) since the remainder is 0 I need to factor the numerator. Synthetic division tells me this is true
Section 5.2 solutions #1-10: a) Perform the division using synthetic division. b) if the remainder is 0 use the result to completely factor the dividend (this is the numerator or the polynomial to the
More informationTime Petri Nets. Miriam Zia School of Computer Science McGill University
Time Petri Nets Miriam Zia School of Computer Science McGill University Timing Specifications Why is time introduced in Petri nets? To model interaction between activities taking into account their start
More information9 Classification. 9.1 Linear Classifiers
9 Classification This topic returns to prediction. Unlike linear regression where we were predicting a numeric value, in this case we are predicting a class: winner or loser, yes or no, rich or poor, positive
More informationSingle Source Shortest Paths
CMPS 00 Fall 017 Single Source 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
More informationLearning and Neural Networks
Artificial Intelligence Learning and Neural Networks Readings: Chapter 19 & 20.5 of Russell & Norvig Example: A Feed-forward Network w 13 I 1 H 3 w 35 w 14 O 5 I 2 w 23 w 24 H 4 w 45 a 5 = g 5 (W 3,5 a
More informationComputer Model of Spring-Mass System, Part 3 of Springs Lab
Computer Model of Spring-Mass System, Part 3 of Springs Lab QUESTIONS: Modeling the real world: Q1: Can a computer program of a mass-spring system, based on the finite-time form of the momentum principle
More informationBounded Retransmission in Event-B CSP: a Case Study
Available online at www.sciencedirect.com Electronic Notes in Theoretical Computer Science 280 (2011) 69 80 www.elsevier.com/locate/entcs Bounded Retransmission in Event-B CSP: a Case Study Steve Schneider
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 informationCSEP 573: Artificial Intelligence
CSEP 573: Artificial Intelligence Bayesian Networks: Inference Ali Farhadi Many slides over the course adapted from either Luke Zettlemoyer, Pieter Abbeel, Dan Klein, Stuart Russell or Andrew Moore 1 Outline
More informationSemi-asynchronous. Fault Diagnosis of Discrete Event Systems ALEJANDRO WHITE DR. ALI KARIMODDINI OCTOBER
Semi-asynchronous Fault Diagnosis of Discrete Event Systems ALEJANDRO WHITE DR. ALI KARIMODDINI OCTOBER 2017 NC A&T State University http://www.ncat.edu/ Alejandro White Semi-asynchronous http://techlav.ncat.edu/
More informationSlides for CIS 675. Huffman Encoding, 1. Huffman Encoding, 2. Huffman Encoding, 3. Encoding 1. DPV Chapter 5, Part 2. Encoding 2
Huffman Encoding, 1 EECS Slides for CIS 675 DPV Chapter 5, Part 2 Jim Royer October 13, 2009 A toy example: Suppose our alphabet is { A, B, C, D }. Suppose T is a text of 130 million characters. What is
More informationA practical introduction to active automata learning
A practical introduction to active automata learning Bernhard Steffen, Falk Howar, Maik Merten TU Dortmund SFM2011 Maik Merten, learning technology 1 Overview Motivation Introduction to active automata
More informationLesson 2: Exploring Quadratic Relations Quad Regression Unit 5 Quadratic Relations
(A) Lesson Context BIG PICTURE of this UNIT: CONTEXT of this LESSON: How do we analyze and then work with a data set that shows both increase and decrease What is a parabola and what key features do they
More informationCSCB63 Winter Week 11 Bloom Filters. Anna Bretscher. March 30, / 13
CSCB63 Winter 2019 Week 11 Bloom Filters Anna Bretscher March 30, 2019 1 / 13 Today Bloom Filters Definition Expected Complexity Applications 2 / 13 Bloom Filters (Specification) A bloom filter is a probabilistic
More informationDisplacement - the vector relation to distance, but as measured from a starting reference point.
Section 1.2 Vector Quantities : Displacement - the vector relation to distance, but as measured from a starting reference point. We will start with some simple one dimensional displacement problems. An
More informationComputation Tree Logic (CTL) & Basic Model Checking Algorithms
Computation Tree Logic (CTL) & Basic Model Checking Algorithms Martin Fränzle Carl von Ossietzky Universität Dpt. of Computing Science Res. Grp. Hybride Systeme Oldenburg, Germany 02917: CTL & Model Checking
More informationComplexity. Complexity Theory Lecture 3. Decidability and Complexity. Complexity Classes
Complexity Theory 1 Complexity Theory 2 Complexity Theory Lecture 3 Complexity For any function f : IN IN, we say that a language L is in TIME(f(n)) if there is a machine M = (Q, Σ, s, δ), such that: L
More informationCS583 Lecture 11. Many slides here are based on D. Luebke slides. Review: Dynamic Programming
// CS8 Lecture Jana Kosecka Dynamic Programming Greedy Algorithms Many slides here are based on D. Luebke slides Review: Dynamic Programming A meta-technique, not an algorithm (like divide & conquer) Applicable
More informationCS 173 Lecture 2: Propositional Logic
CS 173 Lecture 2: Propositional Logic José Meseguer University of Illinois at Urbana-Champaign 1 Propositional Formulas A proposition is a statement that is either true, T or false, F. A proposition usually
More informationNewton s Second Law of Motion Force and Acceleration
Chapter 3 Reading Guide: Newton s Second Law of Motion Force and Acceleration Complete the Explore! Activity (p.37) 1. Compare the rate at which the book and paper fell when they were side-by-side: Name:
More informationCS 4407 Algorithms Lecture: Shortest Path Algorithms
CS 440 Algorithms Lecture: Shortest Path Algorithms Prof. Gregory Provan Department of Computer Science University College Cork 1 Outline Shortest Path Problem General Lemmas and Theorems. Algorithms Bellman-Ford
More informationMulti-Approximate-Keyword Routing Query
Bin Yao 1, Mingwang Tang 2, Feifei Li 2 1 Department of Computer Science and Engineering Shanghai Jiao Tong University, P. R. China 2 School of Computing University of Utah, USA Outline 1 Introduction
More informationInformation & Correlation
Information & Correlation Jilles Vreeken 11 June 2014 (TADA) Questions of the day What is information? How can we measure correlation? and what do talking drums have to do with this? Bits and Pieces What
More informationTimo Latvala. March 7, 2004
Reactive Systems: Safety, Liveness, and Fairness Timo Latvala March 7, 2004 Reactive Systems: Safety, Liveness, and Fairness 14-1 Safety Safety properties are a very useful subclass of specifications.
More informationIntroduction to Randomized Algorithms III
Introduction to Randomized Algorithms III Joaquim Madeira Version 0.1 November 2017 U. Aveiro, November 2017 1 Overview Probabilistic counters Counting with probability 1 / 2 Counting with probability
More informationLECTURE 30: Conservation of energy
Lectures Page 1 LECTURE 30: Conservation of energy Select LEARNING OBJECTIVES: i. ii. iii. iv. Differentiate between the vector nature of momentum conservation and the scalar nature of energy conservation.
More informationUNIT 9 (Chapter 7 BI) Polynomials and Factoring Name:
UNIT 9 (Chapter 7 BI) Polynomials and Factoring Name: The calendar and all assignments are subject to change. Students will be notified of any changes during class, so it is their responsibility to pay
More informationThe final is cumulative, but with more emphasis on chapters 3 and 4. There will be two parts.
Math 141 Review for Final The final is cumulative, but with more emphasis on chapters 3 and 4. There will be two parts. Part 1 (no calculator) graphing (polynomial, rational, linear, exponential, and logarithmic
More informationAlgorithms for pattern involvement in permutations
Algorithms for pattern involvement in permutations M. H. Albert Department of Computer Science R. E. L. Aldred Department of Mathematics and Statistics M. D. Atkinson Department of Computer Science D.
More informationNAME: PERIOD: DATE: LAB PARTNERS: LAB #16 SUBDUCTION BOUNDARIES*
NAME: PERIOD: DATE: LAB PARTNERS: LAB #16 SUBDUCTION BOUNDARIES* INTRODUCTION The vast majority of earthquakes occur at plate boundaries. The deepest earthquakes occur at subduction boundaries where lithosphere
More informationCS5371 Theory of Computation. Lecture 12: Computability III (Decidable Languages relating to DFA, NFA, and CFG)
CS5371 Theory of Computation Lecture 12: Computability III (Decidable Languages relating to DFA, NFA, and CFG) Objectives Recall that decidable languages are languages that can be decided by TM (that means,
More informationNeural Networks Learning the network: Backprop , Fall 2018 Lecture 4
Neural Networks Learning the network: Backprop 11-785, Fall 2018 Lecture 4 1 Recap: The MLP can represent any function The MLP can be constructed to represent anything But how do we construct it? 2 Recap:
More information2MHR. Protein structure classification is important because it organizes the protein structure universe that is independent of sequence similarity.
Protein structure classification is important because it organizes the protein structure universe that is independent of sequence similarity. A global picture of the protein universe will help us to understand
More informationYour Second Physics Simulation: A Mass on a Spring
Your Second Physics Simulation: A Mass on a Spring I. INTRODUCTION At this point I think everybody has a working bouncing ball program. In these programs the ball moves under the influence of a very simple
More informationLecture 2: MergeSort. CS 341: Algorithms. Thu, Jan 10 th 2019
Lecture 2: MergeSort CS 341: Algorithms Thu, Jan 10 th 2019 Outline For Today 1. Example 1: Sorting-Merge Sort-Divide & Conquer 2 Sorting u Input: An array of integers in arbitrary order 10 2 37 5 9 55
More informationIE418 Integer Programming
IE418: Integer Programming Department of Industrial and Systems Engineering Lehigh University 2nd February 2005 Boring Stuff Extra Linux Class: 8AM 11AM, Wednesday February 9. Room??? Accounts and Passwords
More information1 Newton s 2nd and 3rd Laws
Physics 13 - Winter 2007 Lab 2 Instructions 1 Newton s 2nd and 3rd Laws 1. Work through the tutorial called Newton s Second and Third Laws on pages 31-34 in the UW Tutorials in Introductory Physics workbook.
More informationP, NP, NP-Complete, and NPhard
P, NP, NP-Complete, and NPhard Problems Zhenjiang Li 21/09/2011 Outline Algorithm time complicity P and NP problems NP-Complete and NP-Hard problems Algorithm time complicity Outline What is this course
More information