Equivalence Checking. Sean Weaver

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Equivalence Checking. Sean Weaver"

Transcription

1 Equivlene Cheking Sen Wever

2 Equivlene Cheking Given two Boolen funtions, prove whether or not two they re funtionlly equivlent This tlk fouses speifilly on the mehnis of heking the equivlene of pirs of omintionl iruits

3 Types of Ciruits Comintionl Ciruit Digitl iruit No stte-holding elements No feedk loops Output is funtion of the urrent input Sequentil Ciruit Cn hve stte-holding elements Cn hve feedk loops Must trnsform (e.g. BMC) into omintionl iruit for equivlene heking

4 Ciruit Equivlene Cheking Cheking the equivlene of pir of iruits For ll possile input vetors (2 #input its ), the outputs of the two iruits must e equivlent Testing ll possile input-output pirs is CoNP- Hrd However, the equivlene hek of iruits with similr struture is esy [1] So, we must e le to identify shred struture, nd we need tool tht n effiiently solve NP-Complete prolems (Stisfiility solver, BDDs, Gröner Bsis solver, et.) 1. E. Golderg, Y. Novikov. How good n resolution sed ST-solver e? ST-2003, LNCS 2919, pp

5 Equivlene Cheking Uses Forml Verifition Prove whether low level implementtion mthes high level, or mthemtil, speifition Verifying Compiler Mintin the funtionlity of generted ode Version Control Use previous implementtions to mintin the orretness of future implementtions Funtionl Inversion Prove whether enode nd deode funtions re inverses of eh other

6

7 Given tht the input vriles (, B, C) re equivlent, verify output vriles (X, Y) re equivlent. 1. Conjoin speifition nd implementtion formuls, 2. dd the equivlene heking onstrint. Result This is lled miter formul. If unstisfile, the speifition nd implementtion re equivlent. ST solver n tell us this.

8 Exmple: re These Ciruits Equivlent? #1 C x #2 O 1 2 O 3 8 y

9 Exmple: Outline Rndom Simultion - Send rndom vetors through the two iruits, olleting pirs of ndidte equivlent nodes nd/inverter Grph Find more equivlent nodes y reting the IG of the iruits ST Sweeping Use ndidte equivlent nodes to guide ST serhes, merging IG nodes whih redues the omplexity of future ST serhes

10 Identifying Shred Struture n internl node in the first iruit my e equivlent to n internl node in the seond iruit Detet y using rndom simultion Perolte rndom vetors through oth iruits (fst trik - use 64-it words) Prtition nodes into equivlene lsses This n detet potentilly mny, high proility, ndidte equivlent nodes

11 Rndom Simultion #1 C x #2 O 1 2 O 3 8 y

12 Rndom Simultion #1 C 1 C 1 #2 O 0 O x y Bukets 1,4,7,8 0,2,3,5,6 Rndom Vetor: {=T, =T, =T}

13 Rndom Simultion #1 C 1 #2 O 0 O Rndom Vetor: {=F, =F, =F} x y Bukets 1,4 7,8 2,3,5,6 0

14 Rndom Simultion #1 C 1 #2 O 0 O Rndom Vetor: {=F, =F, =T} x y Bukets 1,4 7,8 2,6 3,5

15 Rndom Simultion #1 C x Bukets #2 O 1 2 O Rndom Vetor: {=T, =T, =F} 3 8 y 7,8 2,6 3,5

16 Exmple: Outline Rndom Simultion - Send rndom vetors through the two iruits, olleting pirs of ndidte equivlent nodes nd/inverter Grph Find more equivlent nodes y reting the IG of the iruits ST Sweeping Use ndidte equivlent nodes to guide ST serhes, merging IG nodes whih redues the omplexity of future ST serhes

17 Identifying Shred Struture Rndom simultion is proilisti nd/inverter Grph (IG) [2] Simple dt struture used to represent omintionl iruits Opertions re fst (dd node, merge nodes) 2.. Kuehlmnn, V. Pruthi, F. Krohm, nd M.K. Gni. Roust Boolen Resoning for Equivlene Cheking nd Funtionl Property Verifition. IEEE Trns. CD, Vol. 21, No. 12, pp (2002)

18 nd/inverter Grph #1 C x #2 O 1 2 O 3 8 y

19 nd/inverter Grph #2 O 1 2 O 3 8 y Use the IG dt struture to store iruits IG n quikly dd nodes nd merge equivlent nodes Struturl hshing is used Merging pir of equivlent nodes n use other nodes to e merged utomtilly, without need for ST proof

20 nd/inverter Grph #2 1 2 O 3 8 y Nodes represent ND gtes Edges represent inputs to n ND gte Edges my e inverted OR gtes must e onverted to ND gtes during IG retion

21 nd/inverter Grph # y

22 nd/inverter Grph # y

23 nd/inverter Grph # x 5 # y

24 nd/inverter Grph # x 5 # y

25 nd/inverter Grph # x 5 # y

26 nd/inverter Grph # x 5 # y

27 nd/inverter Grph # x 5 # y

28 Exmple: Outline Rndom Simultion - Send rndom vetors through the two iruits, olleting pirs of ndidte equivlent nodes nd/inverter Grph Find more equivlent nodes y reting the IG of the iruits ST Sweeping Use ndidte equivlent nodes to guide ST serhes, merging IG nodes whih redues the omplexity of future ST serhes

29 ST Sweeping Use ST to prove whether or not the ndidte equivlent nodes, from the rndom simultion phse, re equivlent The ndidte equivlent nodes re used s ut points Generte ST prolems tht re solved from inputs to outputs using the ndidte equivlent nodes s guide [3] 3.. Kuehlmnn. Dynmi Trnsition Reltion Simplifition for Bounded Property Cheking. In ICCD, 2004

30 ST Instnes Crete one ST instne for one (or more) pir of ndidte equivlent nodes ST instne enodes miter iruit Eh ST serh n result in the merger of equivlent IG nodes, reduing the omplexity of the IG

31 nd/inverter Grph # x 5 # y

32 Equivlenes x y Bukets 7?= 8 2?= 6 3?= 5

33 ST Solver Sys 3 = x y Bukets 7?= 8 2?= 6 3 = 5

34 Merge 3 nd x y Bukets 7?= 8 2?= 6 3 = 5

35 ST Solver Sys 2 = x y Bukets 7?= 8 2 = 6 3 = 5

36 Merge 6 nd x y Bukets 7?= 8 2 = 6 3 = 5

37 7 Struturlly Hshes to x y Bukets 7 = 8 2 = 6 3 = 5

38 x nd y Verified Equivlent x y Bukets 7 = 8 2 = 6 3 = 5

39 Exmple: Outline Rndom Simultion - Send rndom vetors through the two iruits, olleting pirs of ndidte equivlent nodes nd/inverter Grph Find more equivlent nodes y reting the IG of the iruits ST Sweeping Use ndidte equivlent nodes to guide ST serhes, merging IG nodes whih redues the omplexity of future ST serhes

40 Slides tken from. Biere. ST in Forml Hrdwre Verifition.

41 Slides tken from. Biere. ST in Forml Hrdwre Verifition.

42 Slides tken from. Biere. ST in Forml Hrdwre Verifition.

43 Slides tken from. Biere. ST in Forml Hrdwre Verifition.

44 Slides tken from. Biere. ST in Forml Hrdwre Verifition.

45 Slides tken from. Biere. ST in Forml Hrdwre Verifition.

46 Slides tken from. Biere. ST in Forml Hrdwre Verifition.

47 Slides tken from. Biere. ST in Forml Hrdwre Verifition.

48 Cryptol Cryptol is Hskell sed speifition lnguge for writing rypto-lgorithms Creted y Glois Connetions In. with support from NS ryptogrphers Cryptol speifitions n e trnsformed into IGs Cryptol lso hs uilt in equivlene heker (jig) Cryptol speifitions n e used to verify vrious implementtions C ode, VHDL, et.

49 Results - ES Verified Cryptol speifition of full rnk ES-128 funtionlly equivlent to NIST ompetition optimized C-ode Cryptol-ES IG hs 934,000 nodes NIST-ES IG hs 1,482,000 nodes 190,000 equivlent nodes found Using tehniques desried here plus speil ST heuristis < 1 minute on 2 GHz Pentium III

50 Results - VdW Vn der Werden numers W(k,r)=n Ple numers 1... n into k ukets so tht no rithmeti progression of length r exists in ny uket ssertion y Dr. Mihl Kouril W(2,6) = 1132 This is quite fet euse now only 6 numers re known nd no new ones hd een found sine 1979

51 Results VdW Dr. Kouril's solver is written in VHDL, runs on luster of FPGs t UC The solver hs exhusted the serh spe How to give onfidene tht VHDL ode is orret? Use equivlene heking!

52 Results VdW Wrote Cryptol speifitions for the three min VHDL funtions used Used Xilinx tools nd Cryptol to generte IGs from the VHDL ode Used the Cryptol equivlene heker (jig) to verify the VHDL ode Eh funtion hs possile inputs Totl time for ll three heks < 30 minutes

53 Referenes. Biere. Invited tlk - ST in Forml Hrdwre Verifition. 8th Intl. Conf; on Theory nd pplitions of Stisfiility Testing (ST'05), St. ndrews, Sotlnd, (2005). D. Brnd. Verifition of Lrge Synthesized Designs. Pro. Intl Conf. Computer-ided Design pp (1993). E. Golderg, Y. Novikov. How good n resolution sed ST-solver e? ST-2003, LNCS 2919, pp F. Krohm,. Kuehlmnn, nd. Mets. The Use of Rndom Simultion in Forml Verifition. Pro. of Int'l Conf. on Computer Design, Ot (1996).. Kuehlmnn, F. Krohm. Equivlene Cheking Using Cuts nd Heps. In Design utomtion Conferene (1997).. Kuehlmnn, V. Pruthi, F. Krohm, nd M. K. Gni. Roust Boolen Resoning for Equivlene Cheking nd Funtion Property Verifition. IEEE Trns. CD, Vol. 21, No. 12, pp (2002).. Kuehlmnn. Dynmi Trnsition Reltion Simplifition for Bounded Property Cheking. In ICCD (2004). J. Lewis. Cryptol, Domin Speifi Lnguge for Cryptogrphy. (2002).

OUTLINE SYSTEM-ON-CHIP DESIGN. GETTING STARTED WITH VHDL August 31, 2015 GAJSKI S Y-CHART (1983) TOP-DOWN DESIGN (1)

OUTLINE SYSTEM-ON-CHIP DESIGN. GETTING STARTED WITH VHDL August 31, 2015 GAJSKI S Y-CHART (1983) TOP-DOWN DESIGN (1) August 31, 2015 GETTING STARTED WITH VHDL 2 Top-down design VHDL history Min elements of VHDL Entities nd rhitetures Signls nd proesses Dt types Configurtions Simultor sis The testenh onept OUTLINE 3 GAJSKI

More information

CS 316: Gates and Logic

CS 316: Gates and Logic CS 36: Gtes nd Logi Kvit Bl Fll 27 Computer Siene Cornell University Announements Clss newsgroup reted Posted on we-pge Use it for prtner finding First ssignment is to find prtners P nd N Trnsistors PNP

More information

Quick Guide to Lisp Implementation

Quick Guide to Lisp Implementation isp Implementtion Hndout Pge 1 o 10 Quik Guide to isp Implementtion Representtion o si dt strutures isp dt strutures re lled S-epressions. The representtion o n S-epression n e roken into two piees, the

More information

Digital Electronics Basics: Combinational Logic

Digital Electronics Basics: Combinational Logic Digitl Eletronis Bsis: for Bsi Eletronis http://ktse.eie.polyu.edu.hk/eie29 by Prof. Mihel Tse Jnury 25 Digitl versus nlog So fr, our disussion bout eletronis hs been predominntly nlog, whih is onerned

More information

ISTM206: Lecture 3 Class Notes

ISTM206: Lecture 3 Class Notes IST06: Leture 3 Clss otes ikhil Bo nd John Frik 9-9-05 Simple ethod. Outline Liner Progrmming so fr Stndrd Form Equlity Constrints Solutions, Etreme Points, nd Bses The Representtion Theorem Proof of the

More information

The AVL Tree Rotations Tutorial

The AVL Tree Rotations Tutorial The AVL Tree Rottions Tutoril By John Hrgrove Version 1.0.1, Updted Mr-22-2007 Astrt I wrote this doument in n effort to over wht I onsider to e drk re of the AVL Tree onept. When presented with the tsk

More information

Verifying Business Processes using SPIN

Verifying Business Processes using SPIN Verifying Business Proesses using SPIN Wil Jnssen Telemtis Institute (Enshede, The Netherlnds) Rdu Mteesu INRIA Rhône-Alpes / VASY (Montonnot, Frne) Sjouke Muw Eindhoven University of Tehnology (Eindhoven,

More information

Words Symbols Diagram. abcde. a + b + c + d + e

Words Symbols Diagram. abcde. a + b + c + d + e Logi Gtes nd Properties We will e using logil opertions to uild mhines tht n do rithmeti lultions. It s useful to think of these opertions s si omponents tht n e hooked together into omplex networks. To

More information

Union, Intersection and Complement. Formal Foundations Computer Theory

Union, Intersection and Complement. Formal Foundations Computer Theory Union, Intersection nd Complement FAs Union, Intersection nd Complement FAs Forml Foundtions Computer Theory Ferury 21, 2013 This hndout shows (y exmples) how to construct FAs for the union, intersection

More information

10.3 Systems of Linear Equations: Determinants

10.3 Systems of Linear Equations: Determinants 758 CHAPTER 10 Systems of Equtions nd Inequlities 10.3 Systems of Liner Equtions: Determinnts OBJECTIVES 1 Evlute 2 y 2 Determinnts 2 Use Crmer s Rule to Solve System of Two Equtions Contining Two Vriles

More information

Basics of Logic Design: Boolean Algebra, Logic Gates. Administrative

Basics of Logic Design: Boolean Algebra, Logic Gates. Administrative Bsics of Logic Design: Boolen Alger, Logic Gtes Computer Science 104 Administrtive Homework #3 Due Sundy Midterm I Mondy in clss, closed ook, closed notes Ø Will provide IA32 instruction set hndout Ø Lst

More information

In the following there are presented four different kinds of simulation games for a given Büchi automaton A = :

In the following there are presented four different kinds of simulation games for a given Büchi automaton A = : Simultion Gmes Motivtion There re t lest two distinct purposes for which it is useful to compute simultion reltionships etween the sttes of utomt. Firstly, with the use of simultion reltions it is possile

More information

The area of the larger square is: IF it s a right triangle, THEN + =

The area of the larger square is: IF it s a right triangle, THEN + = 8.1 Pythgoren Theorem nd 2D Applitions The Pythgoren Theorem sttes tht IF tringle is right tringle, THEN the sum of the squres of the lengths of the legs equls the squre of the hypotenuse lengths. Tht

More information

Active Directory Service

Active Directory Service In order to lern whih questions hve een nswered orretly: 1. Print these pges. 2. Answer the questions. 3. Send this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following

More information

D e c i m a l s DECIMALS.

D e c i m a l s DECIMALS. D e i m l s DECIMALS www.mthletis.om.u Deimls DECIMALS A deiml numer is sed on ple vlue. 214.84 hs 2 hundreds, 1 ten, 4 units, 8 tenths nd 4 hundredths. Sometimes different 'levels' of ple vlue re needed

More information

Functions A B C D E F G H I J K L. Contents:

Functions A B C D E F G H I J K L. Contents: Funtions Contents: A reltion is n set of points whih onnet two vriles. A funtion, sometimes lled mpping, is reltion in whih no two different ordered pirs hve the sme -oordinte or first omponent. Algeri

More information

1. Definition, Basic concepts, Types 2. Addition and Subtraction of Matrices 3. Scalar Multiplication 4. Assignment and answer key 5.

1. Definition, Basic concepts, Types 2. Addition and Subtraction of Matrices 3. Scalar Multiplication 4. Assignment and answer key 5. . Definition, Bsi onepts, Types. Addition nd Sutrtion of Mtries. Slr Multiplition. Assignment nd nswer key. Mtrix Multiplition. Assignment nd nswer key. Determinnt x x (digonl, minors, properties) summry

More information

Module 5. Three-phase AC Circuits. Version 2 EE IIT, Kharagpur

Module 5. Three-phase AC Circuits. Version 2 EE IIT, Kharagpur Module 5 Three-hse A iruits Version EE IIT, Khrgur esson 8 Three-hse Blned Suly Version EE IIT, Khrgur In the module, ontining six lessons (-7), the study of iruits, onsisting of the liner elements resistne,

More information

Circuit Analysis. Lesson #2. BME 372 Electronics I J.Schesser

Circuit Analysis. Lesson #2. BME 372 Electronics I J.Schesser Ciruit Anlysis Lesson # BME 37 Eletronis J.Shesser 67 oltge Division The voltge ross impednes in series divides in proportion to the impednes. b n b b b b ( ; KL Ohm's Lw BME 37 Eletronis J.Shesser i i

More information

has the desired form. On the other hand, its product with z is 1. So the inverse x

has the desired form. On the other hand, its product with z is 1. So the inverse x First homework ssignment p. 5 Exercise. Verify tht the set of complex numers of the form x + y 2, where x nd y re rtionl, is sufield of the field of complex numers. Solution: Evidently, this set contins

More information

Bypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems

Bypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems Bypssing Spce Explosion in Regulr Expression Mtching for Network Intrusion Detection n Prevention Systems Jignesh Ptel, Alex Liu n Eric Torng Dept. of Computer Science n Engineering Michign Stte University

More information

Arc-Consistency for Non-Binary Dynamic CSPs

Arc-Consistency for Non-Binary Dynamic CSPs Ar-Consisteny for Non-Binry Dynmi CSPs Christin Bessière LIRMM (UMR C 9928 CNRS / Université Montpellier II) 860, rue de Sint Priest 34090 Montpellier, Frne Emil: essiere@rim.fr Astrt. Constrint stisftion

More information

Fractions: Arithmetic Review

Fractions: Arithmetic Review Frtions: Arithmeti Review Frtions n e interprete s rtios omprisons of two quntities. For given numer expresse in frtion nottion suh s we ll the numertor n the enomintor n it is helpful to interpret this

More information

Simple Electric Circuits

Simple Electric Circuits Simple Eletri Ciruits Gol: To uild nd oserve the opertion of simple eletri iruits nd to lern mesurement methods for eletri urrent nd voltge using mmeters nd voltmeters. L Preprtion Eletri hrges move through

More information

CS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001

CS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001 CS99S Lortory 2 Preprtion Copyright W. J. Dlly 2 Octoer, 2 Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes to oserve logic

More information

Enterprise Digital Signage Create a New Sign

Enterprise Digital Signage Create a New Sign Enterprise Digitl Signge Crete New Sign Intended Audiene: Content dministrtors of Enterprise Digitl Signge inluding stff with remote ess to sign.pitt.edu nd the Content Mnger softwre pplition for their

More information

Clause Trees: a Tool for Understanding and Implementing Resolution in Automated Reasoning

Clause Trees: a Tool for Understanding and Implementing Resolution in Automated Reasoning Cluse Trees: Tool for Understnding nd Implementing Resolution in Automted Resoning J. D. Horton nd Brue Spener University of New Brunswik, Frederiton, New Brunswik, Cnd E3B 5A3 emil : jdh@un. nd spener@un.

More information

Using CrowdSourcing for Data Analytics

Using CrowdSourcing for Data Analytics Using CrowdSouring for Dt Anlytis Hetor Gri-Molin (work with Steven Whng, Peter Lofgren, Adity Prmeswrn nd others) Stnford University 1 Big Dt Anlytis CrowdSouring 1 CrowdSouring 3 Rel World Exmples Ctegorizing

More information

Homework 3 Solutions

Homework 3 Solutions CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.

More information

One Minute To Learn Programming: Finite Automata

One Minute To Learn Programming: Finite Automata Gret Theoreticl Ides In Computer Science Steven Rudich CS 15-251 Spring 2005 Lecture 9 Fe 8 2005 Crnegie Mellon University One Minute To Lern Progrmming: Finite Automt Let me tech you progrmming lnguge

More information

Regular Sets and Expressions

Regular Sets and Expressions Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite

More information

The remaining two sides of the right triangle are called the legs of the right triangle.

The remaining two sides of the right triangle are called the legs of the right triangle. 10 MODULE 6. RADICAL EXPRESSIONS 6 Pythgoren Theorem The Pythgoren Theorem An ngle tht mesures 90 degrees is lled right ngle. If one of the ngles of tringle is right ngle, then the tringle is lled right

More information

control policies to be declared over by associating security

control policies to be declared over by associating security Seure XML Querying with Seurity Views Wenfei Fn University of Edinurgh & Bell Lortories wenfei@infeduk Chee-Yong Chn Ntionl University of Singpore hny@ompnusedusg Minos Groflkis Bell Lortories minos@reserhell-lsom

More information

Right Triangle Trigonometry

Right Triangle Trigonometry CONDENSED LESSON 1.1 Right Tringle Trigonometr In this lesson ou will lern out the trigonometri rtios ssoited with right tringle use trigonometri rtios to find unknown side lengths in right tringle use

More information

DATABASDESIGN FÖR INGENJÖRER - 1056F

DATABASDESIGN FÖR INGENJÖRER - 1056F DATABASDESIGN FÖR INGENJÖRER - 06F Sommr 00 En introuktionskurs i tssystem http://user.it.uu.se/~ul/t-sommr0/ lt. http://www.it.uu.se/eu/course/homepge/esign/st0/ Kjell Orsorn (Rusln Fomkin) Uppsl Dtse

More information

Student Access to Virtual Desktops from personally owned Windows computers

Student Access to Virtual Desktops from personally owned Windows computers Student Aess to Virtul Desktops from personlly owned Windows omputers Mdison College is plesed to nnoune the ility for students to ess nd use virtul desktops, vi Mdison College wireless, from personlly

More information

Intersection Problems

Intersection Problems Intersetion Prolems Determine pirs of interseting ojets? C A B E D Complex shpes forme y oolen opertions: interset, union, iff. Collision etetion in rootis n motion plnning. Visiility, olusion, renering

More information

Lec 2: Gates and Logic

Lec 2: Gates and Logic Lec 2: Gtes nd Logic Kvit Bl CS 34, Fll 28 Computer Science Cornell University Announcements Clss newsgroup creted Posted on we-pge Use it for prtner finding First ssignment is to find prtners Due this

More information

Teacher s Quick Reference

Teacher s Quick Reference 1 Go to www.myon.om Clik Login now. Login 3 Enter your Shool nme (selet from the drop-down), Usernme nd Pssword, nd lik Sign in. Groups 1 From the home pge, selet Open: Groups. Clik on Crete new group.

More information

c b 5.00 10 5 N/m 2 (0.120 m 3 0.200 m 3 ), = 4.00 10 4 J. W total = W a b + W b c 2.00

c b 5.00 10 5 N/m 2 (0.120 m 3 0.200 m 3 ), = 4.00 10 4 J. W total = W a b + W b c 2.00 Chter 19, exmle rolems: (19.06) A gs undergoes two roesses. First: onstnt volume @ 0.200 m 3, isohori. Pressure inreses from 2.00 10 5 P to 5.00 10 5 P. Seond: Constnt ressure @ 5.00 10 5 P, isori. olume

More information

Forensic Engineering Techniques for VLSI CAD Tools

Forensic Engineering Techniques for VLSI CAD Tools Forensi Engineering Tehniques for VLSI CAD Tools Jennifer L. Wong, Drko Kirovski, Dvi Liu, Miorg Potkonjk UCLA Computer Siene Deprtment University of Cliforni, Los Angeles June 8, 2000 Computtionl Forensi

More information

SOLVING EQUATIONS BY FACTORING

SOLVING EQUATIONS BY FACTORING 316 (5-60) Chpter 5 Exponents nd Polynomils 5.9 SOLVING EQUATIONS BY FACTORING In this setion The Zero Ftor Property Applitions helpful hint Note tht the zero ftor property is our seond exmple of getting

More information

Reasoning to Solve Equations and Inequalities

Reasoning to Solve Equations and Inequalities Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing

More information

p-q Theory Power Components Calculations

p-q Theory Power Components Calculations ISIE 23 - IEEE Interntionl Symposium on Industril Eletronis Rio de Jneiro, Brsil, 9-11 Junho de 23, ISBN: -783-7912-8 p-q Theory Power Components Clultions João L. Afonso, Memer, IEEE, M. J. Sepúlved Freits,

More information

PLWAP Sequential Mining: Open Source Code

PLWAP Sequential Mining: Open Source Code PL Sequentil Mining: Open Soure Code C.I. Ezeife Shool of Computer Siene University of Windsor Windsor, Ontrio N9B 3P4 ezeife@uwindsor. Yi Lu Deprtment of Computer Siene Wyne Stte University Detroit, Mihign

More information

Printer Disk. Modem. Computer. Mouse. Tape. Display. I/O Devices. Keyboard

Printer Disk. Modem. Computer. Mouse. Tape. Display. I/O Devices. Keyboard CS224 COMPUTER ARCHITECTURE & ORGANIZATION SPRING 204 LAYERED COMPUTER DESIGN. Introdution CS224 fouses on omputer design. It uses the top-down, lyered, pproh to design nd lso to improve omputers. A omputer

More information

10.5 Graphing Quadratic Functions

10.5 Graphing Quadratic Functions 0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions

More information

Calculating Principal Strains using a Rectangular Strain Gage Rosette

Calculating Principal Strains using a Rectangular Strain Gage Rosette Clulting Prinipl Strins using Retngulr Strin Gge Rosette Strin gge rosettes re used often in engineering prtie to determine strin sttes t speifi points on struture. Figure illustrtes three ommonly used

More information

ORGANIZER QUICK REFERENCE GUIDE

ORGANIZER QUICK REFERENCE GUIDE NOTES ON ORGANIZING AND SCHEDULING MEETINGS Individul GoToMeeting orgnizers my hold meetings for up to 15 ttendees. GoToMeeting Corporte orgnizers my hold meetings for up to 25 ttendees. GoToMeeting orgnizers

More information

Chess and Mathematics

Chess and Mathematics Chess nd Mthemtis in UK Seondry Shools Dr Neill Cooper Hed of Further Mthemtis t Wilson s Shool Mnger of Shool Chess for the English Chess Federtion Mths in UK Shools KS (up to 7 yers) Numers: 5 + 7; x

More information

Density Curve. Continuous Distributions. Continuous Distribution. Density Curve. Meaning of Area Under Curve. Meaning of Area Under Curve

Density Curve. Continuous Distributions. Continuous Distribution. Density Curve. Meaning of Area Under Curve. Meaning of Area Under Curve Continuous Distributions Rndom Vribles of the Continuous Tye Density Curve Perent Density funtion f () f() A smooth urve tht fit the distribution 6 7 9 Test sores Density Curve Perent Probbility Density

More information

Napoleon and Pythagoras with Geometry Expressions

Napoleon and Pythagoras with Geometry Expressions Npoleon nd Pythgors with eometry xpressions NPOLON N PYTORS WIT OMTRY XPRSSIONS... 1 INTROUTION... xmple 1: Npoleon s Theorem... 3 xmple : n unexpeted tringle from Pythgors-like digrm... 5 xmple 3: Penequilterl

More information

Exhaust System. Table of Contents. Section 6C - Measuring Exhaust Elbow Height

Exhaust System. Table of Contents. Section 6C - Measuring Exhaust Elbow Height Exhust System Mesuring Exhust Elow Height Tle of Contents Setion 6C - Mesuring Exhust Elow Height Mesuring Exhust Elow Height...6C-2 Generl Informtion...6C-2 Bot Requirements...6C-4 Loding Requirements...6C-5

More information

a 2 + b 2 = c 2. There are many proofs of this theorem. An elegant one only requires that we know that the area of a square of side L is L 2

a 2 + b 2 = c 2. There are many proofs of this theorem. An elegant one only requires that we know that the area of a square of side L is L 2 Pythgors Pythgors A right tringle, suh s shown in the figure elow, hs one 90 ngle. The long side of length is the hypotenuse. The short leg (or thetus) hs length, nd the long leg hs length. The theorem

More information

Three squares with sides 3, 4, and 5 units are used to form the right triangle shown. In a right triangle, the sides have special names.

Three squares with sides 3, 4, and 5 units are used to form the right triangle shown. In a right triangle, the sides have special names. 1- The Pythgoren Theorem MAIN IDEA Find length using the Pythgoren Theorem. New Voulry leg hypotenuse Pythgoren Theorem Mth Online glenoe.om Extr Exmples Personl Tutor Self-Chek Quiz Three squres with

More information

8.2 Trigonometric Ratios

8.2 Trigonometric Ratios 8.2 Trigonometri Rtios Ojetives: G.SRT.6: Understnd tht y similrity, side rtios in right tringles re properties of the ngles in the tringle, leding to definitions of trigonometri rtios for ute ngles. For

More information

Angles 2.1. Exercise 2.1... Find the size of the lettered angles. Give reasons for your answers. a) b) c) Example

Angles 2.1. Exercise 2.1... Find the size of the lettered angles. Give reasons for your answers. a) b) c) Example 2.1 Angles Reognise lternte n orresponing ngles Key wors prllel lternte orresponing vertilly opposite Rememer, prllel lines re stright lines whih never meet or ross. The rrows show tht the lines re prllel

More information

The Cat in the Hat. by Dr. Seuss. A a. B b. A a. Rich Vocabulary. Learning Ab Rhyming

The Cat in the Hat. by Dr. Seuss. A a. B b. A a. Rich Vocabulary. Learning Ab Rhyming MINI-LESSON IN TION The t in the Ht y Dr. Seuss Rih Voulry tme dj. esy to hndle (not wild) LERNING Lerning Rhyming OUT Words I know it is wet nd the sun is not sunny. ut we n hve Lots of good fun tht is

More information

ORGANIZER QUICK REFERENCE GUIDE

ORGANIZER QUICK REFERENCE GUIDE NOTES ON ORGANIZING AND SCHEDULING MEETINGS Individul GoToMeeting orgnizers my hold meetings for up to 15 ttendees. GoToMeeting Corporte orgnizers my hold meetings for up to 25 ttendees. GoToMeeting orgnizers

More information

Turing Machine Extensions

Turing Machine Extensions Red K & S 4.3.1, 4.4. Do Homework 19. Turing Mchine Extensions Turing Mchine Definitions An lterntive definition of Turing mchine: (K, Σ, Γ, δ, s, H): Γ is finite set of llowble tpe symbols. One of these

More information

A dynamically SVC based compact control algorithm for load balancing in distribution systems

A dynamically SVC based compact control algorithm for load balancing in distribution systems NTERNATONA JOURNA OF ENERG, ssue 3, ol., 7 A dynmilly S bsed ompt ontrol lgorithm for lod blning in distribution systems A. Kzemi, A. Mordi Koohi nd R. Rezeipour Abstrt An lgorithm for pplying fixed pitor-thyristorontrolled

More information

Assuming all values are initially zero, what are the values of A and B after executing this Verilog code inside an always block? C=1; A <= C; B = C;

Assuming all values are initially zero, what are the values of A and B after executing this Verilog code inside an always block? C=1; A <= C; B = C; B-26 Appendix B The Bsics of Logic Design Check Yourself ALU n [Arthritic Logic Unit or (rre) Arithmetic Logic Unit] A rndom-numer genertor supplied s stndrd with ll computer systems Stn Kelly-Bootle,

More information

excenters and excircles

excenters and excircles 21 onurrene IIi 2 lesson 21 exenters nd exirles In the first lesson on onurrene, we sw tht the isetors of the interior ngles of tringle onur t the inenter. If you did the exerise in the lst lesson deling

More information

DFA Operations. Complement, Product, Union, Intersection, Difference, Equivalence and Minimization of DFAs

DFA Operations. Complement, Product, Union, Intersection, Difference, Equivalence and Minimization of DFAs DFA Opertions Complement, Product, nion, Intersection, Difference, Equivlence nd inimiztion of DFAs Wednesdy, Octoer 7, 2009 eding: ipser pp. 45-46, toughton 3.11 3.12 C235 nguges nd Automt Deprtment of

More information

The art of Paperarchitecture (PA). MANUAL

The art of Paperarchitecture (PA). MANUAL The rt of Pperrhiteture (PA). MANUAL Introution Pperrhiteture (PA) is the rt of reting three-imensionl (3D) ojets out of plin piee of pper or ror. At first, esign is rwn (mnully or printe (using grphil

More information

Suffix Trees CMSC 423

Suffix Trees CMSC 423 Suffix Trees CMSC 423 Preprocessing Strings Over the next few lectures, we ll see severl methods for preprocessing string dt into dt structures tht mke mny questions (like serching) esy to nswer: Suffix

More information

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 16 th May 2008. Time: 14:00 16:00

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 16 th May 2008. Time: 14:00 16:00 COMP20212 Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE Digitl Design Techniques Dte: Fridy 16 th My 2008 Time: 14:00 16:00 Plese nswer ny THREE Questions from the FOUR questions provided

More information

15. Let f (x) = 3x Suppose rx 2 + sx + t = 0 where r 0. Then x = 24. Solve 5x 25 < 20 for x. 26. Let y = 7x

15. Let f (x) = 3x Suppose rx 2 + sx + t = 0 where r 0. Then x = 24. Solve 5x 25 < 20 for x. 26. Let y = 7x Pretest Review The pretest will onsist of 0 problems, eh of whih is similr to one of the following 49 problems If you n do problems like these 49 listed below, you will hve no problem with the pretest

More information

OxCORT v4 Quick Guide Revision Class Reports

OxCORT v4 Quick Guide Revision Class Reports OxCORT v4 Quik Guie Revision Clss Reports This quik guie is suitble for the following roles: Tutor This quik guie reltes to the following menu options: Crete Revision Clss Reports pg 1 Crete Revision Clss

More information

KEY SKILLS INFORMATION TECHNOLOGY Level 3. Question Paper. 29 January 9 February 2001

KEY SKILLS INFORMATION TECHNOLOGY Level 3. Question Paper. 29 January 9 February 2001 KEY SKILLS INFORMATION TECHNOLOGY Level 3 Question Pper 29 Jnury 9 Ferury 2001 WHAT YOU NEED This Question Pper An Answer Booklet Aess to omputer, softwre nd printer You my use ilingul ditionry Do NOT

More information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-265 Technicl notes on using Anlog Devices DSPs, processors nd development tools Contct our technicl support t dsp.support@nlog.com nd t dsptools.support@nlog.com Or visit our

More information

Thank you for participating in Teach It First!

Thank you for participating in Teach It First! Thnk you for prtiipting in Teh It First! This Teh It First Kit ontins Common Core Coh, Mthemtis teher lesson followed y the orresponding student lesson. We re onfident tht using this lesson will help you

More information

Learning Outcomes. Computer Systems - Architecture Lecture 4 - Boolean Logic. What is Logic? Boolean Logic 10/28/2010

Learning Outcomes. Computer Systems - Architecture Lecture 4 - Boolean Logic. What is Logic? Boolean Logic 10/28/2010 /28/2 Lerning Outcomes At the end of this lecture you should: Computer Systems - Architecture Lecture 4 - Boolen Logic Eddie Edwrds eedwrds@doc.ic.c.uk http://www.doc.ic.c.uk/~eedwrds/compsys (Hevily sed

More information

Formal Languages and Automata Exam

Formal Languages and Automata Exam Forml Lnguges nd Automt Exm Fculty of Computers & Informtion Deprtment: Computer Science Grde: Third Course code: CSC 34 Totl Mrk: 8 Dte: 23//2 Time: 3 hours Answer the following questions: ) Consider

More information

Ratio and Proportion

Ratio and Proportion Rtio nd Proportion Rtio: The onept of rtio ours frequently nd in wide vriety of wys For exmple: A newspper reports tht the rtio of Repulins to Demorts on ertin Congressionl ommittee is 3 to The student/fulty

More information

REMO: Resource-Aware Application State Monitoring for Large-Scale Distributed Systems

REMO: Resource-Aware Application State Monitoring for Large-Scale Distributed Systems : Resoure-Awre Applition Stte Monitoring for Lrge-Sle Distriuted Systems Shiong Meng Srinivs R. Kshyp Chitr Venktrmni Ling Liu College of Computing, Georgi Institute of Tehnology, Atlnt, GA 332, USA {smeng,

More information

Finite Automata. Informatics 2A: Lecture 3. John Longley. 25 September School of Informatics University of Edinburgh

Finite Automata. Informatics 2A: Lecture 3. John Longley. 25 September School of Informatics University of Edinburgh Lnguges nd Automt Finite Automt Informtics 2A: Lecture 3 John Longley School of Informtics University of Edinburgh jrl@inf.ed.c.uk 25 September 2015 1 / 30 Lnguges nd Automt 1 Lnguges nd Automt Wht is

More information

Unambiguous Recognizable Two-dimensional Languages

Unambiguous Recognizable Two-dimensional Languages Unmbiguous Recognizble Two-dimensionl Lnguges Mrcell Anselmo, Dor Gimmrresi, Mri Mdoni, Antonio Restivo (Univ. of Slerno, Univ. Rom Tor Vergt, Univ. of Ctni, Univ. of Plermo) W2DL, My 26 REC fmily I REC

More information

Notes on Logic Circuits by LK

Notes on Logic Circuits by LK Notes on Logi Ciruits y LK These notes introdue an interpretation of logi in terms of swithing iruits. This appliation of logi to swithing iruits is the disovery of Claude Shannon Symoli nalysis of Relay

More information

Sirindhorn International Institute of Technology Thammasat University at Rangsit

Sirindhorn International Institute of Technology Thammasat University at Rangsit Sirindhorn Interntionl Institute of Technology Thmmst University t Rngsit School of Informtion, Computer nd Communiction Technology COURSE : ECS 204 Bsic Electricl Engineering L INSTRUCTOR : Asst. Prof.

More information

Lesson 18.2: Right Triangle Trigonometry

Lesson 18.2: Right Triangle Trigonometry Lesson 8.: Right Tringle Trigonometry lthough Trigonometry is used to solve mny prolems, historilly it ws first pplied to prolems tht involve right tringle. This n e extended to non-right tringles (hpter

More information

Essential Question What are the Law of Sines and the Law of Cosines?

Essential Question What are the Law of Sines and the Law of Cosines? 9.7 TEXS ESSENTIL KNOWLEDGE ND SKILLS G.6.D Lw of Sines nd Lw of osines Essentil Question Wht re the Lw of Sines nd the Lw of osines? Disovering the Lw of Sines Work with prtner.. opy nd omplete the tle

More information

Vectors Summary. Projection vector AC = ( Shortest distance from B to line A C D [OR = where m1. and m

Vectors Summary. Projection vector AC = ( Shortest distance from B to line A C D [OR = where m1. and m . Slr prout (ot prout): = osθ Vetors Summry Lws of ot prout: (i) = (ii) ( ) = = (iii) = (ngle etween two ientil vetors is egrees) (iv) = n re perpeniulr Applitions: (i) Projetion vetor: B Length of projetion

More information

McAfee Network Security Platform

McAfee Network Security Platform XC-240 Lod Blner Appline Quik Strt Guide Revision D MAfee Network Seurity Pltform This quik strt guide explins how to quikly set up nd tivte your MAfee Network Seurity Pltform XC-240 Lod Blner. The SFP+

More information

Homework 3 Solution Chapter 3.

Homework 3 Solution Chapter 3. Homework 3 Solution Chpter 3 2 Let Q e the group of rtionl numers under ddition nd let Q e the group of nonzero rtionl numers under multiplition In Q, list the elements in 1 2 In Q, list the elements in

More information

Problem Set 2 Solutions

Problem Set 2 Solutions University of Cliforni, Berkeley Spring 2012 EE 42/100 Prof. A. Niknej Prolem Set 2 Solutions Plese note tht these re merely suggeste solutions. Mny of these prolems n e pprohe in ifferent wys. 1. In prolems

More information

The following information must be known for the correct selection of current measurement transformer (measurement or protection):

The following information must be known for the correct selection of current measurement transformer (measurement or protection): P 5 Protetion trnsformers P.5.01 GB Protetion trnsformers The following informtion must e known for the orret seletion of urrent mesurement trnsformer (mesurement or protetion): The pplition for whih it

More information

How to Graphically Interpret the Complex Roots of a Quadratic Equation

How to Graphically Interpret the Complex Roots of a Quadratic Equation Universit of Nersk - Linoln DigitlCommons@Universit of Nersk - Linoln MAT Em Epositor Ppers Mth in the Middle Institute Prtnership 7-007 How to Grphill Interpret the Comple Roots of Qudrti Eqution Crmen

More information

Learning Subregular Classes of Languages with Factored Deterministic Automata

Learning Subregular Classes of Languages with Factored Deterministic Automata Lerning Suregulr Clsses of Lnguges with Ftored Deterministi Automt Jeffrey Heinz Dept. of Linguistis nd Cognitive Siene University of Delwre heinz@udel.edu Jmes Rogers Dept. of Computer Siene Erlhm College

More information

State the size of angle x. Sometimes the fact that the angle sum of a triangle is 180 and other angle facts are needed. b y 127

State the size of angle x. Sometimes the fact that the angle sum of a triangle is 180 and other angle facts are needed. b y 127 ngles 2 CHTER 2.1 Tringles Drw tringle on pper nd lel its ngles, nd. Ter off its orners. Fit ngles, nd together. They mke stright line. This shows tht the ngles in this tringle dd up to 180 ut it is not

More information

Know the sum of angles at a point, on a straight line and in a triangle

Know the sum of angles at a point, on a straight line and in a triangle 2.1 ngle sums Know the sum of ngles t point, on stright line n in tringle Key wors ngle egree ngle sum n ngle is mesure of turn. ngles re usully mesure in egrees, or for short. ngles tht meet t point mke

More information

Version 001 CIRCUITS holland (1290) 1

Version 001 CIRCUITS holland (1290) 1 Version CRCUTS hollnd (9) This print-out should hve questions Multiple-choice questions my continue on the next column or pge find ll choices efore nswering AP M 99 MC points The power dissipted in wire

More information

Innovation in Software Development Process by Introducing Toyota Production System

Innovation in Software Development Process by Introducing Toyota Production System Innovtion in Softwre Development Proess y Introduing Toyot Prodution System V Koihi Furugki V Tooru Tkgi V Akinori Skt V Disuke Okym (Mnusript reeived June 1, 2006) Fujitsu Softwre Tehnologies (formerly

More information

RTL Power Optimization with Gate-level Accuracy

RTL Power Optimization with Gate-level Accuracy RTL Power Optimiztion with Gte-level Accurcy Qi Wng Cdence Design Systems, Inc Sumit Roy Clypto Design Systems, Inc 555 River Oks Prkwy, Sn Jose 95125 2903 Bunker Hill Lne, Suite 208, SntClr 95054 qwng@cdence.com

More information

Fluent Merging: A General Technique to Improve Reachability Heuristics and Factored Planning

Fluent Merging: A General Technique to Improve Reachability Heuristics and Factored Planning Fluent Merging: A Generl Tehnique to Improve Rehility Heuristis n Ftore Plnning Menkes vn en Briel Deprtment of Inustril Engineering Arizon Stte University Tempe AZ, 85287-8809 menkes@su.eu Suro Kmhmpti

More information

Equations between labeled directed graphs

Equations between labeled directed graphs Equtions etween leled directed grphs Existence of solutions Grret-Fontelles A., Misnikov A., Ventur E. My 2013 Motivtionl prolem H 1 nd H 2 two sugroups of the free group generted y X A, F (X, A). H 1

More information

BUSINESS PROCESS MODEL TRANSFORMATION ISSUES The top 7 adversaries encountered at defining model transformations

BUSINESS PROCESS MODEL TRANSFORMATION ISSUES The top 7 adversaries encountered at defining model transformations USINESS PROCESS MODEL TRANSFORMATION ISSUES The top 7 dversries enountered t defining model trnsformtions Mrion Murzek Women s Postgrdute College for Internet Tehnologies (WIT), Institute of Softwre Tehnology

More information

Solutions to Physics: Principles with Applications, 5/E, Giancoli Chapter 19

Solutions to Physics: Principles with Applications, 5/E, Giancoli Chapter 19 Solutions to Physis: Priniples with pplitions, 5/E, Ginoli Chpter 19 CHPTE9 1 When the uls re onnete in series, the equivlent resistne is series = i = 4 ul = 4(140 Ω) = 560 Ω When the uls re onnete in

More information

- DAY 1 - Website Design and Project Planning

- DAY 1 - Website Design and Project Planning Wesite Design nd Projet Plnning Ojetive This module provides n overview of the onepts of wesite design nd liner workflow for produing wesite. Prtiipnts will outline the sope of wesite projet, inluding

More information

DiaGen: A Generator for Diagram Editors Based on a Hypergraph Model

DiaGen: A Generator for Diagram Editors Based on a Hypergraph Model DiGen: A Genertor for Digrm Eitors Bse on Hypergrph Moel G. Viehstet M. Mins Lehrstuhl für Progrmmiersprhen Universität Erlngen-Nürnerg Mrtensstr. 3, 91058 Erlngen, Germny Emil: fviehste,minsg@informtik.uni-erlngen.e

More information