KMap
Saumya Debray is Professor of Computer Science at The University of Arizona, where he has been a faculty member since August 1986. Prior to this, he received a B.Tech. (Hons.) degree in Electronics and Electrical Communications Engineering from the Indian Institute of Technology, Kharagpur, in 1981; and M.S. and Ph.D. degrees in computer science, from the State University of New York at Stony Brook, in 1983 and 1986 respectively.

VOSviewer

Courses
  • CSS
    Compilers and Systems Software

  • WP
    Web Programming

  • SPU
    Systems Programming and Unix

  • PC
    Principles of Compilation

  • ICPII
    Introduction to Computer Programming II

Grants
  • Funding agency logo
    DASS: A Framework for Accountable Smart Contracts Wills

    Co-Investigator (COI)

    2022

    $748.3K
    Active
  • Funding agency logo
    SaTC: CORE: Small: Reasoning About Dependencies and Information Flow in Dynamic Code

    Principal Investigator (PI)

    2019

    $515.3K
    Active
  • Funding agency logo
    GRASP: Global Reading and Assembly for Semantic, Probabilistic World Models

    Co-Investigator (COI)

    2017

    $9.6M
  • Funding agency logo
    GRASP: Global Reading and Assembly for Semantic, Probabilistic World Models

    Co-Investigator (COI)

    2017

    $1.1M
  • Funding agency logo
    TWC: Small: Understanding Anti-Analysis Defenses in Malicious Code

    Principal Investigator (PI)

    2015

    $531.9K
  • Funding agency logo
    PFI AIR-TT: Improving Data Base Management System Performance Through Micro-Specialization

    Co-Investigator (COI)

    2014

    $201.5K
  • Funding agency logo
    Large-memory Workstation for Analysis of Obfuscated Malware Code

    Principal Investigator (PI)

    2014

    $39.9K
  • Funding agency logo
    III: Small: Extending and Automating Dynamic Specialization of Database Management Systems

    Co-Investigator (COI)

    2013

    $496.8K
  • Funding agency logo
    TWC TTP: Small: Mitigating Insider Attacks in Provenance Systems

    Co-Investigator (COI)

    2013

    $496.1K
  • Funding agency logo
    Tools for Rapid Understanding of Malware Code

    Principal Investigator (PI)

    2011

    $590.0K
Technologies / Patents
      News
      • UA Grad's Little Firm Tackles Big-Data Solutions

        2015

      • From Grad School to Startup

        2014

      • Catapulting UA Discoveries to the World

        2014

      • UA Alumna's Impact, From Google to India

        2013

      • Tucson Startup Dataware Ventures Takes Off With Help from Tech Launch Arizona

        2013

      • Two UA Inventions Selected as AZ Furnace Startups

        2012

      • UA Computer Scientist Earns International Honor

        2011

      • UA School Promotes Interdisciplinary Teaching in Computation

        2009

      • New Lecture Series Centers on Security Issues

        2009

      • Research Forum Acknowledges Undergraduate Scholarship

        2008

      Publications (89)
      Recent
      • span style= color:#222222;font-size:small; Automatically Localizing Dynamic Code Generation Bugs in JIT Compiler Back-End /span

        2023

      • Modeling Code Manipulation in JIT Compilers

        2022

      • Automated Bug Localization in JIT Compilers

        2021

      • Optimization to the Rescue: Evading Binary Code Stylometry with Adversarial Use of Code Optimizations

        2021

      • A Framework for Automatic Exploit Generation for JIT Compilers

        2021

      • Representing and Reasoning About Dynamic Code

        2020

      • Probabilistic Obfuscation through Covert Channels

        2017

      • Analysis of Exception-Based Control Transfers

        2017

      • Control Dependencies in Interpretive Systems

        2017

      • Language-Agnostic Optimization and Parallelization for Interpreted Languages

        2017

      • Micro-Specialization on Modern DBMS Architecture

        2016

      • Symbolic Execution of Obfuscated Code

        2015

      • Identifying and Understanding Self-Checksumming Defenses in Software

        2015

      • Modeling Metamorphism by Abstract Interpretation

        2015

      • A Generic Approach to Automatic Deobfuscation of Executable Code

        2015

      • Bit-Level Taint Analysis.

        2014

      • A Framework for Understanding Dynamic Anti-Analysis Defenses

        2014

      • A simple client-side defense against environment-dependent web-based malware

        2013

      • Weaknesses in defenses against web-borne malware (short paper)

        2013

      • Automatic simplification of obfuscated JavaScript code

        2012

      • Micro-specialization in DBMSes

        2012

      • Application of micro-specialization to query evaluation operators

        2012

      • Automatic simplification of obfuscated JavaScript code: A semantics-based approach

        2012

      • Micro-specialization: Dynamic code specialization of database management systems

        2012

      • Deobfuscation of virtualization-obfuscated software: A semantics-based approach

        2011

      • Equational reasoning on x86 assembly code

        2011

      • Reverse engineering self-modifying code: Unpacker extraction

        2010

      • Modelling metamorphism by abstract interpretation

        2010

      • Static detection of disassembly errors

        2009

      • Automatic static unpacking of malware binaries

        2009

      • Code compaction of an operating system kernel

        2007

      • A semantics-based approach to malware detection

        2007

      • The revenge of the overlay: Automatic compaction of OS kernel code via on-demand code loading

        2007

      • Unpredication, unscheduling, unspeculation: Reverse engineering itanium executables

        2005

      • Editorial: Programming languages track

        2005

      • Deobfuscation reverse engineering obfuscated code

        2005

      • Code compression

        2005

      • Visualizing the behavior of dynamically modifiable code

        2005

      • Software protection through dynamic code mutation

        2005

      • Writing efficient programs: Performance issues in an undergraduate CS curriculum

        2004

      • Obfuscation of executable code to improve resistance to static disassembly

        2003

      • Unscheduling, Unpredication, Unspeculation: Reverse Engineering Itanium Executables

        2003

      • Cold code decompression at runtime

        2003

      • Load redundancy elimination on executable code

        2003

      • Profile-directed optimization of event-based programs

        2002

      • Making compiler design relevant for students who will (most likely) never design a compiler

        2002

      • Profile-guided code compression

        2002

      • Combining global code and data compaction

        2001

      • Constraint-based termination analysis for cyclic active database rules

        2000

      • Compiler techniques for code compaction

        2000

      • On the complexity of flow-sensitive dataflow analyses

        2000

      • Return value placement and tail call optimization in high level languages

        1999

      • Alias analysis of executable code

        1998

      • Interprocedural Control Flow Analysis of First-Order Programs with Tail-Call Optimization

        1997

      • Resource-Bounded Partial Evaluation

        1997

      • A simple approach to supporting untagged objects in dynamically typed languages

        1997

      • A Methodology for granularity-based control of parallelism in logic programs

        1996

      • Detection and optimization of suspension-free logic programs

        1996

      • Generalized semantics and abstract interpretation for constraint logic programs

        1995

      • Experiences with high-level parallel programming systems

        1995

      • On the complexity of dataflow analysis of logic programs

        1995

      • Special section: Ten Years of Logic Programming

        1995

      • Call forwarding: a simple interprocedural optimization technique for dynamically typed languages

        1994

      • Abstract interpretation of logic programs using magic transformations

        1994

      • Guest editors' introduction

        1994

      • Compositional analysis of modular logic programs

        1993

      • QD-Janus: A sequential implementation of Janus in Prolog

        1993

      • Reasoning about naming systems

        1993

      • Cost analysis of logic programs

        1993

      • Efficient dataflow analysis of logic programs

        1992

      • Guest editor's introduction

        1992

      • A simple code improvement scheme for prolog

        1992

      • Global flow analysis as a practical compilation tool

        1992

      • Automatic complexity analysis of logic programs

        1991

      • Towards banishing the cut from Prolog

        1990

      • Task granularity analysis in logic programs

        1990

      • Flow analysis of dynamic logic programs

        1989

      • Functional computations in logic programs

        1989

      • Static inference of modes and data dependencies in logic programs

        1989

      • PROFILING PROLOG PROGRAMS.

        1988

      • Denotational and operational semantics for prolog

        1988

      • Automatic mode inference for logic programs

        1988

      • FLOW ANALYSIS OF A SIMPLE CLASS OF DYNAMIC LOGIC PROGRAMS.

        1987

      • REGISTER ALLOCATION IN A PROLOG MACHINE.

        1986

      • AUTOMATIC MODE INFERENCE FOR PROLOG PROGRAMS.

        1986

      • TOWARDS BANISHING THE CUT FROM PROLOG.

        1986

      • TESTING PROTOCOL ROBUSTNESS THE CCS WAY.

        1985

      • EXECUTING DISTRIBUTED PROLOG PROGRAMS ON A BROADCAST NETWORK.

        1984

      Grants
      Citations
      H-Index
      Patents
      News
      Books
      Opportunities