User Tools

Site Tools


courses:sdm2011:main

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

courses:sdm2011:main [2011/12/22 12:50]
tsay
courses:sdm2011:main [2022/12/09 11:15] (current)
tsay2 [Announcements]
Line 3: Line 3:
  
 ===== Announcements ===== ===== Announcements =====
 +  * Feb. 05: Grade Report available.
 +  * Dec. 29: {{courses:​sdm2011:​natural_deduction_tactics.pdf|Tactics for Natural Deduction in Coq}} revised (again on Jan. 07).
 +  * Dec. 28: three sample Coq files: {{courses:​sdm2011:​exercise_prop.v|exercise_prop.v}},​ {{courses:​sdm2011:​exercise_pred.v|exercise_pred.v}},​ {{courses:​sdm2011:​exercise_group.v|exercise_group.v}}.
 +  * Dec. 28: {{courses:​sdm2011:​natural_deduction_tactics.pdf|Tactics for Natural Deduction in Coq}}.
   * Dec. 22: bring your notebook computer Dec. 29 with [[http://​coq.inria.fr/​|Coq]] installed.   * Dec. 22: bring your notebook computer Dec. 29 with [[http://​coq.inria.fr/​|Coq]] installed.
   * Dec. 22: slides for OCL revised (just one small change on Slide 6).   * Dec. 22: slides for OCL revised (just one small change on Slide 6).
   * Dec. 21: slides for Automata-Based Model Checking and for Temporal Logic and Automata available.   * Dec. 21: slides for Automata-Based Model Checking and for Temporal Logic and Automata available.
   * Dec. 21: slides for OCL Examples and for Alloy available.   * Dec. 21: slides for OCL Examples and for Alloy available.
-  * Dec. 11: Exercise ​problems for writing first-order formulae available as {{courses:​sdm2011:​hw3.pdf|HW#​3}}.+  * Dec. 11: exercise ​problems for writing first-order formulae available as {{courses:​sdm2011:​hw3.pdf|HW#​3}}.
   * Nov. 24: slides for OCL available.   * Nov. 24: slides for OCL available.
   * Nov. 18: {{courses:​sdm2011:​termproject.pdf|Term Project}} formally announced.   * Nov. 18: {{courses:​sdm2011:​termproject.pdf|Term Project}} formally announced.
Line 18: Line 22:
   * Oct. 05: slides for Team Collaboration and for UML Diagrams available.   * Oct. 05: slides for Team Collaboration and for UML Diagrams available.
   * Sep. 29: {{courses:​sdm2011:​hw1.pdf|HW#​1}} due on Oct. 5.   * Sep. 29: {{courses:​sdm2011:​hw1.pdf|HW#​1}} due on Oct. 5.
-  * Sep. 23: Design Document Skeleton available.+  * Sep. 23: Design Document Skeleton available.
   * Sep. 22: slides for Design Documents available.   * Sep. 22: slides for Design Documents available.
   * Sep. 14: slides for Course Introduction and Overview of UML available.   * Sep. 14: slides for Course Introduction and Overview of UML available.
Line 64: Line 68:
   * **Software Security: Web Application Security** (1 week: 10/27) \\ Dynamic Web pages, client-side scripts, security vulnerabilities,​ vulnerabilities detection and prevention \\ [slides: {{courses:​sdm2011:​WebProgramming.pdf|Web Programming}},​ {{courses:​sdm2011:​web_app_security.pdf|Web Application Security}}]   * **Software Security: Web Application Security** (1 week: 10/27) \\ Dynamic Web pages, client-side scripts, security vulnerabilities,​ vulnerabilities detection and prevention \\ [slides: {{courses:​sdm2011:​WebProgramming.pdf|Web Programming}},​ {{courses:​sdm2011:​web_app_security.pdf|Web Application Security}}]
   * **Formal Logic: A Pragmatic Introduction** (.5 week: 11/03a) \\ Propositions,​ proofs, predicates, models, theorems \\ [{{courses:​sdm2011:​logic.pdf|slides}};​ notes:​{{courses:​sdm2011:​natural_deduction.pdf|Natural Deduction}}]   * **Formal Logic: A Pragmatic Introduction** (.5 week: 11/03a) \\ Propositions,​ proofs, predicates, models, theorems \\ [{{courses:​sdm2011:​logic.pdf|slides}};​ notes:​{{courses:​sdm2011:​natural_deduction.pdf|Natural Deduction}}]
-  * **Formal Logic: Propositional and First-Order Logics** (1.5 weeks: 11/03b, 11/10) \\ Satisfiability,​ tautologies,​ validity, deduction/​proofs,​ soundness, completeness \\ [slides:​{{courses:​sdm2011:​logic_propositional.pdf|Propositional Logic}}, {{courses:​sdm2011:​logic_first_order.pdf|First-Order Logic}}]+  * **Formal Logic: Propositional and First-Order Logics** (1.5 weeks: 11/03b, 11/10) \\ Satisfiability,​ tautologies,​ validity, deduction/​proofs,​ soundness, completeness \\ [slides:​{{courses:​sdm2011:​logic_propositional.pdf|Propositional Logic}}, {{courses:​sdm2011:​logic_first_order.pdf|First-Order Logic}}; notes: ​ {{courses:​sdm2011:​natural_deduction_tactics.pdf|Tactics for Natural Deduction in Coq}}, {{courses:​sdm2011:​exercise_prop.v|exercise_prop.v}},​ {{courses:​sdm2011:​exercise_pred.v|exercise_pred.v}},​ {{courses:​sdm2011:​exercise_group.v|exercise_group.v}}]
   * **Software Modeling: OCL** (1 week: 11/17) \\ Object Constraint Language (//relation with UML models, values, types, expressions, ​ objects, properties, collection operations//​) \\ [{{courses:​sdm2011:​OCL.pdf|slides}};​ notes: {{courses:​sdm2011:​OCL_examples.pdf|OCL Examples}}]   * **Software Modeling: OCL** (1 week: 11/17) \\ Object Constraint Language (//relation with UML models, values, types, expressions, ​ objects, properties, collection operations//​) \\ [{{courses:​sdm2011:​OCL.pdf|slides}};​ notes: {{courses:​sdm2011:​OCL_examples.pdf|OCL Examples}}]
   * **Software Modeling: Alloy** (1 week: 11/24)\\ Software modeling, simulation, and checking \\ [{{courses:​sdm2011:​Alloy.pdf|slides}}]   * **Software Modeling: Alloy** (1 week: 11/24)\\ Software modeling, simulation, and checking \\ [{{courses:​sdm2011:​Alloy.pdf|slides}}]
courses/sdm2011/main.1324529421.txt.gz · Last modified: 2011/12/22 12:50 by tsay