Dependent Types for Program Understanding

  • Raghavan Komondoor
  • G. Ramalingam
  • Satish Chandra
  • John Field
Conference paper

DOI: 10.1007/978-3-540-31980-1_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3440)
Cite this paper as:
Komondoor R., Ramalingam G., Chandra S., Field J. (2005) Dependent Types for Program Understanding. In: Halbwachs N., Zuck L.D. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2005. Lecture Notes in Computer Science, vol 3440. Springer, Berlin, Heidelberg

Abstract

Weakly-typed languages such as Cobol often force programmers to represent distinct data abstractions using the same low-level physical type. In this paper, we describe a technique to recover implicitly-defined data abstractions from programs using type inference. We present a novel system of dependent types which we call guarded types, a path-sensitive algorithm for inferring guarded types for Cobol programs, and a semantic characterization of correct guarded typings. The results of our inference technique can be used to enhance program understanding for legacy applications, and to enable a number of type-based program transformations.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Raghavan Komondoor
    • 1
  • G. Ramalingam
    • 1
  • Satish Chandra
    • 1
  • John Field
    • 1
  1. 1.IBM Research 

Personalised recommendations