Branch resolution via backward symbolic execution

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395375, 395500, 364DIG1, G06F 945

Patent

active

054287863

ABSTRACT:
Possible values for a computed destination address of an execution transfer instruction are found by a backward search through a flowgraph of a program. During the search, a symbolic expression for the destination address is successively modified to reflect the effect of each prior instruction until the symbolic expression represents an absolute or program-counter relative address, or until the search can no longer continue. The search can no longer continue, for example, when an instruction is reached that affects the value of the expression in an indefinite way. When backward symbolic execution reaches the entry point of a block in the flowgraph, backward symbolic execution proceeds backward to each predecessor block that has not already been examined for the execution transfer instruction. Therefore multiple definite values as well as a value of "unknown" may be found for a computed destination address. Preferably backward symbolic execution is performed while constructing the flowgraph, in order to find the locations of additional instructions. As additional instructions are found, new blocks and new paths between blocks are added to the flowgraph. Backward symbolic execution is repeated when the new paths may provide additional values for the computed destination addresses.

REFERENCES:
patent: 4951195 (1990-08-01), Fogg, Jr. et al.
patent: 5005119 (1991-04-01), Rumbaugh et al.
Morgan et al., 8086/8088: 16-Bit Microprocessor Primer, BYTE/McGraw-Hill, 1982, pp. 130-138.
Banning, "The XDOS Binary Code Conversion System," COMPCON 89 (Sep. 27, 1989) San Francisco, Calif., pp. 282-287.
Hunter and Banning, "DOS at RISC," Byte, vol. 14, No. 12, (Nov. 1989), St. Peterborough, United States, pp. 361-368.
Gaines, "On the Translation of Machine Language Programs," Communications of the Association for Computing Machinery, vol. 8, No. 12, (Dec. 1965), New York, N.Y., pp. 736-741.
Bergh et al., "HP 3000 Emulation on HP Precision Architecture Computers," Hewlett-Packard Journal, Dec. 1987, pp. 87-89.
Beyond RISC!-An Essential Guide To Hewlett-Packard Precision Architecture, Wayne E. Holt, Ed., 1988, pp. 225-238.
Eve M. Tanner, "Providing Programmers with a Driver Debug Technique," Hewlett-Packard Journal, Oct. 1989, pp. 76-80.
Program Flow Analysis: Theory and Applications, Muchnick & Jones, eds., Prentice-Hall, Englewood Cliffs, N.J., 1981, pp. 160-161, 178-179, 184-187, 264-265, 272-275, 280-283, 294-297.
The Handbook of Artificial Intelligence, vol. II, Barr & Feigenbaum, eds., William Kaufmann, Los Altos, Calif., 1982, pp. 297-379.
S. Reiss, "PECAN: Program Development System That Supports Multiple Views," IEEE Transactions on Software Engineering, SE-11, No. 3., Mar. 1985, New York, N.Y., pp. 276-285.
Michael Saari, "68000 Binary Code Translator," 1987 FORML Conference Proceedings, 1987, pp. 48-52.
Max Schindler, "Translator Optimizes Transfer of 8-bit Programs to 16-bit Programs," Electronic Design, Jul. 23, 1991, pp. 35-36.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Branch resolution via backward symbolic execution does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Branch resolution via backward symbolic execution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Branch resolution via backward symbolic execution will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-295399

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.