printer friendly pageCS 204: Computational Law
Legal informatics based on representation of regulations in computable form. Encoding regulations facilitate creation of legal information systems with significant practical value. Convergence of technological trends, growth of the Internet, advent of semantic web technology, and progress in computational logic make computational law prospects better. Topics: current state of computational law, prospects and problems, philosophical and legal implications. Prerequisite: basic concepts of programming.
CS 205B: Mathematical Methods for Fluids, Solids, and Interfaces
Numerical methods for simulation of problems involving solid mechanics and fluid dynamics. Focus is on practical tools needed for simulation, and continuous mathematics involving nonlinear hyperbolic partial differential equations. Possible topics: finite element method, highly deformable elastic bodies, plasticity, fracture, level set method, Burgers' equation, compressible and incompressible Navier-Stokes equations, smoke, water, fire, and solid-fluid coupling. Prerequisite: 205A or equivalent.
CS 208: The Canon of Computer Science
Analysis and discussion of influential and inspiring writings in computer science. Original works by Turing, von Neumann, Shannon, Bush, Engelbart, Licklider, Kay, Feynman, and others. Emphasis on writings that shaped the field and continue to provoke and stimulate. The visions that inspired personal computing, computer networks, the GUI, the Web, and other key developments.
Instructors:
Koltun, V. (PI)
CS 209: Introduction to Functional Programming
Functional programming offers insights and advanced programming techniques not found in other programming languages. Topics: lambda calculus (an alternative to Turing machines), higher-order functions, lazy evaluation, type-oriented programming, syntactic extension, and advanced control abstractions known as monads and continuations. Functional programming languages to be studied include Scheme, an eagerly evaluated, dynamically typed language, and Haskell, a lazily evaluated, statically typed language with type inferencing. Prerequisites:
CS 107 and
CS 161.
CS 224S: Speech Recognition and Synthesis (LINGUIST 285)
Automatic speech recognition, speech synthesis, and dialogue systems. Focus is on key algorithms including noisy channel model, hidden Markov models (HMMs), Viterbi decoding, N-gram language modeling, unit selection synthesis, and roles of linguistic knowledge. Prerequisite: programming experience. Recommended:
CS 221 or 229.
CS 240E: Low Power Wireless System Software
The structure and implementation of software systems for low power embedded sensors; how to build software that can run unattended for years on small batteries. Topics: hardware trends, energy profiles, execution models, aggregation, storage, application requirements, allocation, power management, resource management, scheduling, time synchronization, programming models, software design, and fault tolerance. Students build working systems on TinyOS, a low-power embedded operation system.
CS 256: Formal Methods for Reactive Systems
Formal methods for specification, verification, and development of concurrent and reactive programs. Reactive systems: syntax and semantics, fairness requirements. Specification language: temporal formulas (state, future, and past) and omega-automata. Hierarchy of program properties: safety, guarantee, obligation, response, persistence, and reactivity. Invariant generation. Deductive verification of programs: verification diagrams and rules, completeness. Modularity. Parameterized programs. Algorithmic verification of finite-state programs (model checking). Prerequisite: 154, 156, 157, or equivalent.
| Repeatable
for credit
CS 256L: Formal Methods for Reactive Systems Laboratory
Practical application of the specification and verification methods in 256. Individual projects include implementation of verification methods, verification case studies, or tool evaluation, depending on student preference.
CS 258: Introduction to Programming Language Theory
Syntactic, operational, and semantic issues in the mathematical analysis of programming languages. Type systems and non-context-free syntax. Universal algebra and algebraic data types. Operational semantics given by rewrite rules; confluence and termination. Denotational semantics and elementary domain theory for languages with higher-type functions and recursion. Treatment of side effects. Prerequisites: 154, 157 or
PHIL 160A.
CS 259: Security Analysis of Network Protocols
Hands-on experience in formal methods to verify and evaluate the security of network protocols and other systems. Common security protocols and their properties including secrecy, authentication, key establishment, and fairness. Topics: standard formal models and tools used in security protocol analysis; their advantages and limitations. Fully automated, finite-state, model-checking techniques. Constraint solving, process algebras, protocol logics, probabilistic model checking, and game theory. Students select a protocol or secure system to analyze, specify it in the chosen model, use a formal analysis tool to verify its properties, and present findings.
Filter Results: