Dr. Sankaranarayanan is primarily interested in formal verification techniques, especially for hybrid cyber-physical systems (CPS) which model discrete programs interacting with a continuous environment. In this regard, his work explores the application of techniques from areas such as convex optimization, algebraic geometric methods, combinatorial optimization, symbolic and numerical decision procedures to analyze the behavior of programs and verify key temporal properties such as safety, termination, liveness and stability. His recent work applies Monte-Carlo sampling, rare-event simulations and extreme value theory to develop novel verification techniques for cyber-physical systems is ongoing. Finally, his group is actively extending the scope of verification from verifying the software systems to verifying systems with human operators in the loop using cognitive science techniques to understand and model the behavior of human operators.
Path-Following through Control Funnel Functions.
Proceedings of the ... IEEE/RSJ International Conference on Intelligent Robots and Systems. IEEE/RSJ International Conference on Intelligent Robots and Systems.
401-408.
2018
Symbolic Deadlock Analysis in Concurrent Libraries and their Clients.
Proceedings / IEEE International Conference, Automated Software Engineering ; sponsored by IEEE Computer Society, NASA Ames Research Center, in cooperation with AAAI, ACM SIGART and SIGSOFT. IEEE International Automated Software Enginee....
480-491.
2009
CSCI 3155 - Principles of Programming Languages
Primary Instructor
-
Fall 2018 / Spring 2019 / Spring 2020
Studies fundamental concepts on which programming of languages are based, and execution models supporting them. Explores values, variables, bindings, type systems, control structures, exceptions, concurrency, and modularity. Learn how to select a language and to adapt to a new language. Same as CSPB 3155.
CSCI 5454 - Design and Analysis of Algorithms
Primary Instructor
-
Fall 2018 / Spring 2019
Techniques for algorithm design, analysis of correctness and efficiency; divide and conquer, dynamic programming, probabilistic methods, advanced data structures, graph algorithms, etc. Lower bounds, NP-completeness, intractability. Recommended prerequisite: CSCI 2270 or equivalent.
CSCI 5654 - Linear Programming
Primary Instructor
-
Spring 2020
Presents algorithms, simplex and modifications. Examines theory-duality and complementary slackness. Involves network flow algorithms. Introduces integer programming. Recommended prerequisite: linear algebra.
CSCI 7000 - Current Topics in Computer Science
Primary Instructor
-
Spring 2019
Covers research topics of current interest in computer science that do not fall into a standard subarea. May be repeated up to 8 total credit hours.
CSCI 7135 - Topics in Programming Languages
Primary Instructor
-
Fall 2018
Topics selected by instructor. Possible topics are syntax, semantics, metacompilers, compiler design, and translator writing systems. Department consent required.
