EP1609061A2 - Procede et dispositif pour modifier un logiciel ou un code source - Google Patents

Procede et dispositif pour modifier un logiciel ou un code source

Info

Publication number
EP1609061A2
EP1609061A2 EP04739074A EP04739074A EP1609061A2 EP 1609061 A2 EP1609061 A2 EP 1609061A2 EP 04739074 A EP04739074 A EP 04739074A EP 04739074 A EP04739074 A EP 04739074A EP 1609061 A2 EP1609061 A2 EP 1609061A2
Authority
EP
European Patent Office
Prior art keywords
code
formulated
language
codeml
transformation
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.)
Withdrawn
Application number
EP04739074A
Other languages
German (de)
English (en)
Inventor
Roy Oberhauser
Christian Reichel
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.)
Siemens AG
Original Assignee
Siemens AG
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
Priority claimed from DE10314834A external-priority patent/DE10314834A1/de
Priority claimed from DE10314831A external-priority patent/DE10314831A1/de
Priority claimed from DE10314832A external-priority patent/DE10314832B3/de
Priority claimed from DE10314835A external-priority patent/DE10314835A1/de
Application filed by Siemens AG filed Critical Siemens AG
Publication of EP1609061A2 publication Critical patent/EP1609061A2/fr
Withdrawn legal-status Critical Current

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/51—Source to source

Definitions

  • the invention relates to a method and an arrangement for changing software or source code, in which software or source code is converted into a representation in a meta markup language, for example XML, transformed there, for example with XSLT, and then transformed transformed representation formulated in the meta markup language is converted back into modified software or into modified source code, for example the same source language.
  • a meta markup language for example XML
  • XSLT XSLT
  • Parameterization is one way of influencing software. Configuration files are typically used for parameterization and storage of application-specific “parameter data 1 *.
  • the structure and structure of these files is determined during the development phase and can never be changed after the software has been delivered.
  • plugins open up the possibility of “delivered”, compiled software to expand functionality. For this it is necessary that the structures for the integration and use of plugins are created or defined during the development phase (interfaces, ).
  • Code generators generate source or binary code with the help of templates / templates that are provided at predetermined locations, e.g. B. by means of passed parameters. In this way it becomes possible that e.g. B. different software is generated for different customers, which differs in precisely defined places. However, only special digits (and not any digits) can be changed in the code, which must be precisely specified when the template is created. Code generators are typically used by developers.
  • a Java source code transformation tool BeautyJ is known from the Internet at http: // beautyj .berlios.de /, in which a Java source code is converted into an XML representation, using the Sourclet API, for example by inserting spaces or changed comments certain places, "embellished and then the modified source code can be converted back to Java source code.
  • the invention essentially consists in that in a first variant, selected components of a software serve as points of variation by converting them into a first code formulated in a meta markup language, e.g. XLML, the software is now delivered in mixed form, and the first code is supplied by the customer by one or several transformations, e.g.
  • XSLT can only be converted depending on the transformation rules into a second code formulated in the meta markup language, that in a second variant a first code formulated in a meta markup language that contains at least one language extension depending on the transformation rules in a more easily verifiable second code formulated in the meta markup language is transferred without these language extensions, that in a third variant a source code transformed into a meta markup language is transformed in such a way that, after a conversion back into the original Pro programming language, a new source code is created, in which not only the representation, but also the actual program content or functionality has been changed, or that in a fourth variant, a source code transformed into a meta-markup language with, for example, initial states, code fragments to be exchanged and up the respective natural language of the user-tailored foreign language modules is mixed by transformation, whereby, after a conversion, a new source code is created in which not only the representation but also the actual one
  • FIG. 1 shows an overall block diagram to explain a first variant of the invention
  • FIG. 2 shows an overall block diagram to explain a second variant of the invention
  • FIG. 3 shows a block diagram to explain the transfer of pre-processing extensions according to the invention
  • FIG. 4 shows an overall block diagram to explain a third variant of the invention
  • FIG. 5 shows a block diagram to explain the modification according to the invention through the use of aspects
  • FIG. 6 shows a block diagram to explain the insertion of migrability functionality according to the invention
  • FIG. 7 shows a block diagram to explain the modification according to the invention through the use of templates, filters and patterns,
  • FIG. 8 overall block diagram to explain a fourth variant of the invention
  • FIG. 9 shows a block diagram to explain the exchange of code fragments according to the invention.
  • FIG. 10 shows a block diagram to explain the insertion of status data according to the invention
  • FIG. 11 is a block diagram to explain the
  • FIG. 12 shows a block diagram to explain the installation of foreign language modules according to the invention for the internationalization of the source code.
  • FIG. 1 shows an overall block diagram to explain the invention, in which software SW consisting of source text SCI, SC2 and SC is first converted into software SW * that can be delivered, with some parts of the software such as SCI now being binary code / byte code B1 are available, and other parts such as SC2 are converted by a converter COV into a first code CodeML formulated in a meta markup language, so that from now on they form variation points VP, for example VP1, in the executable software SW *.
  • software SW consisting of source text SCI, SC2 and SC is first converted into software SW * that can be delivered, with some parts of the software such as SCI now being binary code / byte code B1 are available, and other parts such as SC2 are converted by a converter COV into a first code CodeML formulated in a meta markup language, so that from now on they form variation points VP, for example VP1, in the executable software SW *.
  • This software SW * can be modified before / or at runtime in such a way that the code VP, for example VP2, shown in the meta markup language, with a transformation T and transformation rules TR, into a second code CodeML * formulated in the meta markup language is converted, which is now either available as a modified variation point, for example VP2 * in SW * or is converted by a converter RCONV after the transformation T into a source code SC * and then by means of COMP into a byte code / binary code VP2B *.
  • SW and SW * differ at the points of variation and can thus be adapted to specific requirements (e.g. Tookit exchange, updates, etc.).
  • CodeML and CodeML * or VP and VP * are formulated, for example, in the meta markup language XML, where “XML * stands for Extended Markup Language.
  • a software delivery to two different customers can use different toolkits, which differ in terms of performance, price, etc.
  • Customizing, updating, etc. required and not a number of different, partly proprietary tools.
  • the method is based on standards such as XML and XSLT and is subject to fewer restrictions in terms of convertibility into other programming languages than other methods for modifying source code.
  • This type of modification allows the creation of hierarchies, among other things. through the possibility of orderly, automated sequential execution (pipelines) of several transformations, e.g. patches.
  • the transformations can be saved for general reuse in XSLT files, so that libraries can be created for certain processes, for example.
  • An XML representation of the source code can be stored in an XML database and, if necessary, can be easily adapted to the respective customer needs using an XSLT (customization).
  • the code can be checked (validated) in advance (without compilation) for certain correctness aspects.
  • code reuse can be improved by better finding code or code fragments or templates.
  • FIG. 2 shows an overall block diagram to explain the invention, in which a first code CodeML formulated in a meta markup language, which contains a language extension LE and cannot be converted into valid source text SC * by RCONV, by means of a transformation T as a function of transformation rules TR, which contain a language converter LC, is converted into a second code CodeML * formulated in the meta-markup language, which does not contain these language extensions LE and can therefore be converted into a source code SC *, which in turn can be converted into valid binary code by means of a compiler COMP / ByteCode B * is convertible.
  • the modified source code SC * are, for example, in the Java programming language and the codes CodeML and CodeML * are, for example, in the meta-markup language XML, where “XML” stands for Extended Markup Language.
  • the transformation T e.g. B. an Extended Stylesheet Language Transformation or XSLT
  • transformation rules TR z. B. described within XSL (Extended Stylesheet Language) files, whereby e.g. the rules formulated in XSL include are used as Language Converter LC and describe how the XML-coded source code CodeML with a language extension LE can be transformed into a variant without language extension.
  • XSL Extended Stylesheet Language
  • FIG. 3 shows a first exemplary embodiment in which a first code CodeML formulated in a meta markup language contains a language extension for PreProcessing PPE (e.g. ⁇ define>, ⁇ ifdef>, etc.), and with the aid of a transformation T as a function of
  • PPE PreProcessing
  • Transformation rules TR which have a PreProcessing Language Converter PPLC that dissolves or applies the PPE, are transformed into a second code CodeML * formulated in the meta-markup language without language extension.
  • the language extension is typically designed in the form of elements for generic programming 1 and / or for pre-processing 2 and / or a customer-specific or developer-specific grammar 3 and / or for macros 4.
  • the programmer is given more freedom by the invention, since the grammar of the programming language used is based on the The wishes of the programmer can be coordinated and a re-transformation to the normal grammar of the programming language only has to take place at the end of program development.
  • Another major advantage is that the language extensions can be validated with a compiler intended for the normal programming language.
  • the method is based on standards such as XML and XSLT and is subject to fewer restrictions in terms of convertibility into other programming languages than other methods for modifying source code.
  • This type of modification allows the creation of hierarchies, among other things. through the possibility of orderly, automated sequential execution (pipelines) of several transformations, e.g. of language adjustments.
  • transformations can be saved for general reuse in XSLT files, so that libraries e.g. can arise for certain processes.
  • An XML representation of the source code can be stored in an XML database and, if necessary, with the help of a
  • XSTL can be easily adapted to the respective customer or developer needs (customization).
  • the code can be checked (validated) in advance (without compilation) for certain correctness aspects.
  • FIG. 4 shows an overall block diagram for explaining the invention, in which a source code SC is first converted by a converter CONV into a first code CodeML formulated in a meta markup language, the source code SC being immediately
  • Compilation would result in a byte code or binary code B.
  • the code CodeML shown in the meta markup language is now modified on the way of a transformation T exclusively by using transformation rules TR, which consist of conditions C and / or logic L and / or code fragments CF, which results in a second codeML *, also formulated in the meta-markup language .
  • Another converter RCONV converts the code CodeML * back into a source code SC * after the transformation, which is typically formulated in the same language as the source code SC.
  • the modified code SC * is finally converted into a modified byte code B * or else into an executable binary code by a compiler COMP. It is important here that the byte code B * differs in principle from the byte code B or that the source code has been changed not only in its representation but also in its program flow.
  • the source code SC and the modified source code SC * are, for example, in the Java programming language and the codes CodeML and CodeML * are, for example, in the meta-markup language XML, where “XML * for Extended
  • the transformation T e.g. B. an Extended Stylesheet Language Transformation or XSLT
  • transformation rules TR z. B. described within XSL (Extended Stylesheet Language) files, whereby e.g. the rules TR formulated in XSL and others describe how the XML-coded source code CodeML is combined with the code fragment CF to form a new modified source code CodeML * with integrated CF, or a modification thereof, which can now contain additional logging functionality, for example.
  • FIG. 5 shows a first exemplary embodiment in which the transformation rules TR correspond specifically to aspect rules AR according to aspect-oriented programming (AOP) which expressed in the AspectJ language, contain at least one Pointcut PC and / or at least one Advice-Type AT and / or at least one Advice-Body AB and can be assigned in their order to the components from Figure 5.
  • AOP aspect-oriented programming
  • an aspect is a unit that contains crosscutting concerns, e.g. logging, modularized and encapsulated in one place.
  • the corresponding code which has hitherto passed through several modules, is brought together using a single aspect.
  • LoggingAspect .xsl which contains all the necessary transformation rules and ensures that every method with a "cal * in its name is found and at the beginning of the execution of this method a print command System.out.printin (" calculate begin ⁇ ) and at the end of executing this method
  • FIG. 6 relates to a second application example of the invention, in which CodeML is also used from a source code the transformation T generates a transformed code CodeML *, which now contains a mechanism for securing (OLD) or determining (NEW) at least one state for the desired (version) migration.
  • the transformation rules TR are designed in such a way that they can be referred to as migration rules MR and, in addition to C and L, at least one fragment, so-called checkpoints CP, for generating (CP write) or reading in (CP read) states ( CP Data), which enable migration from an older version B * OLD to a newer version B * NEW.
  • the format conversions of the system states to be transferred, which are required for a migration can also be taken into account here. This means that future migrations do not need to be taken into account in advance, which means that the test effort and related potential program errors in early program versions are avoided. Automating the migration avoids human errors, since the migration is much more systematic.
  • FIG. 7 shows a third exemplary embodiment in several sub-variants, in which a source code CodeML encoded in XML is also converted into a modified CodeML * by a transformation T.
  • transformation T is effected here by transformation rules TR, which in each variant consist of at least C and L and, like in the implementation of templates TP, additionally contain at least one template fragment TPF, for example for the conversion into an EJB (Enterprise Java Bean) and have at least one pattern fragment PF when converting patterns P, for example for the use of proxy, factory or singleton patterns.
  • TPF template fragment
  • P for example for the use of proxy, factory or singleton patterns.
  • C and L are sufficient, since only code is removed here, and unnecessary output statements or comments, for example, can be eliminated.
  • proxy patterns appropriately, local calls can be converted into remote calls or, similarly, local classes into EJB classes (Enterprise Java Beans).
  • a valid template TP which can be used as a template for other source code, can also be generated from the XML-coded source code JavaML or a fragment of this code.
  • the method is based on standards such as XML and XSLT and is subject to fewer restrictions with regard to convertibility into other programming languages than other methods for modifying source code.
  • transformations can be saved as general transformations for reuse in XSLT files, so that libraries e.g. can arise for certain processes.
  • An XML representation of the source code can be stored in an XML database and, if necessary, can be easily adapted to the respective customer needs using an XSLT.
  • the code can be checked (validated) in advance (without compilation) for certain correctness aspects.
  • Permanent XML-based program libraries that support XPath requests can improve the reuse of code by better finding code or code fragments or templates.
  • FIG. 8 shows an overall block diagram to explain the invention, in which a source code SC is converted by a converter CONV into a first code CodeML formulated in a meta markup language, the source code SC being able to produce a byte code or binary code B when compiled immediately. Additional information INFO is now added to the code CodeML or ultimately the source code SC to the code CodeML shown in the meta-markup language by means of a transformation T described by transformation rules TR, which results in a second code also formulated in the meta-markup language CodeML * results.
  • Another converter RCONV converts the code CodeML * back into a source code SC * after the transformation, which is typically formulated in the same language as the source code SC.
  • the modified code SC * is finally converted into a modified byte code B * or else into an executable binary code by a compiler COMP. It is important here that the byte code B * differs from the byte code B or that the source code has been changed not only in its representation but also in its program flow.
  • the source code SC and the modified source code SC * are, for example, in the Java programming language and the codes CodeML and CodeML * are, for example, in the meta-markup language XML, where “XML * stands for Extended Markup Language.
  • FIG. 10 shows a first exemplary embodiment in which the additional information INFO in the form of data D, for example initialization states SSDb, state data SDa, database data De, any data x, is mixed into the CodeML, these data being, for example, fixed states or values for constants and variables.
  • the source code SC can be supplied with fixed states and transformed so that a required state is immediately available at runtime of the program, for example as initialization state SSDb can no longer be determined separately.
  • object states can also be introduced into the code, which enable the recovery of an interrupted program at the same location with the same states, without having to take additional complex program-technical precautions for this.
  • transformation T e.g. B.- an Extended Stylesheet Language Transformation, or XSLT
  • transformation rules TR e.g. B. described within XSL (Extended Stylesheet Language) files, whereby e.g. the rules formulated in XSL include describe how the XML-coded source code CodeML is combined with the status data from D to form a new modified source code CodeML * with SSDb, SDa and De.
  • the rules of a transformation T can be such that the information is mixed in its original form but also in a form changed by rules.
  • the rules of a transformation T can also be such that the transformation T, e.g. with the help of if conditions that influence information or data.
  • FIG. 9 shows a second exemplary embodiment in which a code fragment CFb coded in XML with an original source code CodeML coded in XML, which contains a code fragment CFa, is transformed by the transformation T such that the coded XML is modified Source code CodeML * contains a code fragment CFb instead of the previously existing fragment CFa.
  • the transformation T is also controlled by transformation rules TR.
  • Such an exchange of code fragments can e.g. be referred to as "patching *.
  • patching can be achieved in a consistent manner with a maximum degree of freedom for the software developer, this being possible, for example, automatically and taking mutual dependencies into account.
  • Listing 1A For this exemplary embodiment, a specific case is shown by the listings 1A to 6A of the program listings located in Appendix 5. From the Java source code TestOutput. java in turn becomes a text output. java generated.
  • Listing 3A shows the CodeFragment.xml file, which provides a code fragment.
  • listing 5A is the content of the file TestOutput.xjava (*) with the modified XML source code and in listing 6A in the file TestOutput. java (*) the modified Java source code.
  • Figure 11 relates to a third application example of the
  • the transformation XSLT is determined here by transformation rules TR, which specify the places of the source code to be changed and the respective selected natural language, for example German or English.
  • the method according to the invention thus enables the source code to be localized and internationalized in an efficient and economical manner, while minimizing the additional runtime required for this.
  • the method is based on standards such as XML and XSLT and is subject to fewer restrictions with regard to convertibility into other programming languages than other methods for modifying source code.
  • Reuse can be saved in XSLT files, so that libraries e.g. can arise for certain processes.
  • An XML representation of the source code can be stored in an XML database and, if necessary, with the help of a
  • XSTL can be easily adapted to the respective customer needs (customization).
  • the code can be checked (validated) in advance (without compilation) for certain correctness aspects.

Landscapes

  • Engineering & Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Devices For Executing Special Programs (AREA)

Abstract

L'invention réside essentiellement dans le fait que: dans une première variante, des composants d'un logiciel sélectionnés servent de points de variation, ces composants étant convertis en un premier code XML, le logiciel est alors délivré sous forme mixte et le premier code est converti, côté client, en un second code XML par au moins une transformation, par exemple une transformation XSLT, seulement en fonction de règles de transformation; dans une deuxième variante, un premier code XML, qui contient au moins une extension de langage, est converti en un second code XML plus facilement vérifiable, sans cette ou ces extension(s) de langage; dans une troisième variante, un code source formulé selon XML est transformé de sorte que, après une rétroconversion dans le langage de programmation d'origine, un nouveau code source est formé, dans lequel non seulement la représentation, mais également le contenu proprement dit du programme ou la fonctionnalité ont été modifiés; ou bien, dans une quatrième variante, un code source formulé selon XMl avec, par exemple, des états de départ, des fragments de code à changer et des modules de langue étrangère adaptés à la langue naturelle respective de l'utilisateur, est mélangé par transformation, ce qui permet d'obtenir, après une rétroconversion, un nouveau code source dans lequel non seulement la représentation, mais également le contenu proprement dit du programme ou la fonctionnalité ont été modifiés.
EP04739074A 2003-04-01 2004-03-29 Procede et dispositif pour modifier un logiciel ou un code source Withdrawn EP1609061A2 (fr)

Applications Claiming Priority (9)

Application Number Priority Date Filing Date Title
DE10314834 2003-04-01
DE10314835 2003-04-01
DE10314831 2003-04-01
DE10314834A DE10314834A1 (de) 2003-04-01 2003-04-01 Verfahren Anordnung zur Modifikation von Quellcode unter Einbeziehung zusätzlicher Informationen
DE10314831A DE10314831A1 (de) 2003-04-01 2003-04-01 Verfahren und Anordnung zur Transformation von Quellcode
DE10314832A DE10314832B3 (de) 2003-04-01 2003-04-01 Verfahren und Anordnung zur kundenseitigen Anpassung von Software
DE10314832 2003-04-01
DE10314835A DE10314835A1 (de) 2003-04-01 2003-04-01 Verfahren und Anordnung zur Erzeugung und Verarbeitung eines Quellcodes mit Spracherweiterungen
PCT/EP2004/003301 WO2004088549A2 (fr) 2003-04-01 2004-03-29 Procede et dispositif pour modifier un logiciel ou un code source

Publications (1)

Publication Number Publication Date
EP1609061A2 true EP1609061A2 (fr) 2005-12-28

Family

ID=33136033

Family Applications (1)

Application Number Title Priority Date Filing Date
EP04739074A Withdrawn EP1609061A2 (fr) 2003-04-01 2004-03-29 Procede et dispositif pour modifier un logiciel ou un code source

Country Status (3)

Country Link
US (1) US8473937B2 (fr)
EP (1) EP1609061A2 (fr)
WO (1) WO2004088549A2 (fr)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7650196B2 (en) * 2005-09-30 2010-01-19 Rockwell Automation Technologies, Inc. Production monitoring and control system having organizational structure-based presentation layer
US20070240040A1 (en) * 2006-04-05 2007-10-11 Christopher Peters Non-compiled portable algorithm
US8079027B2 (en) * 2006-09-08 2011-12-13 Via Technologies, Inc. Programming language translation systems and methods
US8612945B2 (en) * 2008-05-13 2013-12-17 Nec Corporation XML processing device, XML processing method, and XML processing program
CN101650648A (zh) * 2008-08-14 2010-02-17 鸿富锦精密工业（深圳）有限公司 动态调用功能模块的系统及方法
US8984165B2 (en) * 2008-10-08 2015-03-17 Red Hat, Inc. Data transformation
US9965453B2 (en) * 2009-10-15 2018-05-08 Microsoft Technology Licensing, Llc Document transformation
US9223570B2 (en) * 2013-03-14 2015-12-29 Red Hat, Inc. Migration assistance using compiler metadata
CN112306497B (zh) * 2020-11-03 2024-04-26 高炼 一种将自然语言转化为程序代码的方法及系统

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6052531A (en) * 1998-03-25 2000-04-18 Symantec Corporation Multi-tiered incremental software updating
US6981212B1 (en) * 1999-09-30 2005-12-27 International Business Machines Corporation Extensible markup language (XML) server pages having custom document object model (DOM) tags
US7188332B2 (en) * 1999-10-05 2007-03-06 Borland Software Corporation Methods and systems for relating a data definition file and a data model for distributed computing
DE10121790B4 (de) * 2000-06-03 2006-11-23 International Business Machines Corp. Softwarekonfigurationsverfahren zur Verwendung in einem Computersystem
US7000230B1 (en) * 2000-06-21 2006-02-14 Microsoft Corporation Network-based software extensions
US7219332B2 (en) * 2000-07-07 2007-05-15 Microsoft Corporation Configuring software components(merge) with transformation component using configurable and non-configurable data elements
US20050091666A1 (en) * 2000-08-14 2005-04-28 Transvirtual Technologies, Inc. Portable operating environment for information devices
US7739308B2 (en) * 2000-09-08 2010-06-15 Oracle International Corporation Techniques for automatically provisioning a database over a wide area network
JP2002182915A (ja) * 2000-12-19 2002-06-28 Tokio Marine & Fire Insurance Co Ltd ソース・プログラム保管方法及びシステム、ソース・プログラム復元方法及びシステム、並びにコンパイル方法及び装置
US20020143816A1 (en) * 2001-03-06 2002-10-03 Geiger Michael P. Method and system for using a generalized execution engine to transform a document written in a markup-based declarative template language into specified output formats
US7310653B2 (en) * 2001-04-02 2007-12-18 Siebel Systems, Inc. Method, system, and product for maintaining software objects during database upgrade
US7703009B2 (en) * 2001-04-09 2010-04-20 Huang Evan S Extensible stylesheet designs using meta-tag information
US20040015890A1 (en) * 2001-05-11 2004-01-22 Windriver Systems, Inc. System and method for adapting files for backward compatibility
US20040015832A1 (en) * 2001-05-25 2004-01-22 Michael Stapp Method and apparatus for generating source code
AU2003238815A1 (en) * 2002-05-29 2003-12-19 Globespan Virata Incorporated Method and system for providing a command-line interface syntax from an xml specification
US7721202B2 (en) * 2002-08-16 2010-05-18 Open Invention Network, Llc XML streaming transformer
US7069504B2 (en) * 2002-09-19 2006-06-27 International Business Machines Corporation Conversion processing for XML to XML document transformation
CA2409079A1 (fr) * 2002-10-21 2004-04-21 Ibm Canada Limited-Ibm Canada Limitee Creation d'interpretations d'affaires multiples et en cascade a partir de donnees d'application brutes au moyen de couches de transformation
US7346897B2 (en) * 2002-11-20 2008-03-18 Purenative Software Corporation System for translating programming languages

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2004088549A2 *

Also Published As

Publication number Publication date
US8473937B2 (en) 2013-06-25
WO2004088549A3 (fr) 2005-02-24
US20090210864A1 (en) 2009-08-20
WO2004088549A2 (fr) 2004-10-14

Similar Documents

Publication Publication Date Title
EP1723513B1 (fr) Procede pour configurer un programme informatique
WO2010040597A2 (fr) Procédé et dispositif pour remplacer un composant d'un système informatique
EP0432802A2 (fr) Procédé pour l'analyse syntactique automatique du texte de programmes d'ordinateur dans des compilateurs
WO2015185328A1 (fr) Procédé informatisé et successions de signaux pour un programme de réutilisation de configurations logicielles exécutables pour systèmes logiciels ainsi que système informatique et programme informatique avec code programme pour mettre en œuvre le procédé
EP1904923A1 (fr) Procede et systeme logiciel pour configurer un systeme modulaire
EP1609061A2 (fr) Procede et dispositif pour modifier un logiciel ou un code source
DE102004009676A1 (de) Verfahren und Systeme zum Erzeugen von Unterstützungsdateien für Befehle
DE10041072A1 (de) Verfahren zur automatischen Erzeugung von Programmcode
DE10234971A1 (de) Erzeugen und Korrigieren von Programmcode
DE10357831A1 (de) System und Verfahren zum Reengineering von Objektmodell-Komponenten zur Generierung von Web-Services
DE10314832B3 (de) Verfahren und Anordnung zur kundenseitigen Anpassung von Software
DE10314831A1 (de) Verfahren und Anordnung zur Transformation von Quellcode
EP1668494B1 (fr) Procede et systeme de configuration vocale d'un programme informatique
EP1343078B1 (fr) Dispositif pour la modélisation et génération des systèmes de génération de logiciel
DE102020118832B3 (de) Verfahren zum Bereitstellen sicherheitsrelevanter Daten mittels eines Serversystems, Serversystem und Computerprogrammprodukt
DE10314835A1 (de) Verfahren und Anordnung zur Erzeugung und Verarbeitung eines Quellcodes mit Spracherweiterungen
DE19924610B4 (de) Setup-Verfahren
DE102004022183B4 (de) Verfahren zum Ändern von Programmobjektcode bei Quelltextänderungen
DE10300541A1 (de) Erzeugen einer ausführbaren Datei
DE10314834A1 (de) Verfahren Anordnung zur Modifikation von Quellcode unter Einbeziehung zusätzlicher Informationen
EP0560342B1 (fr) Méthode pour le débogage de programmes HDL
EP3079148A1 (fr) Procede de preparation de donnees d'affichage en tant que messages dans plusieurs langues et systemes d'ecriture au moyen d'un afficheur d'un appareil menager
DE19617719C2 (de) Verfahren zur Programmübersetzung eines in der Programmiersprache C++ geschriebenen Programms
EP2175331A1 (fr) Appareil pouvant être commandé doté d'un programme de commande et méthode pour commander l' appareil
DE102004039200A1 (de) Versionskontrolle

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20050909

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

RIN1 Information on inventor provided before grant (corrected)

Inventor name: REICHEL, CHRISTIAN

Inventor name: OBERHAUSER, ROY

DAX Request for extension of the european patent (deleted)
RBV Designated contracting states (corrected)

Designated state(s): DE FR GB

17Q First examination report despatched

Effective date: 20100629

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SIEMENS AKTIENGESELLSCHAFT

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SIEMENS AKTIENGESELLSCHAFT

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20161001