Elaborating on the alias calculus
نویسنده
چکیده
In this research-in-progress report, we elaborate on the alias calculus introduced in [1], [2]. The alias calculus is to determine whether two reference expressions at the given program point may address the same object at the run-time (in other words, whether one expression may be an alias of the other expression). The main intended application of the alias calculus is to support deductive verification of object-oriented programs. We show how aliases may be used in Hoare-style reasoning, hence derive at what program points we are to compute aliases and propose an algorithm that computes the required aliases. We also state future work directions.
منابع مشابه
Periodic Oscillations in the Analysis of Algorithms and Their Cancellations
A large number of results in analysis of algorithms contain fluctuations. A typical result might read “The expected number of . . . for large n behaves like log2 n + constant + delta(log2 n), where delta(x) is a periodic function of period one and mean zero.” Examples include various trie parameters, approximate counting, probabilistic counting, radix exchange sort, leader election, skip lists,...
متن کاملElaborating Domain Descriptions
In this work we address the problem of elaborating domain descriptions (alias action theories), in particular those that are expressed in dynamic logic. We define a general method based on contraction of formulas in a version of propositional dynamic logic with an incorporated solution to the frame problem. We present the semantics of our theory change and define syntactical operators for contr...
متن کاملAlias and Change Calculi, Applied to Frame Inference
Alias analysis, which determines whether two expressions in a program may reference to the same object, has many potential applications in program construction and verification. We have developed a theory for alias analysis, the “alias calculus”, implemented its application to an object-oriented language, and integrated the result into a modern IDE. The calculus has a higher level of precision ...
متن کاملExpression-Based Aliasing for OO-languages
Alias analysis has been an interesting research topic in verification and optimization of programs. The undecidability of determining whether two expressions in a program may reference to the same object is the main source of the challenges raised in alias analysis. In this paper we propose an extension of a previously introduced alias calculus based on program expressions, to the setting of un...
متن کاملAlias Types and Effects for "Environment-aware" Computations
We adapt the alias type technology to deal with primitives supporting environmentawareness (that is, the ability to adapt the behavior of according to the capabilities of the environment). In particular, we propose a type and effect system for an imperative object-based calculus with a primitive for discriminating the presence or absence of object’s attributes. Both the shape of environments wh...
متن کامل