Code generation by matching and satisfiability search

Data processing: software development – installation – and managem – Software program development tool – Translation of code

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C706S047000

Reexamination Certificate

active

07036115

ABSTRACT:
A tool and method for automatically producing near-optimal code sequences are particularly useful for generating near-optimal code sequences in inner loops, crucial subroutines, and device drivers. As a novel functional and architectural strategy, the invention contemplates applying technologies that would be normally in automatic theorem proving to the problem of automatic code generation. The aspect of the automatic theorem proving is realized by matching followed by planning with satisfiability search. Notably also, the present invention targets a goal-oriented, cycle budget limited code sequence in producing the near-optimal code sequence.

REFERENCES:
patent: 4914590 (1990-04-01), Loatman et al.
patent: 5142590 (1992-08-01), Carpenter et al.
patent: 5481717 (1996-01-01), Gaboury
patent: 5511146 (1996-04-01), Simar, Jr.
patent: 5515477 (1996-05-01), Sutherland
patent: 6289502 (2001-09-01), Garland et al.
“GNU Superoptimizer”Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation(PLDI), (1992).
Harry, Andrew “Formal Methods Fact File VDM and Z”, Chapter 7, pp. 1-7, 281-291, 305-322, Sep. 1996, ISBN 047190062.
Arbib, Michael A. “The Handbook of Brain Theory and Neural Networks”, pp. 17-25, 79-85, 711-715, First MIT Press, 1995, ISBN 0262011484.
Chromsky, Noam “Three Models for the Description of Language”, pp. 113-124, MIT, Reprint from IRE Trans. Inform. Theory, IT-2, No. 3, 1956.
Cleaveland, R., et al., “A Front End Generator for Verification Tools”, Tools and Algorithms for the Constrauction and Analaysis of Systems, pp. 153-173, TACAS '95 Denmark Conference, May 1995, Springer-Verlag ISBN 354060630.
Nelson, C.G. “Multi-Headed One-Way Automata”, Notices of the American Mathematical Society, v23, n. 4, PA444, Harvard Univ., 1976.
Hehner, E.C.R. “The Logic of Programming”, Series in Computer Science, TOC, pp. 1-133, 134-268, 269-362, Prentice Hall Int'l, 1984, ISBN 0135399661.
Kowalski, Robert “Logic for Problem Solving”, Chapters 1-13, 1979, The Computer Science Library, Library of Congress, ISBN 0444003657.
Nelson, Charles Gregory, “Techniques for Program Verification”, pp. 1-116, Stanford University PhD Thesis, 1980, Univ. Microfilms Int'l.
Nelson, Charles Gregory, “Techniques for Program Verification”, pp. 1-101, XEROX Palo Alto Research Center, 1980, CSL-81-10.
Joshi, Rajeev, et al., “Denali: A Goal-Directed Superoptimizer”, pp. 1-16, Compaq SRC Report, Jul. 30, 2001, http://www.research.compaq.com/SRC/.
Massalin, Henry “Superoptimizer—A Look at the Smallest Program”, pp. 122-126, Proceedings of the 2nd International Conference on Architectural Support for Programming Languages and Operating Systems, SIGARCH Computer Architecture News 15(5), SIGOPS Operating System Review 21(4), SIGPLAN Notices 22(10), Oct. 5-8, 1987, Palo Alto, CA, ACM Press, IEEE-CS, ISBN 0-89791-1.
Detlefs, David “An Overview of the Extended Static Checking System”, Nov. 1995, http://www.src.dec.com/SRC/personal/David—Detlefs/home.html.
Manasse, M.S. et al., “Trestle Tutorial”, pp. 1-70, Digital System Research Center, Report Paper 69, May 1992.

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

Code generation by matching and satisfiability search does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Code generation by matching and satisfiability search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Code generation by matching and satisfiability search will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3535516

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