This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Property extraction in well-founded property sets
Sept. 1975 (vol. 1 no. 3)
pp. 270-285
Ben Wegbreit, Xerox Palo Alto Research Center, Palo Alto, Calif. 94304
To carry out significant program optinization, it is necessary to know what properties hold at each program unit. Frequently the properties of interest form a partially ordered set with a minimum condition (i.e., well-founded). When this occurs, it is possible to directly compute the properties that can be attached to program units and, optionally, to expand the program text to obtain a strong assignment of properties. Techniques are presented for property computation in iterative and recursive programs. Application to a variety of property sets is discussed.
Index Terms:
Optimization,Junctions,Software engineering,Vectors,Indexes,Flowcharts,Periodic structures,well-founded set,Expanding program text,iterative program,program optimization,property set,recursive program,symbolic execution,synthesis of loop predicates,weak interpretation
Citation:
Ben Wegbreit, "Property extraction in well-founded property sets," IEEE Transactions on Software Engineering, vol. 1, no. 3, pp. 270-285, Sept. 1975, doi:10.1109/TSE.1975.6312852
Usage of this product signifies your acceptance of the Terms of Use.