Now showing items 1-4 of 4

    • Efficient Computation of Interprocedural Control Dependence 

      Ezick, James; Bilardi, Gianfranco; Pingali, Keshav (Cornell University, 2001-09-06)
      Control dependence information is useful for a wide range of software maintenance and testing tasks. For example, program slicers use it to determine statements and predicates that might affect the value of a particular ...
    • Man vs. Machine : Comparing Handwritten and Compiler-generated Application-Level Checkpointing 

      Ezick, James; Marques, Daniel; Pingali, Keshav; Stodghill, Paul (Cornell University, 2004-10-12)
      The contributions of this paper are the following. We describe the implementation of the $C^3$ system for semi-automatic application-level checkpointing of C programs. The system has (i) a pre-compiler that instruments C ...
    • An Optimizing Compiler for Batches of Temporal Logic Formulas 

      Ezick, James (Cornell University, 2003-09-05)
      Model checking based on validating temporal logic formulas has proven practical and effective for numerous applications from verifying hardware designs to proving the correctness of software. As systems based on this ...
    • Resolving Constrained Existential Queries over Context-Sensitive Analyses 

      Ezick, James (Cornell University, 2003-10-21)
      A context-sensitive analysis is an analysis in which program elements are interpreted with respect to the context in which they occur. For analyses on imperative languages, this often refers to considering the behavior ...