Formal Methods. D AVID B OWIE 1947 - 2016  Dr. Barry Wittman  Not Dr. Barry Whitman  Education:  PhD and MS in Computer Science, Purdue University.

Slides:



Advertisements
Similar presentations
Secure Operating Systems Lesson 1: Introductions and Expectations.
Advertisements

What’s wrong with this proof? If you figure it out, don’t call it out loud – let others ponder it as well. 1. Let a and b be non-zero such thata = b 2.
5/19/2015CS 2011 CS 201 – Data Structures and Discrete Mathematics I Syllabus Spring 2014.
CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
CS – 600 Discrete Structures for Computer Science Prof. Angela Guercio Spring 2008.
If you don't have a syllabus, then raise your hand (and keep it up until we get you one.) Presentation: "Syllabus" Spring 2011 PHI 120 Sections 01-09:
Dr. Tatiana Erukhimova [year] Overview of Today’s Class Folders Syllabus and Course requirements Tricks to survive Mechanics Review and Coulomb’s Law.
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
CSE 311 Foundations of Computing I Autumn 2011 Lecture 2 More Propositional Logic Application: Circuits Propositional Equivalence.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
A Brief Calculus Course
The Foundations: Logic and Proofs
Computer Security.  Dr. Barry Wittman  Not Dr. Barry Whitman  Education:  PhD and MS in Computer Science, Purdue University  BS in Computer Science,
Welcome to CS/MATH 320L – Applied Discrete Mathematics Spring 2015
7-Sep-15 Physics 1 (Garcia) SJSU Conceptual Physics (Physics 1) Prof. Alejandro Garcia Spring 2007.
Intro to Discrete Structures
Discrete Maths 2. Propositional Logic Objective
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
Developmental Reading 0070W01, 0080W01, 0090W01 7:30am to 9:50am 0070W02, 0080W02, 0090W02 10:00am to 12:20pm 0070W03, 0080W03, 0090W03 12:30pm to 2:50pm.
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
MAT 0145 College Readiness Math II Spring 2015
Welcome to CS 3260 Dennis A. Fairclough. Overview Course Canvas Web Site Course Materials Lab Assignments Homework Grading Exams Withdrawing from Class.
Systems Programming.  Dr. Barry Wittman  Not Dr. Barry Whitman  Education:  PhD and MS in Computer Science, Purdue University  BS in Computer Science,
PHY 1401 General College Physics (Gen Phy 1) Spring 2010 North Ridge Campus.
+ BIOL 103, Introduction to Nutrition Course Syllabus Outline.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
Computer Graphics.  Dr. Barry Wittman  Education:  PhD and MS in Computer Science, Purdue University  BS in Computer Science, Morehouse College 
Dr. Naveed Riaz Design and Analysis of Algorithms 1 1 Formal Methods in Software Engineering Lecture # 24.
CSC Discrete Mathematical Structures Dr. Karl Ricanek Jr.
Algorithms and Data Structures.  Dr. Barry Wittman  Not Dr. Barry Whitman  Education:  PhD and MS in Computer Science, Purdue University  BS in Computer.
Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.
Fall 2002CMSC Discrete Structures1 Let’s get started with... Logic !
ECE 1100: Introduction to Electrical and Computer Engineering Wanda Wosik Associate Professor, ECE Dept. Notes 1 Spring 2011 Slides adapted from lectures.
1 CPRE210: Introduction to Digital Design Instructor –Arun K. Somani –Tel: – –Office Hours: MWF 10:00-11:00 Teaching Assistant.
PHY 1405 Conceptual Physics (CP 1) Spring 2010 Cypress Campus.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
Welcome to CMPSC 360!. Today Introductions Student Information Sheets, Autobiography What is Discrete Math? Syllabus Highlights
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
Introduction COMP283 – Discrete Structures. JOOHWI LEE Dr. Lee or Mr. Lee ABD Student working with Dr. Styner
Matter and Interactions 1 Fall 2006 Matter & Interactions I Physics Professor & Lecturer: Dr. Reinhard Schumacher Teaching Assistants: Ms. Elisa.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
Please turn off cell phones, pagers, etc.. Welcome to Stat Joe Schafer Associate Professor Department of Statistics and The Methodology Center.
1/10/ Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007 Suprakash Datta Office: CSEB 3043 Phone:
COP4610/CGS5765 Operating Systems Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: W M F 9:10am – 10:00am, or by appointments.
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
CST 223 Concepts of Programming Languages Dr. Sherry Yang PV 171
Welcome to Astronomy 113 “ It would seem that you have no useful skill or talent whatsoever, he said.
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
Functions and Statistics/ Algebra I Ms. Jackson Room 505.
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
Faculty Expectations University of Louisville Disability Resource Center.
All important information will be posted on Blackboard
COMP 283 Discrete Structures
Lecture 1 – Formal Logic.
CS 201 – Data Structures and Discrete Mathematics I
MA Fall 2016 Instructor: Matt Weaver Office: MATH 615
Jeremy Bolton, PhD Assistant Teaching Professor
COMS 161 Introduction to Computing
Welcome to College English 2!
Welcome to College English 2!
Welcome to College English 2!
Discrete Structures Prepositional Logic 2
Computer Science Practicum – Writing Intensive
MA Fall Instructor: Tim Rolling -Office: MATH 719 -
MA Fall 2018 Instructor: Hunter Simper Office: Math 607
Welcome to College English 2!
Presentation transcript:

Formal Methods

D AVID B OWIE

 Dr. Barry Wittman  Not Dr. Barry Whitman  Education:  PhD and MS in Computer Science, Purdue University  BS in Computer Science, Morehouse College  Hobbies:  Reading, writing  Enjoying ethnic cuisine  DJing  Lockpicking

  Office:Esbenshade 284B  Phone:(717)  Office hours: MWF 11:00am – 12:00pm MF 3:30 – 5:00pm T 1:00 – 3:00pm And by appointment  Website:

 Susanna S. Epp  Discrete Mathematics with Applications  4 th Edition, 2010, Brooks Cole  ISBN-10:  ISBN-13:

 You are expected to read the material before class  If you're not prepared, you will be asked to leave  You will forfeit the opportunity to take quizzes  Much more importantly, you will forfeit the education you have paid around $100 per class meeting to get

 It’s mostly discrete math  Meaning math that is not continuous  It is not discreet math  Meaning math that won’t tell people what you did  There are certain kinds of math that are really beneficial to CS  We have collected a big chunk of these and put them in this course  It’s a grab bag

 Logic  Proofs  Basic number theory  Mathematical induction  Set theory  Functions and relations  Counting and probability  Graphs and trees  Regular expressions and finite automata  Running time  Formal languages and grammars

 For more information, visit the webpage:  The webpage will contain:  The most current schedule  Notes available for download  Reminders about exams and homework  Syllabus (you can request a printed copy if you like)  Detailed policies and guidelines  Piazza will allow for discussion and questions about assignments:

 30% of your grade will be ten equally weighted homework assignments  Each will focus on a different set of topics from the course  All homework is to be done individually  I am available for assistance during office hours, through Piazza, and through

 Homework assignments must be turned in by saving them in your class folder ( J:\SP \CS322A ) before the deadline  Do not put assignments in your public directories  Late homework will not be accepted  Paper copies of homework will not be accepted  Each homework done in LaTeX will earn 0.5% extra credit toward the final semester grade  Doing every homework in LaTeX will raise your final grade by 5% (half a letter grade)

 5% of your grade will be lectures that you give  You will give roughly two of these lectures at any time during the semester, without any warning  You will have 3 to 5 minutes in which you must present the material to be read for that day  Students are encouraged to ask questions  There is no better way to learn material than by teaching it  Polishing public speaking skills is never a bad thing

 5% of your grade will be pop quizzes  These quizzes will be based on material covered in the previous one or two lectures  They will be graded leniently  They are useful for these reasons: 1. Informing me of your understanding 2. Feedback to you about your understanding 3. Easy points for you 4. Attendance

 There will be three equally weighted in-class exams totaling 45% of your final grade  Exam 1:2/08/2016  Exam 2:3/11/2016  Exam 3:4/11/2016  The final exam will be worth 15% of your grade  Final:2:30 – 5:30pm 5/05/2016

WeekStartingTopicsChapters 101/11/16Propositional logic2 201/18/16Predicate logic3 301/25/16Proofs4 402/01/16Number theory4 502/08/16Mathematical induction5 602/15/16Set theory6 702/22/16Functions7 02/29/16Spring Break 803/07/16Relations8 903/14/16Counting and probability9 1003/21/16Counting and probability continued9 1103/28/16Graphs and trees /04/16Running time /11/16Regular languages /18/16Higher level languagesHandouts 1504/25/16Review Handouts

30% Ten homeworks 5% Impromptu student lectures 5% Quizzes 45% Three equally weighted midterm exams 15% Final exam

 Don’t cheat  First offense:  I will give you a zero for the assignment, then lower your final letter grade for the course by one full grade  Second offense:  I will fail you for the course and try to kick you out of Elizabethtown College  Refer to the Student Handbook for the official policy  Ask me if you have questions or concerns

Elizabethtown College welcomes otherwise qualified students with disabilities to participate in all of its courses, programs, services, and activities. If you have a documented disability and would like to request accommodations in order to access course material, activities, or requirements, please contact the Director of Disability Services, Lynne Davies, by phone ( ) or If your documentation meets the college’s documentation guidelines, you will be given a letter from Disability Services for each of your professors. Students experiencing certain documented temporary conditions, such as post-concussive symptoms, may also qualify for temporary academic accommodations and adjustments. As early as possible in the semester, set up an appointment to meet with me, the instructor, to discuss the academic adjustments specified in your accommodations letter as they pertain to my class.

 Consider three boxes A, B, and C  One contains gold, but the other two are empty  Each box has a message printed on it  Two of the messages are lies, and one is telling the truth  Which box has the gold? The gold is not here. The gold is in Box B. ABC

 On a given island, everyone is either a Knight or a Knave  Knights always tell the truth, and Knaves always lie  Imagine that I meet two inhabitants of this island and ask, "Is either of you a Knight?"  Given his response, I know the answer to my question  Are the inhabitants in question Knights or Knaves?

 Politicians lie.  True statement!  Cast iron sinks.  True statement!  Politicians lie in cast iron sinks.  Absurd statement!

 Propositional logic is the logic that governs statements  A statement is either true or false (but nothing else!)  We want to combine them, infer things about them, prove them true or false  First, we have to learn their rules

 "The moon is made of green cheese" is a statement, that is, something that is either true or false  It takes a long time to write "The moon is made of green cheese"  Mathematicians are lazy, and so they let a variable represent this statement  p and q are common choices for propositional logic  So, we can use p in place of "The moon is made of green cheese"  Similarly, we can use q in place of "The earth is made of rye bread"

 Like programming, combining two values with AND will be true only if both values are true  Using OR makes the result true if either is true  NOT changes a true to false and a false to true  Mathematicians use their own symbols for AND, OR, and NOT OperationSymbolExample AND  p  q OR  p  q NOT~~p~p

 To better understand an operation, we can make a truth table, giving all possible input values and the corresponding output values  This truth table is for p  q pq p  qp  q TTT TFT FTT FFF

 What’s the truth table for q  p?  Consider: (p  q)  ~(p  q)  What’s its truth table?  What’s its meaning?  What’s the truth table for p  q  r?  How many lines are in a truth table with n symbols?  How many different truth tables are possible for two input symbols?

 Two different statements can be written differently and yet be logically equivalent  p  ~(~p)  Make a truth table  If all outputs match up, the statements are logically equivalent  If even one output doesn’t match, the statements are not equivalent

 What’s an expression that logically equivalent to ~(p  q) ?  What about logically equivalent to ~(p  q) ?  De Morgan’s Laws state:  ~(p  q)  ~p  ~q  ~(p  q)  ~p  ~q  Essentially, the negation flips an AND to an OR and vice versa

 You can construct all possible outputs using combinations of AND, OR, and NOT  But, sometimes it’s useful to introduce notation for common operations  This truth table is for p  q pq p  qp  q TTT TFF FTT FFT

 We use  to represent an if-then statement  Let p be "The moon is made of green cheese"  Let q be "The earth is made of rye bread"  Thus, p  q is how a logician would write:  If the moon is made of green cheese, then the earth is made of rye bread  Here, p is called the hypothesis and q is called the conclusion  What other combination of p and q is logically equivalent to p  q ?

 More on implications  Validity of arguments  Tautologies and contradictions  Rules of inference  Examples with digital circuits

 Read Chapter 2