Invention Grant
- Patent Title: Converting a computational formula into executable code
- Patent Title (中): 将计算公式转换为可执行代码
-
Application No.: US13059275Application Date: 2009-10-07
-
Publication No.: US08498877B2Publication Date: 2013-07-30
- Inventor: Pascal Bar , Mehdi Jouan , Sébastien Savalle
- Applicant: Pascal Bar , Mehdi Jouan , Sébastien Savalle
- Applicant Address: DE Walldorf
- Assignee: SAP AG
- Current Assignee: SAP AG
- Current Assignee Address: DE Walldorf
- Agency: Kenyon & Kenyon LLP
- Priority: FR0856963 20081014
- International Application: PCT/EP2009/063033 WO 20091007
- International Announcement: WO2010/043526 WO 20100422
- Main IPC: G06Q10/00
- IPC: G06Q10/00 ; G07B15/02

Abstract:
This method of converting a computational formula having been acquired in the form of a tree structure containing at least one node associated with a parameterized conditional branching operation and connected to at least a first and a second child node, the child node which is associated with the operation which is not executed and the set of nodes which have this child node as parent node being called ‘dead branch’, this method comprising: —the identification and the deletion (198) of the dead branch corresponding to the acquired value of a conditional parameter so as to obtain a computational formula pruned of this dead branch, and—the compilation (208) of the computational formula pruned of the dead branch so as to obtain the code executable by a chip card.
Public/Granted literature
- US20110145171A1 CONVERTING A COMPUTATIONAL FORMULA INTO EXECUTABLE CODE Public/Granted day:2011-06-16
Information query