PROGRAM VERIFICATION AND SYNTHESIS

COMPSCI 703

Course Description

Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.

Prerequisties

Graduate/professional standing

Satisfies

This course does not satisfy any prerequisites.

Credits

Not Reported

Offered

Not Reported

Grade Point Average

3.92

5.4% from Historical

Completion Rate

100%

No change from Historical

A Rate

88%

44.81% from Historical

Class Size

53.85% from Historical

Instructors (2025 Fall)

Sorted by ratings from Rate My Professors

Similar Courses

PROGRAMMING III

COMPSCI 400

The third course in our programming fundamentals sequence. It presumes that students understand and use functional and object-oriented design and abstract data types as needed. This course introduces balanced search trees, graphs, graph traversal algorithms, hash tables and sets, and complexity analysis and about classes of problems that require each data type. Students are required to design and implement using high quality professional code, a medium sized program, that demonstrates knowledge and use of latest language features, tools, and conventions. Additional topics introduced will include as needed for projects: inheritance and polymorphism; anonymous inner classes, lambda functions, performance analysis to discover and optimize critical code blocks. Students learn about industry standards for code development. Students will design and implement a medium size project with a more advanced user-interface design, such as a web or mobile application with a GUI and event- driven implementation; use of version-control software.

INTRODUCTION TO THEORY OF COMPUTING

COMPSCI 520

Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.

INTRODUCTION TO THE THEORY AND DESIGN OF PROGRAMMING LANGUAGES

COMPSCI 538

Design and theory of programming languages: procedural, object-oriented, functional and logic paradigms. Serial and concurrent programming. Execution models and formal specification techniques.

CONSTRUCTION OF COMPILERS

COMPSCI 701

Principles of the design and implementation of programming languages. Topics include: Principles of compilation, static program analysis, compilation methods to support profiling, and code-generation methods. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.

PRINCIPLES OF PROGRAMMING LANGUAGES

COMPSCI 704

Introduction to principles of advanced programming languages and programming-language theory. Topics include: lambda-calculus, functional languages, polymorphic functions, type inference, structural induction, lazy evaluation, operational semantics, denotational semantics, and axiomatic semantics. Students are strongly encouraged to have knowledge of programming languages, such as fromCOMP SCI 536.