Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Abstract. This paper introduces the concepts of wide classes and widening as extensions to the object model of class-based languages such as Java and Smalltalk. Widening allows an ...
A common theoretical assumption in the study of information flow security in Java-like languages is that pointers are opaque – i.e., that the only properties that can be observ...
Abstract. We define a basic calculus for name management, which is obtained by an appropriate combination of three ingredients: extensible records (in a simplified form), names (...
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe...