Data compaction method for an intermediate object code program executable in an onboard system provided with data processing resources and corresponding onboard system with multiple applications

Patent 6952820 Issued on October 4, 2005. Estimated Expiration Date:

November 4, 2019. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Abstract Claims Description Full Text

Patent References

Optimizing compiler for computers
Patent #: 5442790
Issued on: 08/15/1995
Inventor: Nosenchuck

Compiler back end calling predetermined front end routines that use effect and dependency indicators to provide information to the compiler to determine the validity of an optimization
Patent #: 5493675
Issued on: 02/20/1996
Inventor: Faiman, Jr., et al.

Method of constructing a constant-folding mechanism in a multilanguage optimizing compiler
Patent #: 5836014
Issued on: 11/10/1998
Inventor: Faiman, Jr.

Unified compiler framework for control and data speculation with recovery code
Patent #: 6260190
Issued on: 07/10/2001
Inventor: Ju

Dynamic microcode for embedded processors
Patent #: 6263429
Issued on: 07/17/2001
Inventor: Siska

Using a high level programming language with a microcontroller Patent #: 6308317
Issued on: 10/23/2001
Inventor: Wilkinson, et al.

Inventors

Assignee

Application

No. 09582939 filed on 11/04/1999

US Classes:

717/151, Optimization717/152, Static (source or intermediate level)717/159, Code restructuring717/147, Platform-independent form (e.g., abstract code)717/146, Including intermediate code712/245, Processing sequence control (i.e., microsequencing)717/156, Using flow graph717/139Interpreter

Examiners

Primary: Ingberg, Todd
Assistant: Nahar, Qamrun

Attorney, Agent or Firm

DLA Piper Rudnick Gray Cary US LLP

Foreign Patent References

733631 AU 07/01/1998

International Classes

G06F009/45
G06F007/38

Abstract

The invention concerns a data compaction method and system for an intermediate program. The method consists in searching the program (1000) for identical sequences (Si) and counting Ni number of occurrences of each sequence (Si), a comparison test (1001) to find the superiority of a function f(Ni) to a reference value enables to generate (1003) a specific instruction of a specific code (Ci) with which the sequence (Si) is associated, replacing (1004) each occurrence in the sequence (Si) by the specific code (Ci) in the intermediate program to create a compacted intermediate program (FCC) with which an executing file (FEX) is associated. The invention is applicable to multiple application portable objects such as microprocessor cards, onboard systems of the like.

Other References

F. Vahid, “A Three-Step Approach to the Functional Partitioning of Large Behavioral Processes”, 1998, IEEE, p. 152-157.
Tanenbaum, et al., “Using Peephole Optimization on Intermediate Code”, 1982, ACM, p. 21-36.
Debaere, E. H., “A Language Coprocessor for the Interpretation of Threaded Code” Microprocessing and Microprogramming, vol. 21, (1987), pp. 593-602.
Accomazzo, E. et al., “Integrating Intermediate Code Optimization with Retargetable Code Generation” Microprocessing and Microprogramming, vol. 30, (1990), pp. 475-482.
Biget, P. et al., “How Smart Cards Can Benefit from Object-oriented Technologies” Future Generations Computer Systems, vol. 13, (1997), pp. 75-90.
Vahid, Frank, “Procedure Exlining: a New System-Level Specification Transformation” IEEE, 1995, pp. 508-513.