Combining Conditional Constant Propagation and Interprocedural Alias Analysis

Author(s):  
K. Gopinath ◽  
K. S. Nandakumar
2014 ◽  
Vol 49 (10) ◽  
pp. 829-845 ◽  
Author(s):  
Qirun Zhang ◽  
Xiao Xiao ◽  
Charles Zhang ◽  
Hao Yuan ◽  
Zhendong Su
Keyword(s):  

In order to extend the use of group theoretical arguments to the problem of accidental degeneracy in quantum mechanics, a new type of constant of the motion, known as a conditional constant of the motion, is introduced. Such a quantity, instead of commuting with the Hamiltonian H for the system, satisfies the more general relation H A = A † H , where A † denotes the hermitian conjugate (adjoint) of the conditional constant of the motion A . This expression reduces, if A is hermitian, to the usual definition of a constant of the motion. Otherwise it defines a new type of invariance, and it is this which will be referred to as conditional invariance. A discussion of the difficulties arising from the lack of hermiticity of A , which is of course essential to its definition, is given. In particular it is shown, under fairly general conditions, that the process of introducing a variable parameter in the Hamiltonian enabling it to have simultaneous eigenfunctions with A , gives rise to an eigenvalue equation in this parameter with respect to which A may be chosen to be hermitian. Conditional invariance is contrasted with both dynamical and geometric invariance. It is found to be sometimes replaceable by either of the latter forms of invariance and for such, explicit conditions are given. Some applications of conditional invariance are discussed. These include a study of the crossing of potential energy curves, a new model of symmetry breaking, a possible means of calculating the exact number of bound states for certain potentials and conditions for the existence of bound states near to the continuum.


2014 ◽  
Vol 577 ◽  
pp. 917-920
Author(s):  
Long Pang ◽  
Xiao Hong Su ◽  
Pei Jun Ma ◽  
Ling Ling Zhao

The pointer alias is indispensable for program analysis. Comparing to point-to set, it’s more efficient to formulate the alias as the context free language (CFL) reachability problem. However, the precision is limited to flow-insensitivity. To solve this problem, we propose a flow sensitive, demand-driven analysis algorithm for answering may-alias queries. First the partial single static assignment is used to discriminate the address-taken pointers. Then the order of control flow is encoded in the level linearization code to ease comparison. Finally, the query of alias in demand driven is converted into the search of CFL reachability with feasible flows. The experiments demonstrate the effectiveness of the proposed approach.


1993 ◽  
Vol 28 (6) ◽  
pp. 90-99 ◽  
Author(s):  
Dan Grove ◽  
Linda Torczon
Keyword(s):  

Author(s):  
Péricles Rafael Oliveira Alves ◽  
Igor Rafael de Assis Costa ◽  
Fernando Magno Quintão Pereira ◽  
Eduardo Lage Figueiredo
Keyword(s):  

1993 ◽  
Vol 23 (11) ◽  
pp. 1201-1233 ◽  
Author(s):  
Herbert G. Mayer ◽  
Michael Wolfe

2004 ◽  
Vol 35 (4) ◽  
pp. 49-59 ◽  
Author(s):  
Fumiaki Ohata ◽  
Kazuhiro Kondou ◽  
Katsuro Inoue

Sign in / Sign up

Export Citation Format

Share Document