×

Code generation by matching and satisfiability search

  • US 7,036,115 B2
  • Filed: 11/20/2001
  • Issued: 04/25/2006
  • Est. Priority Date: 01/08/2001
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method for producing, for a target computer architecture and a program fragment, a near-optimal code sequence for executing the program fragment on the target computer, comprising:

  • repeatedly invoking an automatic theorem prover for plural cycle budgets todetermine a minimum cycle budget that is the lowest of any cycle budget K for which a formalized mathematical conjecture that no code sequence for the target computer architecture executes the program fragment within the cycle budget K is unprovable by the automatic theorem prover, andextract the near optimal code sequence from a counterexample implicit in the failed proof of the formalized mathematical conjecture for the minimum cycle budget.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×