Search International and National Patent Collections
Some content of this application is unavailable at the moment.
If this situation persists, please contact us atFeedback&Contact
1. (WO2017112292) TECHNOLOGIES FOR NATIVE CODE INVOCATION USING BINARY ANALYSIS
Latest bibliographic data on file with the International Bureau

Pub. No.: WO/2017/112292 International Application No.: PCT/US2016/063572
Publication Date: 29.06.2017 International Filing Date: 23.11.2016
IPC:
G06F 9/30 (2006.01)
G PHYSICS
06
COMPUTING; CALCULATING; COUNTING
F
ELECTRIC DIGITAL DATA PROCESSING
9
Arrangements for programme control, e.g. control unit
06
using stored programme, i.e. using internal store of processing equipment to receive and retain programme
30
Arrangements for executing machine- instructions, e.g. instruction decode
Applicants:
INTEL CORPORATION [US/US]; 2200 Mission College Boulevard Santa Clara, California 95054, US
Inventors:
KANHERE, Abhay S.; US
FENG, Haitao; CN
HOHENSEE, Paul H.; US
SUBRAMANIAN, Aravind; US
Agent:
KELLETT, Glen M.; US
Priority Data:
14/998,27426.12.2015US
Title (EN) TECHNOLOGIES FOR NATIVE CODE INVOCATION USING BINARY ANALYSIS
(FR) TECHNOLOGIES D'APPEL DE CODE NATIF À L'AIDE D'UNE ANALYSE BINAIRE
Abstract:
(EN) Technologies for native code invocation using binary analysis are described. A computing device for invoking native code from managed code using binary analysis receives a call from a thread executing a managed code segment to execute a native code segment. The computing device performs a binary analysis of the native code segment and generates, from the binary analysis, a complexity indicator that indicates a level of complexity of the native code segment by comparing the native code segment to at least one predefined complexity rule. Additionally, the computing device stores a status of the thread based on the complexity indicator and executes the native code segment. Other embodiments are described and claimed.
(FR) La présente invention concerne des technologies permettant un appel de code natif à l'aide d'une analyse binaire. Un dispositif informatique pour appeler un code natif à partir d'un code géré à l'aide d'une analyse binaire reçoit un appel d'un fil exécutant un segment de code géré pour exécuter un segment de code natif. Le dispositif informatique réalise une analyse binaire du segment de code natif et génère, à partir de l'analyse binaire, un indicateur de complexité qui indique un niveau de complexité du segment de code natif par comparaison du segment de code natif à au moins une règle de complexité prédéfinie. En outre, le dispositif informatique stocke un état du fil sur la base de l'indicateur de complexité et exécute le segment de code natif. D'autres modes de réalisation sont décrits et revendiqués.
front page image
Designated States: AE, AG, AL, AM, AO, AT, AU, AZ, BA, BB, BG, BH, BN, BR, BW, BY, BZ, CA, CH, CL, CN, CO, CR, CU, CZ, DE, DJ, DK, DM, DO, DZ, EC, EE, EG, ES, FI, GB, GD, GE, GH, GM, GT, HN, HR, HU, ID, IL, IN, IR, IS, JP, KE, KG, KN, KP, KR, KW, KZ, LA, LC, LK, LR, LS, LU, LY, MA, MD, ME, MG, MK, MN, MW, MX, MY, MZ, NA, NG, NI, NO, NZ, OM, PA, PE, PG, PH, PL, PT, QA, RO, RS, RU, RW, SA, SC, SD, SE, SG, SK, SL, SM, ST, SV, SY, TH, TJ, TM, TN, TR, TT, TZ, UA, UG, US, UZ, VC, VN, ZA, ZM, ZW
African Regional Intellectual Property Organization (ARIPO) (BW, GH, GM, KE, LR, LS, MW, MZ, NA, RW, SD, SL, ST, SZ, TZ, UG, ZM, ZW)
Eurasian Patent Organization (AM, AZ, BY, KG, KZ, RU, TJ, TM)
European Patent Office (AL, AT, BE, BG, CH, CY, CZ, DE, DK, EE, ES, FI, FR, GB, GR, HR, HU, IE, IS, IT, LT, LU, LV, MC, MK, MT, NL, NO, PL, PT, RO, RS, SE, SI, SK, SM, TR)
African Intellectual Property Organization (BF, BJ, CF, CG, CI, CM, GA, GN, GQ, GW, KM, ML, MR, NE, SN, TD, TG)
Publication Language: English (EN)
Filing Language: English (EN)
Also published as:
JP2017117451DE112016006060