Complexity of Advanced Programming Language Implementations
In this project,
dynamic data-structures that arise in implementation
of high-level programming languages are being studied.
To date several upper and lower bounds have been
derived for operations on dynamic data-structures
that arise in implementation of
logic programming languages and object-oriented
languages. The complexity results have been used to
make implementation choices in parallel implementations
of logic and constraint languages.
Other Participants: D. Ranjan, E. Pontelli,
L. Longpre (UTEP).
Papers
-
G. Gupta and B. Jayaraman
"Analysis of Or-parallel Execution Models,"
ACM Transactions On Programming Languages
and Systems (ACM TOPLAS), Vol 15, No. 4, September 1993,
pp. 659-680.
-
D. Ranjan, E. Pontelli, and G. Gupta. "On the Complexity
of Or-parallelism," In New Generation
Computing: An International Journal
Vol. 17, No. 3, May 1999.
-
E. Pontelli, D. Ranjan, G. Gupta.
"Complexity of Late-binding in Dynamic Object-Oriented Languages,"
In Journal of Functional and Logic Programming,
MIT Press, Special Issue #2, Nov. 1999.
-
E. Pontelli, D. Ranjan, G. Gupta.
Late-binding
in Dynamic Object-Oriented Languages.
In Proc. Programming Languages,
Implementation, Logics, and Programs.
Springer Verlag, Lecture Notes
in Computer Science 1490. pp. 195-212.
-
D. Ranjan, E. Pontelli, G. Gupta, "On the Complexity of
Parallel Implementation of Logic Programs,"
In Foundations of Software Technology and
Theoretical Computer Science, Kharagpur, India,
Proceedings in Springer LNCS. 1997.
-
D. Ranjan, E. Pontelli, G. Gupta.
Efficient Algorithms for the Temporal
Precedence Problems. Information Processing Letters.
68(2):71-78, 1998.
-
D. Ranjan, E. Pontelli, L. Longpre, and G. Gupta.
The Temporal Precedence Problem.
In Algorithmica, (to appear).
-
E. Pontelli, G. Gupta, "Implementation Mechanisms for Dependent
And-parallelism." In Proc. International Conference on Logic
Programming, MIT Press,
July 1997. pp. 123-137.