• Contact Info
Publications in VIVO

Sankaranarayanan, Sriram

Professor and S.J. Archuleta Endowed Professor

Positions

Research Areas research areas

Research

research overview

  • 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.

keywords

  • Program Verification, Cyber-Physical Systems, Embedded Systems, Dynamical Systems, Monte-Carlo Technique, Logic, Formal Languages, Automata Theory, Theoretical Computer Science

Publications

selected publications

Teaching

courses taught

  • COEN 1830 - Special Topics
    Primary Instructor - Fall 2023
    Explores topics of interest in engineering. Content varies by instructor and semester. May be repeated up to 9 total credit hours.
  • COEN 3930 - Engineering Internship/Co-op
    Primary Instructor - Summer 2021 / Summer 2022 / Summer 2023
    Students enrolled in this course participate in a pre-approved internship or cooperative education program with an employer that allows them to explore the relationship between theory and practice and demonstrate evidence of significant learning (e.g., academic assignments and employer/sponsor evaluations). Credits may apply towards BS or BA degree program in CEAS, please check with the department for specifics (even if student has multiple enrollments in this course and/or COEN 4950).
  • CSCA 5414 - Dynamic Programming, Greedy Algorithms
    Primary Instructor - Fall 2023 / Spring 2024 / Summer 2024 / Fall 2024
    This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. Same as DTSA 5503.
  • CSCA 5424 - Approximation Algorithms and Linear Programming
    Primary Instructor - Fall 2023 / Spring 2024 / Summer 2024 / Fall 2024
    Covers ideas surrounding approximation algorithms including a rigorous mathematical analysis of the approximation guarantees provided by these algorithms. Teaches the use of linear/integer programming formulations for common algorithmic problems and the relation between integer optimization problems and their linear programming relaxations. Introduces key mathematical concepts needed to analyze these algorithms and explores the application of algorithmic concepts to real-world problems.
  • CSCA 5454 - Advanced Data Structures, RSA and Quantum Algorithms
    Primary Instructor - Spring 2024 / Summer 2024 / Fall 2024
    Covers advanced ideas in data structures such as B-Trees and Fibonacci heaps while presenting further applications of amortized analyses. Introduces number theoretic algorithms that form the basis of RSA public-key cryptography. Provides a brief introduction to quantum computing/algorithms by teaching the basics of quantum computation and two important examples of efficient quantum algorithms. Introduces key mathematical concepts needed to analyze these algorithms and explores the application of algorithmic concepts to real-world problems.
  • ... more

Background

awards and honors

International Activities

Other Profiles