FR3131032B1 - Method for generating an executable file containing system calls and associated library. - Google Patents

Method for generating an executable file containing system calls and associated library. Download PDF

Info

Publication number
FR3131032B1
FR3131032B1 FR2114094A FR2114094A FR3131032B1 FR 3131032 B1 FR3131032 B1 FR 3131032B1 FR 2114094 A FR2114094 A FR 2114094A FR 2114094 A FR2114094 A FR 2114094A FR 3131032 B1 FR3131032 B1 FR 3131032B1
Authority
FR
France
Prior art keywords
function
generating
internal
library
model
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
FR2114094A
Other languages
French (fr)
Other versions
FR3131032A1 (en
Inventor
Thibaud Tortech
Hmid Moha Ait
Cyril Faure
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Commissariat a lEnergie Atomique et aux Energies Alternatives CEA
Original Assignee
Commissariat a lEnergie Atomique CEA
Commissariat a lEnergie Atomique et aux Energies Alternatives CEA
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Commissariat a lEnergie Atomique CEA, Commissariat a lEnergie Atomique et aux Energies Alternatives CEA filed Critical Commissariat a lEnergie Atomique CEA
Priority to FR2114094A priority Critical patent/FR3131032B1/en
Publication of FR3131032A1 publication Critical patent/FR3131032A1/en
Application granted granted Critical
Publication of FR3131032B1 publication Critical patent/FR3131032B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformation of program code
    • G06F8/41—Compilation
    • G06F8/43—Checking; Contextual analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/36—Preventing errors by testing or debugging software
    • G06F11/3604—Software analysis for verifying properties of programs

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Quality & Reliability (AREA)
  • Devices For Executing Special Programs (AREA)
  • Stored Programmes (AREA)

Abstract

Procédé de génération d’un fichier exécutable contenant des appels systèmes et librairie associée. Procédé de génération d’un fichier, exécutable en mode utilisateur et appelant une fonction système définit dans un fichier appelé, exécutable en mode noyau, consistant à : fournir (210) une librairie comportant un méta-modèle des appels systèmes, et un modèle instanciant le méta-modèle pour une fonction système particulière et implémentant une fonction « interne » associée ; éditer (220) un fichier source pour comporter un appel à la fonction « interne », l’exécution de la fonction « interne » appelant la fonction système et à renvoyer le résultat de l’exécution de la fonction système par le code appelé ; compiler (230) le fichier source avec la librairie, le compilateur vérifiant que l’appel de la fonction « interne » est conforme, la conformité à l’appel de la fonction système étant garantie par le modèle. Figure pour l'abrégé : Figure 2Method for generating an executable file containing system calls and associated library. Method for generating a file, executable in user mode and calling a system function defined in a called file, executable in kernel mode, consisting of: providing (210) a library comprising a meta-model of system calls, and an instantiating model the meta-model for a particular system function and implementing an associated “internal” function; editing (220) a source file to include a call to the "internal" function, executing the "internal" function calling the system function and returning the result of the execution of the system function by the called code; compile (230) the source file with the library, the compiler checking that the call of the “internal” function is compliant, conformity to the call of the system function being guaranteed by the model. Figure for abstract: Figure 2

FR2114094A 2021-12-21 2021-12-21 Method for generating an executable file containing system calls and associated library. Active FR3131032B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
FR2114094A FR3131032B1 (en) 2021-12-21 2021-12-21 Method for generating an executable file containing system calls and associated library.

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR2114094 2021-12-21
FR2114094A FR3131032B1 (en) 2021-12-21 2021-12-21 Method for generating an executable file containing system calls and associated library.

Publications (2)

Publication Number Publication Date
FR3131032A1 FR3131032A1 (en) 2023-06-23
FR3131032B1 true FR3131032B1 (en) 2023-12-22

Family

ID=81581147

Family Applications (1)

Application Number Title Priority Date Filing Date
FR2114094A Active FR3131032B1 (en) 2021-12-21 2021-12-21 Method for generating an executable file containing system calls and associated library.

Country Status (1)

Country Link
FR (1) FR3131032B1 (en)

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7694276B2 (en) * 2003-02-28 2010-04-06 Microsoft Corporation Contracts and futures in an asynchronous programming language

Also Published As

Publication number Publication date
FR3131032A1 (en) 2023-06-23

Similar Documents

Publication Publication Date Title
Bezanson et al. Julia: Dynamism and performance reconciled by design
Würthinger et al. One VM to rule them all
Lattner et al. Making context-sensitive points-to analysis with heap cloning practical for the real world
ES2674140T3 (en) Creation of inferred symbols from the use of code
US9454350B2 (en) Extracting stream graph structure in a computer language by pre-executing a deterministic subset
Rigger et al. Bringing low-level languages to the JVM: Efficient execution of LLVM IR on Truffle
CA2306517A1 (en) Method and apparatus for debugging optimized code
Grech et al. Heaps don't lie: countering unsoundness with heap snapshots
JP2011508317A5 (en)
Richards et al. The VM already knew that: Leveraging compile-time knowledge to optimize gradual typing
EP2564316B1 (en) Resumable methods
JP2014501412A5 (en)
Prokopec et al. Making collection operations optimal with aggressive JIT compilation
Chang et al. The impact of optional type information on JIT compilation of dynamically typed languages
Toro et al. Customizable gradual polymorphic effects for Scala
Leopoldseder et al. Java-to-JavaScript translation via structured control flow reconstruction of compiler IR
Gaikwad et al. Performance analysis for languages hosted on the truffle framework
FR3131032B1 (en) Method for generating an executable file containing system calls and associated library.
Rainey et al. Task parallel assembly language for uncompromising parallelism
Luckow et al. HVMTP: a time predictable and portable java virtual machine for hard real-time embedded systems
Hölzle et al. Dynamic versus Static Optimization Techniques for Object‐Oriented Languages
Alsubhi et al. A Tool for Translating sequential source code to parallel code written in C++ and OpenACC
Sarimbekov et al. Portable and accurate collection of calling-context-sensitive bytecode metrics for the Java virtual machine
Leopoldseder et al. A Cost Model for a Graph-based Intermediate-representation in a Dynamic Compiler
Arnold et al. Adaptive optimization in the Jalapeno JVM

Legal Events

Date Code Title Description
PLFP Fee payment

Year of fee payment: 2

PLSC Publication of the preliminary search report

Effective date: 20230623

PLFP Fee payment

Year of fee payment: 3