CS 6112 (Fall 2011)

Foundations of Concurrency
Tuesday & Thursday 1:25pm-2:40pm
Upson Hall, Room 5130

Syllabus

This course introduces foundational models and real-world abstractions for describing and reasoning about concurrent systems.

Part I: Foundational models

  • CCS
  • Labeled transition systems
  • π-calculus
  • Observation Equivalence
  • Bisimulation
  • Synchronous vs. asynchronous
  • Type systems
  • Mobility
Part II: Real-world abstractions
  • Actors
  • Concurrent Collections
  • CML
  • F♯'s Async
  • Monads
  • Concurrent Revisions
  • OCaml's lwt
  • Promises and futures
  • Thorn

Evaluation

Evalaution will be based on class participation and course projects. There will not be preliminary or final exams.

Academic Integrity

All students are expected to conduct themselves with the utmost integrity. Academic integrity is rarely an issue in graduate courses, but unfortunately it does arise from time to time, so we want to be clear. Under no circumstances may you hand in work done with or by someone else under your own name or share code or detailed proofs with anyone else except your study group. If you are unsure about what is allowed and what is not, please ask. See here for the university code of academic integrity.

Special Needs and Wellness

The instructor will provide reasonable accommodations to students with documented disabilities (e.g., physical, learning, psychiatric, vision, hearing, or systemic) that may affect their ability to participate in course activities or to meet course requirements. Students with disabilities are encouraged to contact Student Disability Services at 607-254-4545, or the instructor for a confidential discussion of their individual needs.

If you are experiencing undue personal or academic stress at any time during the semester or need to talk to someone who can help, contact the instructor or:

Validate XHTMLValidate CSS
Last updated November 2011