Topics in trust have their underpinnings in many kinds of fundamental mathematics and theory. The courses in the Trust Theory Roadmap are identified as a subset of courses that are particularly relevant to one or more areas of security, dependability, and trust assessment. Some of these courses may be essential for understanding courses in the other areas and serve as prerequisites.
This course provides the basis for a number of areas of algorithms, including graph algorithms, arithmetic algorithms, string problems, parallel algorithms, and NP-completeness. Prerequisites are CS 225 and CS 373. It is available Spring 2010.
"Formal methods" is a term that refers to a diverse collection of techniques, with strong mathematical foundations, that are used to provide assurance about the correctness of software and hardware systems. The course aims to familiarize students interested in software engineering with languages and methods for formal specification, development, and verification. Prerequisites are CS 225 or CS 400, and CS 273 or MATH 414. Available Spring 2010.
This course lays the theoretical groundwork for later courses in simulation and stochastic methods. It covers the basic concepts of random processes at a fairly rigorous level, and also discusses applications to communications, signal processing, and control systems engineering. To follow the course, in addition to basic notions of probability theory, students are expected to have some familiarity with the basic notions of sets, sequences, convergence, linear algebra, linear systems, and Fourier transforms. Prerequisites are ECE 313, MATH 461, or STAT 400. It is available Spring 2010.
An understanding of the theory of control systems enables formal analysis of systems to enable quantitative measures of the trustworthiness of a system. This course introduces analysis and design of control systems with emphasis on modeling, state variable representation, computer solutions, modern design principles, and laboratory techniques. Prerequisite is ECE 210. Available Spring 2010.
This course discusses basic principles, modeling, optimization, and designing to meet specifications. Prerequisite is ECE 486. It is available Spring 2010. Topics to be treated include:
This course provides much of the background needed to understand cryptographic methods. It includes general discussion on coding theory with emphasis on the algebraic theory of cyclic codes using finite field arithmetic, decoding of BCH and Reed-Solomon codes, finite field Fourier transform and algebraic geometry codes, convolutional codes, and trellis decoding algorithms. Prerequisite is MATH 417.
Mathematical models for channels and sources; entropy, information, data compression, channel capacity, Shannon's theorems, and rate-distortion theory. Prerequisite is one of ECE 534, MATH 464, and MATH 564.
Ethical issues in the practice of engineering: safety and liability, professional responsibility to clients and employers, whistle-blowing, codes of ethics, career choice, legal obligations, and case studies. Prerequisites are junior standing and RHET 105. Available Spring 2010.
This course concentrates on the theory and practice of computer and information ethics. It covers the basics of ethical decision-making, and emphasizes group work and presentations. Topics studied in the course include risk and reliability, privacy, infowar, crime, access, business ethics, copyright, patents, and more. Prerequisites are CS 225 and junior standing. It is available Spring 2010.