Points-to Analysis using Types
|
|
- Ambrose Warner
- 5 years ago
- Views:
Transcription
1 CS618: Program Analysis I st Semester Points-to Analysis using Types Amey Karkare karkare@cse.iitk.ac.in karkare@cse.iitb.ac.in Department of CSE, IIT Kanpur/Bombay karkare, CSE, IITK/B CS618 1/10
2 Reference Papers Bjarne Steensgaard: Points-to Analysis in Almost Linear Time. POPL 1996 Manuvir Das: Unification-based pointer analysis with directional assignments. PLDI 2000 karkare, CSE, IITK/B CS618 2/10
3 Language S ::= x = y karkare, CSE, IITK/B CS618 3/10
4 Language S ::= x = y x = &y karkare, CSE, IITK/B CS618 3/10
5 Language S ::= x = y x = &y x = y karkare, CSE, IITK/B CS618 3/10
6 Language S ::= x = y x = &y x = y x = allocate(y) karkare, CSE, IITK/B CS618 3/10
7 Language S ::= x = y x = &y x = y x = allocate(y) x = y karkare, CSE, IITK/B CS618 3/10
8 Language S ::= x = y x = &y x = y x = allocate(y) x = y x = fun(f 1,...,f n ) returns r in S karkare, CSE, IITK/B CS618 3/10
9 Language S ::= x = y x = &y x = y x = allocate(y) x = y x = fun(f 1,...,f n ) returns r in S x = p(y 1,...,y n ) karkare, CSE, IITK/B CS618 3/10
10 Language S ::= x = y x = &y x = y x = allocate(y) x = y x = fun(f 1,...,f n ) returns r in S x = p(y 1,...,y n ) karkare, CSE, IITK/B CS618 3/10
11 Non standard Types s Symbols karkare, CSE, IITK/B CS618 4/10
12 Non standard Types s Symbols karkare, CSE, IITK/B CS618 4/10
13 Non standard Types s Symbols τ Locations ::= (ϕ, α) karkare, CSE, IITK/B CS618 4/10
14 Non standard Types s Symbols τ Locations ::= (ϕ, α) ϕ Ids ::= {s 1,...,s n } karkare, CSE, IITK/B CS618 4/10
15 Non standard Types s Symbols τ Locations ::= (ϕ, α) ϕ Ids ::= {s 1,...,s n } α Values ::= ptr(τ) karkare, CSE, IITK/B CS618 4/10
16 Non standard Types s Symbols τ Locations ::= (ϕ, α) ϕ Ids ::= {s 1,...,s n } α Values ::= ptr(τ) A denotes type environment. karkare, CSE, IITK/B CS618 4/10
17 Partial Order α 1 α 2 (α 1 = ) (α 1 = α 2 ) karkare, CSE, IITK/B CS618 5/10
18 : Typing Rules A x : (ϕ,α) A y : (ϕ,α ) α α A welltyped(x = y) karkare, CSE, IITK/B CS618 6/10
19 : Typing Rules A x : (ϕ,α) A y : (ϕ,α ) α α A welltyped(x = y) A x : (ϕ,α) A y : τ ptr(τ) α A welltyped(x = &y) karkare, CSE, IITK/B CS618 6/10
20 : Typing Rules A x : (ϕ,α) A y : (ϕ,α ) α α A welltyped(x = y) A x : (ϕ,α) A y : τ ptr(τ) α A welltyped(x = &y) A x : (ϕ,α) A y : (ϕ, ptr(ϕ,α )) α α A welltyped(x = y) karkare, CSE, IITK/B CS618 6/10
21 : Typing Rules A x : (ϕ,α) A y : (ϕ,α ) α α A welltyped(x = y) A x : (ϕ,α) A y : τ ptr(τ) α A welltyped(x = &y) A x : (ϕ,α) A y : (ϕ, ptr(ϕ,α )) α α A welltyped(x = y) A x : (ϕ, ptr(ϕ,α )) A y : (ϕ,α ) α α A welltyped( x = y) karkare, CSE, IITK/B CS618 6/10
22 : Typing Rules A x : (ϕ,α) A y : (ϕ,α ) α α A welltyped(x = y) A x : (ϕ,α) A y : τ ptr(τ) α A welltyped(x = &y) A x : (ϕ,α) A y : (ϕ, ptr(ϕ,α )) α α A welltyped(x = y) A x : (ϕ, ptr(ϕ,α )) A y : (ϕ,α ) α α A welltyped( x = y) A x : τ A welltyped(x = allocate(y)) karkare, CSE, IITK/B CS618 6/10
23 Function Definitions karkare, CSE, IITK/B CS618 7/10
24 Function Definitions Need a new type value: (τ 1...τ n ) τ karkare, CSE, IITK/B CS618 7/10
25 Function Definitions Need a new type value: (τ 1...τ n ) τ karkare, CSE, IITK/B CS618 7/10
26 Function Definitions Need a new type value: (τ 1...τ n ) τ A x : (τ 1...τ n ) τ karkare, CSE, IITK/B CS618 7/10
27 Function Definitions Need a new type value: (τ 1...τ n ) τ A x : (τ 1...τ n ) τ i {1...n}.A f i : τ i karkare, CSE, IITK/B CS618 7/10
28 Function Definitions Need a new type value: (τ 1...τ n ) τ A x : (τ 1...τ n ) τ i {1...n}.A f i : τ i A r : τ karkare, CSE, IITK/B CS618 7/10
29 Function Definitions Need a new type value: (τ 1...τ n ) τ A x : (τ 1...τ n ) τ i {1...n}.A f i : τ i A r : τ s S.A welltyped(s) karkare, CSE, IITK/B CS618 7/10
30 Function Definitions Need a new type value: (τ 1...τ n ) τ A x : (τ 1...τ n ) τ i {1...n}.A f i : τ i A r : τ s S.A welltyped(s) A welltyped(x = fun(f 1,...,f n ) returns r in S ) karkare, CSE, IITK/B CS618 7/10
31 Function Calls A x : τ τ = (ϕ,α) karkare, CSE, IITK/B CS618 8/10
32 Function Calls A x : τ τ = (ϕ,α) karkare, CSE, IITK/B CS618 8/10
33 Function Calls A x : τ τ = (ϕ,α) A p : (τ 1...τ n ) τ τ i = (ϕ i,α i ) karkare, CSE, IITK/B CS618 8/10
34 Function Calls A x : τ τ = (ϕ,α) A p : (τ 1...τ n ) τ τ i = (ϕ i,α i ) i {1...n}.A y i : τ i τ i = (ϕ i,α i ) karkare, CSE, IITK/B CS618 8/10
35 Function Calls A x : τ τ = (ϕ,α) A p : (τ 1...τ n ) τ τ i = (ϕ i,α i ) i {1...n}.A y i : τ i τ i = (ϕ i,α i ) α i α i α α karkare, CSE, IITK/B CS618 8/10
36 Function Calls A x : τ τ = (ϕ,α) A p : (τ 1...τ n ) τ τ i = (ϕ i,α i ) i {1...n}.A y i : τ i τ i = (ϕ i,α i ) α i α i α α A welltyped(x = p(y 1,...,y n )) karkare, CSE, IITK/B CS618 8/10
37 Manuvir Das s One-level Flow-based Analysis α 1 α 2 ptr(τ 1 ) ptr(τ 2 ) karkare, CSE, IITK/B CS618 9/10
38 Manuvir Das s One-level Flow-based Analysis α 1 α 2 ptr(τ 1 ) ptr(τ 2 ) ptr((ϕ,α )) ptr((ϕ,α)) karkare, CSE, IITK/B CS618 9/10
39 Manuvir Das s One-level Flow-based Analysis α 1 α 2 ptr(τ 1 ) ptr(τ 2 ) ptr((ϕ,α )) ptr((ϕ,α)) (ϕ ϕ) (α = α) karkare, CSE, IITK/B CS618 9/10
40 One-level Flow-based Analysis Replace by in Steensgaard s analysis karkare, CSE, IITK/B CS618 10/10
41 One-level Flow-based Analysis Replace by in Steensgaard s analysis Keeps top level pointees separate! karkare, CSE, IITK/B CS618 10/10
Liveness based Garbage Collection
CS618: Program Analsis 2016-17 I st Semester Ideal Garbage Collection Liveness based Garbage Collection Ame Karkare karkare@cse.iitk.ac.in karkare@cse.iitb.ac.in Department of CSE, IIT Kanpur/Bomba...
More informationCS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati
CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati Important 1. No questions about the paper will be entertained during
More informationLiveness based Garbage Collection
CS738: Advanced Compiler Optimizations Liveness based Garbage Collection Amey Karkare karkare@cse.iitk.ac.in http://www.cse.iitk.ac.in/~karkare/cs738 Department of CSE, IIT Kanpur Ideal Garbage Collection...
More informationCOURSE CONTENT for Computer Science & Engineering [CSE]
COURSE CONTENT for Computer Science & Engineering [CSE] 1st Semester 1 HU 101 English Language & Communication 2 1 0 3 3 2 PH 101 Engineering Physics 3 1 0 4 4 3 M 101 Mathematics 3 1 0 4 4 4 ME 101 Mechanical
More informationFOUNDATION COURSES REQUIRED OF ALL MAJORS:
FOUNDATION COURSES REQUIRED OF ALL MAJORS: MATH UN1101 Calculus I MA 151 Calculus I, Part I MATH UN1102 Calculus II MA 152 Calculus I, Part II MATH UN1201 Calculus III MA 261 MATH UN1202 Calculus IV MA
More information1) Electronic Circuits & Laboratory
ENSEA COURSES TAUGHT IN ENGLISH SPRING Semester 1) Electronic Circuits & Laboratory Lecture : 45 hours Laboratory : 45 hours US Credits : 6 Analysis of integrated amplifiers with bipolar junction transistors
More informationHarvard School of Engineering and Applied Sciences CS 152: Programming Languages
Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Lecture 17 Tuesday, April 2, 2013 1 There is a strong connection between types in programming languages and propositions
More information07 Equational Logic and Algebraic Reasoning
CAS 701 Fall 2004 07 Equational Logic and Algebraic Reasoning Instructor: W. M. Farmer Revised: 17 November 2004 1 What is Equational Logic? Equational logic is first-order logic restricted to languages
More informationMSR by Examples. Iliano Cervesato. ITT Industries, NRL Washington DC.
MSR by Examples Iliano Cervesato iliano@itd.nrl.navy.mil ITT Industries, Inc @ NRL Washington DC http://www.cs.stanford.edu/~iliano/ IITD, CSE Dept. Delhi, India April 24 th,2002 Outline Security Protocols
More informationInverse Functions. One-to-one. Horizontal line test. Onto
Inverse Functions One-to-one Suppose f : A B is a function. We call f one-to-one if every distinct pair of objects in A is assigned to a distinct pair of objects in B. In other words, each object of the
More informationProlog and Logic Programming. CS152 Chris Pollett Dec. 3, 2008.
Prolog and Logic Programming CS152 Chris Pollett Dec. 3, 2008. Outline Logic and Logic Programs Horn Clauses Resolution and Unification Prolog Introduction So far this semester we have considered three
More informationCS 154 Formal Languages and Computability Assignment #2 Solutions
CS 154 Formal Languages and Computability Assignment #2 Solutions Department of Computer Science San Jose State University Spring 2016 Instructor: Ron Mak www.cs.sjsu.edu/~mak Assignment #2: Question 1
More informationLecture Notes on A Concurrent Logical Framework
Lecture Notes on A Concurrent Logical Framework 15-816: Linear Logic Frank Pfenning Lecture 21 April 9, 2012 Today we will put many of pieces together that we have put in place so far, by moving from a
More informationCSE 311: Foundations of Computing. Lecture 23: Finite State Machine Minimization & NFAs
CSE : Foundations of Computing Lecture : Finite State Machine Minimization & NFAs State Minimization Many different FSMs (DFAs) for the same problem Take a given FSM and try to reduce its state set by
More informationSome Mathematical Aspects of Physics Students Problem-Solving Difficulties
Some Mathematical Aspects of Physics Students Problem-Solving Difficulties David E. Meltzer and Dakota H. King Arizona State University Supported in part by NSF DUE #1504986 The Challenge College physics
More informationTuring Machines A Turing Machine is a 7-tuple, (Q, Σ, Γ, δ, q0, qaccept, qreject), where Q, Σ, Γ are all finite
The Church-Turing Thesis CS60001: Foundations of Computing Science Professor, Dept. of Computer Sc. & Engg., Turing Machines A Turing Machine is a 7-tuple, (Q, Σ, Γ, δ, q 0, q accept, q reject ), where
More informationInformation Required for Memorization
Information Required for Memorization Your students are required to memorize the following information for Chem 10. This information must not be supplied on Cheat Sheets for your Semester Exams or Final
More informationType inference in context
Type inference in context Adam Gundry University of Strathclyde Microsoft Research PhD Scholar Conor McBride University of Strathclyde James McKinna Radboud University Nijmegen MSFP 25 September 2010 Two
More informationCS626: NLP, Speech and the Web. Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 14: Parsing Algorithms 30 th August, 2012
CS626: NLP, Speech and the Web Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 14: Parsing Algorithms 30 th August, 2012 Parsing Problem Semantics Part of Speech Tagging NLP Trinity Morph Analysis
More informationIn Class Problem Set #15
In Class Problem Set #15 CSE 1400 and MTH 2051 Fall 2012 Relations Definitions A relation is a set of ordered pairs (x, y) where x is related to y. Let denote a relational symbol. Write x y to express
More informationArtificial Intelligence
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 20-21 Natural Language Parsing Parsing of Sentences Are sentences flat linear structures? Why tree? Is
More informationCSE 20. Final Review. CSE 20: Final Review
CSE 20 Final Review Final Review Representation of integers in base b Logic Proof systems: Direct Proof Proof by contradiction Contraposetive Sets Theory Functions Induction Final Review Representation
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2017 http://cseweb.ucsd.edu/classes/sp17/cse105-ab/ Review of CFG, CFL, ambiguity What is the language generated by the CFG below: G 1 = ({S,T 1,T 2 }, {0,1,2}, { S
More informationFrom Fundamentele Informatica 1: inleverdatum 1 april 2014, 13:45 uur. A Set A of the Same Size as B or Larger Than B. A itself is not.
Fundamentele Informatica 3 voorjaar 2014 http://www.liacs.nl/home/rvvliet/fi3/ Rudy van Vliet kamer 124 Snellius, tel. 071-527 5777 rvvliet(at)liacs(dot)nl college 8, 31 maart 2014 8. Recursively Enumerable
More informationSimons Symposium on Approximation Algorithms, February 26, 2014
Solving Optimization Problems with Diseconomies of Scale via Decoupling Konstantin Makarychev Microsoft Research Maxim Sviridenko Yahoo Labs Simons Symposium on Approximation Algorithms, February 26, 2014
More informationConflict Removal. Less Than, Equals ( <= ) Conflict
Conflict Removal As you have observed in a recent example, not all context free grammars are simple precedence grammars. You have also seen that a context free grammar that is not a simple precedence grammar
More informationDegree Spectra J.Kepler Universitaet Linz NOCAS - RISC. Faculty of Mathematics and Computer Science Sofia University
Faculty of Mathematics and Computer Science Sofia University 05.05.2008 J.Kepler Universitaet Linz NOCAS - RISC Outline Enumeration degrees Degree spectra and jump spectra Representing the countable ideals
More informationElectric currents (primarily, in metals)
Electric currents (primarily, in metals) Benjamin Franklin was experimenting electricity in the mid- XVIII Century. Nobody knew if it was the positive charges or negative charges carrying the current through
More informationPushdown Automata (PDA) The structure and the content of the lecture is based on
Pushdown Automata (PDA) The structure and the content of the lecture is based on http://www.eecs.wsu.edu/~ananth/cpts317/lectures/index.htm 1 Excursion: Previous lecture n Context-free grammar G=(V,T,P,S),
More informationAct, 1956) Thursday ME1008. Thermo- Technology. CS1007 Microprocessor and Interfacing. Digital EE1053 SE1005. Computer.
EXAMINATION TIME TABLE NOVEMBER/DECEMBER 2014 AN : 02.00 P.M 05.00 P.M # AN : 02.00 P.M 04.00 P.M Aerospacee LE1003German LE1004-French LE1005-Japanese LE1006-Korean LE1007Chinese Language Phase-I MA1013
More informationStability. X(s) Y(s) = (s + 2) 2 (s 2) System has 2 poles: points where Y(s) -> at s = +2 and s = -2. Y(s) 8X(s) G 1 G 2
Stability 8X(s) X(s) Y(s) = (s 2) 2 (s 2) System has 2 poles: points where Y(s) -> at s = 2 and s = -2 If all poles are in region where s < 0, system is stable in Fourier language s = jω G 0 - x3 x7 Y(s)
More informationDEPARTMENT OF AEROSPACE ENGINEERING, IIT MADRAS
DEPARTMENT OF AEROSPACE ENGINEERING, IIT MADRAS B.Tech Curriculum (from July 015) Semester-wise credit hour distribution Semester I Win. II Sum. III IV V VI VII VIII Total Credits 51 3 56 3 50 56 50* 48*
More informationCSE 311 Lecture 25: Relating NFAs, DFAs, and Regular Expressions. Emina Torlak and Kevin Zatloukal
CSE 3 Lecture 25: Relating NFAs, DFAs, and Regular Expressions Emina Torlak and Kevin Zatloukal Topics From regular expressions to NFAs Theorem, algorithm, and examples. From NFAs to DFAs Theorem, algorithm,
More informationOn Black-Box Reductions between Predicate Encryption Schemes
On Black-Box Reductions between Predicate Encryption Schemes Vipul Goyal Virendra Kumar Satya Lokam Mohammad Mahmoody February 20, 2012 Abstract We prove that there is no black-box construction of a threshold
More informationComputability Theory
CS:4330 Theory of Computation Spring 2018 Computability Theory Decidable Languages Haniel Barbosa Readings for this lecture Chapter 4 of [Sipser 1996], 3rd edition. Section 4.1. Decidable Languages We
More informationDomain Specific Languages of Mathematics
Domain Specific Languages of Mathematics Cezar Ionescu cezar@chalmers.se Patrik Jansson patrikj@chalmers.se The problem Many Computer Science students seem to have difficulties with real and complex analysis.
More informationNPTEL web course on Complex Analysis. A. Swaminathan I.I.T. Roorkee, India. and. V.K. Katiyar I.I.T. Roorkee, India
NPTEL web course on Complex Analysis A. Swaminathan I.I.T. Roorkee, India and V.K. Katiyar I.I.T. Roorkee, India A.Swaminathan and V.K.Katiyar (NPTEL) Complex Analysis 1 / 14 Complex Analysis Module: 1:
More informationn logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional
More informationScripture quotations marked cev are from the Contemporary English Version, Copyright 1991, 1992, 1995 by American Bible Society. Used by permission.
N Ra: E K B Da a a B a a, a-a- a aa, a a. T, a a. 2009 Ba P, I. ISBN 978-1-60260-296-0. N a a a a a, a,. C a a a Ba P, a 500 a a aa a. W, : F K B Da, Ba P, I. U. S a a a a K Ja V B. S a a a a N K Ja V.
More informationjflap demo Regular expressions Pumping lemma Turing Machines Sections 12.4 and 12.5 in the text
On the menu today jflap demo Regular expressions Pumping lemma Turing Machines Sections 12.4 and 12.5 in the text 1 jflap Demo jflap: Useful tool for creating and testing abstract machines Finite automata,
More informationContext-Free Languages
CS:4330 Theory of Computation Spring 2018 Context-Free Languages Pushdown Automata Haniel Barbosa Readings for this lecture Chapter 2 of [Sipser 1996], 3rd edition. Section 2.2. Finite automaton 1 / 13
More informationSupplemental Information. C. elegans AWA Olfactory Neurons Fire. Calcium-Mediated All-or-None Action Potentials
Cell, Volume 175 Supplemental Information C. elegans AWA Olfactory Neurons Fire Calcium-Mediated All-or-None Action Potentials Qiang Liu, Philip B. Kidd, May Dobosiewicz, and Cornelia I. Bargmann Table
More informationBABEȘ-BOLYAI UNIVERSITY Semester I Semester II. 19 Field of study: PHYSICS Programme of study: COMPUTATIONAL PHYSICS
CURRICULUM starting form Academic year 2015-2016 III. WEEKLY STRUCTURE OF TEH PROGRAMME (in hours) BABEȘ-BOLYAI UNIVERSITY Semester I Semester II FACULTY OF PHYSICS Year I 18 21 Year II 25 19 Field of
More informationTuring Machines Part II
Turing Machines Part II COMP2600 Formal Methods for Software Engineering Katya Lebedeva Australian National University Semester 2, 2016 Slides created by Katya Lebedeva COMP 2600 Turing Machines 1 Why
More informationElectric Circuits I. Midterm #1
The University of Toledo Section number s5ms_elci7.fm - Electric Circuits I Midterm # Problems Points. 3 2. 7 3. 5 Total 5 Was the exam fair? yes no The University of Toledo Section number s5ms_elci7.fm
More informationcorrelated to the Idaho Content Standards Algebra II
correlated to the Idaho Content Standards Algebra II McDougal Littell Algebra and Trigonometry: Structure and Method, Book 2 2000 correlated to the Idaho Content Standards Algebra 2 STANDARD 1: NUMBER
More informationInference in first-order logic. Production systems.
CS 1571 Introduction to AI Lecture 17 Inference in first-order logic. Production systems. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Sentences in Horn normal form Horn normal form (HNF) in
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 informationProblem Session 5 (CFGs) Talk about the building blocks of CFGs: S 0S 1S ε - everything. S 0S0 1S1 A - waw R. S 0S0 0S1 1S0 1S1 A - xay, where x = y.
CSE2001, Fall 2006 1 Problem Session 5 (CFGs) Talk about the building blocks of CFGs: S 0S 1S ε - everything. S 0S0 1S1 A - waw R. S 0S0 0S1 1S0 1S1 A - xay, where x = y. S 00S1 A - xay, where x = 2 y.
More informationFun and Fascinating Bible Reference for Kids Ages 8 to 12. starts on page 3! starts on page 163!
F a Faa R K 8 12 a a 3! a a 163! 2013 a P, I. ISN 978-1-62416-216-9. N a a a a a, a,. C a a a a P, a 500 a a aa a. W, : F G: K Fa a Q &, a P, I. U. L aa a a a Fa a Q & a. C a 2 (M) Ta H P M (K) Wa P a
More informationComputability Theory
CS:4330 Theory of Computation Spring 2018 Computability Theory Decidable Problems of CFLs and beyond Haniel Barbosa Readings for this lecture Chapter 4 of [Sipser 1996], 3rd edition. Section 4.1. Decidable
More informationCS 301. Lecture 18 Decidable languages. Stephen Checkoway. April 2, 2018
CS 301 Lecture 18 Decidable languages Stephen Checkoway April 2, 2018 1 / 26 Decidable language Recall, a language A is decidable if there is some TM M that 1 recognizes A (i.e., L(M) = A), and 2 halts
More informationCS5371 Theory of Computation. Lecture 5: Automata Theory III (Non-regular Language, Pumping Lemma, Regular Expression)
CS5371 Theory of Computation Lecture 5: Automata Theory III (Non-regular Language, Pumping Lemma, Regular Expression) Objectives Prove the Pumping Lemma, and use it to show that there are non-regular languages
More informationECEN 326 Electronic Circuits
ECEN 326 Electronic Circuits Frequency Response Dr. Aydın İlker Karşılayan Texas A&M University Department of Electrical and Computer Engineering High-Frequency Model BJT & MOS B or G r x C f C or D r
More information3.7 Chem. Eqs & 3.8 Balancing Chem. Eqs
3.7 Chem. Eqs & 3.8 Balancing Chem. Eqs Chemical Equations A chemical equation gives the chemical formulas of the reactants on the left of the arrow and the products on the right. Reactants Product C(s)
More informationCS 611 Advanced Programming Languages. Andrew Myers Cornell University. Lecture 26 Type reconstruction. 1 Nov 04. Type reconstruction
CS 611 Advanced Programming Languages Andrew Myers Cornell University Lecture 26 Type reconstruction 1 Nov 04 Type reconstruction Simple typed language: e ::= x b λx:τ. e e 1 e 2 e 1 + e 2 if e 0 then
More informationDeterministic Finite Automata (DFAs)
Algorithms & Models of Computation CS/ECE 374, Fall 27 Deterministic Finite Automata (DFAs) Lecture 3 Tuesday, September 5, 27 Part I DFA Introduction Sariel Har-Peled (UIUC) CS374 Fall 27 / 36 Sariel
More informationA non-turing-recognizable language
CS 360: Introduction to the Theory of Computing John Watrous, University of Waterloo A non-turing-recognizable language 1 OVERVIEW Thus far in the course we have seen many examples of decidable languages
More informationCSL 356: Analysis and Design of Algorithms. Ragesh Jaiswal CSE, IIT Delhi
CSL 356: Analysis and Design of Algorithms Ragesh Jaiswal CSE, IIT Delhi Computational Intractability NP and NP-completeness Computational Intractability: NP & NP-complete NP: A problem X is in NP if and
More informationCS : Speech, NLP and the Web/Topics in AI
CS626-449: Speech, NLP and the Web/Topics in AI Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture-17: Probabilistic parsing; insideoutside probabilities Probability of a parse tree (cont.) S 1,l NP 1,2
More informationEXAM. CS331 Compiler Design Spring Please read all instructions, including these, carefully
EXAM Please read all instructions, including these, carefully There are 7 questions on the exam, with multiple parts. You have 3 hours to work on the exam. The exam is open book, open notes. Please write
More informationAutomata Theory CS S-12 Turing Machine Modifications
Automata Theory CS411-2015S-12 Turing Machine Modifications David Galles Department of Computer Science University of San Francisco 12-0: Extending Turing Machines When we added a stack to NFA to get a
More informationNon-gaussian spatiotemporal modeling
Dec, 2008 1/ 37 Non-gaussian spatiotemporal modeling Thais C O da Fonseca Joint work with Prof Mark F J Steel Department of Statistics University of Warwick Dec, 2008 Dec, 2008 2/ 37 1 Introduction Motivation
More informationComplexity Theory Part I
Complexity Theory Part I Problem Problem Set Set 77 due due right right now now using using a late late period period The Limits of Computability EQ TM EQ TM co-re R RE L D ADD L D HALT A TM HALT A TM
More informationREADME - Syntax. Skolemization. Skolemization - Example 1. Skolemization - Example 1. Skolemization - Example 1. Skolemization - Example 2
README - Syntax Skolemization Logical implication is commonly included in the syntax of first-order and propositional logical languages. The symbol used to denote logical implication differs from language
More informationcse541 LOGIC FOR COMPUTER SCIENCE
cse541 LOGIC FOR COMPUTER SCIENCE Professor Anita Wasilewska Spring 2015 LECTURE 2 Chapter 2 Introduction to Classical Propositional Logic PART 1: Classical Propositional Model Assumptions PART 2: Syntax
More informationCSE 460: Computabilty and Formal Languages Turing Machine (TM) S. Pramanik
CSE 460: Computabilty and Formal Languages Turing Machine (TM) S. Pramanik 1 Definition of Turing Machine A 5-tuple: T = (Q, Σ, Γ, q 0, δ), where Q: a finite set of states h: the halt state, not included
More informationCIT 596 Theory of Computation Spring 2005, 212 Moore, TR PM. Homework Assignment 2
CIT 596 Theory of Computation Spring 2005, 212 Moore, TR 12-1.30PM Homework Assignment 2 Due: Tuesday, February 1, 2005, by 12 PM (IN CLASS) Name: Student ID (8 digits): Email: Signature: PLEASE, READ
More informationFeatures. Symbol Parameter Rating Units V DS Drain-Source Voltage 600 V V GS Gate-Source Voltage ±30 V
General Description These N-Channel enhancement mode power field effect transistors are planar stripe, DMOS technology. This advanced technology has been especially tailored to minimize on-state resistance,
More informationCSE 20. Lecture 4: Introduction to Boolean algebra. CSE 20: Lecture4
CSE 20 Lecture 4: Introduction to Boolean algebra Reminder First quiz will be on Friday (17th January) in class. It is a paper quiz. Syllabus is all that has been done till Wednesday. If you want you may
More information1 Unrestricted Computation
1 Unrestricted Computation General Computing Machines Machines so far: DFAs, NFAs, PDAs Limitations on how much memory they can use: fixed amount of memory plus (for PDAs) a stack Limitations on what they
More informationSYLLABUS. Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 3 : REGULAR EXPRESSIONS AND LANGUAGES
Contents i SYLLABUS UNIT - I CHAPTER - 1 : AUT UTOMA OMATA Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 2 : FINITE AUT UTOMA OMATA An Informal Picture of Finite Automata,
More informationOCR AS LEVEL CHEMISTRY A ATOMS ELECTRON STRUCTURE PERIODICITY (a) (d) TEST
OCR AS LEVEL CHEMISTRY A 1.1.1 ATOMS 1.2.1 ELECTRON STRUCTURE 1.3.1 PERIODICITY (a) (d) TEST Answer all questions Max 47 marks Name.. Mark../47...% Grade Paddington Academy 1 1. Carbon is in the p-block
More informationCS460/626 : Natural Language
CS460/626 : Natural Language Processing/Speech, NLP and the Web (Lecture 23, 24 Parsing Algorithms; Parsing in case of Ambiguity; Probabilistic Parsing) Pushpak Bhattacharyya CSE Dept., IIT Bombay 8 th,
More informationComunicações Ópticas Noise in photodetectors MIEEC EEC038. Henrique Salgado Receiver operation
Comunicações Ópticas Noise in photodetectors 2007-2008 MIEEC EEC038 Henrique Salgado hsalgado@fe.up.pt Receiver operation Noise plays a fundamental role in design of an optical receiver Optical data link
More informationHomework. Turn in Homework #4. The fifth homework assignment has been posted on the course website. It is due on Monday, March 2.
Homework Turn in Homework #4. The fifth homework assignment has been posted on the course website. It is due on Monday, March 2. First-Order Logic Formation Rules and Translations First Order Logic Well-Formed
More informationProcessing/Speech, NLP and the Web
CS460/626 : Natural Language Processing/Speech, NLP and the Web (Lecture 25 Probabilistic Parsing) Pushpak Bhattacharyya CSE Dept., IIT Bombay 14 th March, 2011 Bracketed Structure: Treebank Corpus [ S1[
More informationANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2013 B.E. COMPUTER SCIENCE AND ENGINEERING I TO VIII SEMESTER CURRICULUM AND SYLLABUS SEMESTER I
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS R-2013 B.E. COMPUTER SCIENCE AND ENGINEERING I TO VIII SEMESTER CURRICULUM AND SYLLABUS SEMESTER I 1. HS6151 Technical English I 3 1 0 4 2. MA6151 Mathematics
More informationThe Cross Product. MATH 311, Calculus III. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan The Cross Product
The Cross Product MATH 311, Calculus III J. Robert Buchanan Department of Mathematics Fall 2011 Introduction Recall: the dot product of two vectors is a scalar. There is another binary operation on vectors
More informationCS 275 Automata and Formal Language Theory. Proof of Lemma II Lemma (II )
CS 275 Automata and Formal Language Theory Course Notes Part II: The Recognition Problem (II) Additional Material (This material is no longer taught and not exam relevant) Sect II.2.: Basics of Regular
More informationIntroduction to Artificial Intelligence Propositional Logic & SAT Solving. UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010
Introduction to Artificial Intelligence Propositional Logic & SAT Solving UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010 Today Representation in Propositional Logic Semantics & Deduction
More informationWRITING CHEMICAL FORMULAS & NAMING COMPOUNDS
WRITING CHEMICAL FORMULAS & NAMING COMPOUNDS Electrons in the same group have similar chemical properties because they have the same number of electrons in their valence shell Chemical bonds form between
More informationCS:4330 Theory of Computation Spring Regular Languages. Equivalences between Finite automata and REs. Haniel Barbosa
CS:4330 Theory of Computtion Spring 208 Regulr Lnguges Equivlences between Finite utomt nd REs Hniel Brbos Redings for this lecture Chpter of [Sipser 996], 3rd edition. Section.3. Finite utomt nd regulr
More informationMath 121 Homework 2 Solutions
Math 121 Homework 2 Solutions Problem 13.2 #16. Let K/F be an algebraic extension and let R be a ring contained in K that contains F. Prove that R is a subfield of K containing F. We will give two proofs.
More informationMachine Learning (CS 567) Lecture 3
Machine Learning (CS 567) Lecture 3 Time: T-Th 5:00pm - 6:20pm Location: GFS 118 Instructor: Sofus A. Macskassy (macskass@usc.edu) Office: SAL 216 Office hours: by appointment Teaching assistant: Cheol
More informationCSE302: Compiler Design
CSE302: Compiler Design Instructor: Dr. Liang Cheng Department of Computer Science and Engineering P.C. Rossin College of Engineering & Applied Science Lehigh University February 27, 2007 Outline Recap
More informationKnowledge-based systems
CS 750 Foundations of I Lecture 6 Knowledge-based systems Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square dministration announcements Midterm: Thursda October 6, 07 In-class Closed book What does
More informationEntailment with Conditional Equality Constraints (Extended Version)
Entailment with Conditional Equality Constraints (Extended Version) Zhendong Su Alexander Aiken Report No. UCB/CSD-00-1113 October 2000 Computer Science Division (EECS) University of California Berkeley,
More informationCS21004 Formal Languages and Automata Theory, Spring
CS21004 Formal Languages and Automata Theory, Spring 2011 12 End-Semester Test Maximum marks: 60 Date: 20 Apr 2012 Duration: Three hours Roll no: Name: Write your answers in the question paper itself.
More informationDEPARTMENT OF ELECTRICAL ENGINEERING. Second Year
Syllabus for B.Tech(Electrical Engineering) DEPARTMENT OF ELECTRICAL ENGINEERING Second Year Third Semester Contact Hours/Week Sl Subject Code Theory No. 1 M (CS) 301 Numerical Methods 2 1 0 3 2 2 M302
More informationClassification s,p,d blocks
3.1.4.1 Classification s,p,d blocks 78 minutes 77 marks Page 1 of 7 Q1. (a) Explain why certain elements in the Periodic Table are classified as p-block elements. Illustrate your answer with an example
More informationCourses THEORY. MA101 Calculus-I MA102 Real Analysis & Matrix Theory Business Communications. Chemistry I LABORATORIES
BIRLA INSTITUTE OF TECHNOLOGY- MESRA, RANCHI NEWCOURSE STRUCTURE - To be effective from academic session 208-9 Based on CBCS & OBE model Recommended scheme of study (For Integrated MSc. in Mathematics
More informationSystems of two-sided linear fuzzy relation equations and inequalities and their applications
Systems of two-sided linear fuzzy relation equations and inequalities and their applications Miroslav Ćirić, Jelena Ignjatović Department of Computer Science Faculty of Sciences and Mathematics University
More informationCS460/626 : Natural Language Processing/Speech, NLP and the Web
CS460/626 : Natural Language Processing/Speech, NLP and the Web Lecture 23: Binding Theory Pushpak Bhattacharyya CSE Dept., IIT Bombay 8 th Oct, 2012 Parsing Problem Semantics Part of Speech Tagging NLP
More informationCurriculum for B.Tech. Degree Programme 2017 Batch
INDIAN INSTITUTE OF TECHNOLOGY MADRAS CHENNAI 600 036 Curriculum for B.Tech. Degree Programme 2017 Batch INDIAN INSTITUTE OF TECHNOLOGY MADRAS Curriculum for B.Tech. Degree Programme 2017 Batch Sl.No.
More informationPlanning: situation calculus
CS 57 Introduction to I Lecture 8 Planning: situation calculus Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square utomated reasoning systems Examples and main differences: Theorem provers Prove sentences
More informationAppendix B Impact Table - Proposed Routes
PSC REF#:360505 Impact Table - Proposed s Table B-1 Table B-2 Table B-3 Table B-4 Table B-5 Impact Summaries-Hill Valley Substation Impact Summaries-Mississippi River Routing Area Impact Summaries- Western
More information1. (a) Explain the procedure to convert Context Free Grammar to Push Down Automata.
Code No: R09220504 R09 Set No. 2 II B.Tech II Semester Examinations,December-January, 2011-2012 FORMAL LANGUAGES AND AUTOMATA THEORY Computer Science And Engineering Time: 3 hours Max Marks: 75 Answer
More informationThe model companion of the class of pseudo-complemented semilattices is finitely axiomatizable
The model companion of the class of pseudo-complemented semilattices is finitely axiomatizable (joint work with Regula Rupp and Jürg Schmid) Joel Adler joel.adler@phbern.ch Institut S1 Pädagogische Hochschule
More informationAn extension of HM(X) with bounded existential and universal data-types
Groupe de travail Cristal July, 2003 An extension of HM(X) with bounded existential and universal data-types (To appear at ICFP 03) Vincent Simonet INRIA Rocquencourt Cristal project Vincent.Simonet@inria.fr
More information