62 results about "COBOL" patented technology

The present invention is directed to a system for for automated interface generation for computer programs operating in different environments. The system comprises a utility which imports a CICS COBOL transaction source file, parses the communication area of the CICS file, and generates modelling information. The modelling information represents the nature and structure of data in the CICS transaction source file, and is written to a persistent data store. The utility uses the information in the persistent data store to generate an application programming interface. The application programming interface takes the data values from the other language and translates them to a formatted CICS COBOL communications area. This format is derived from the definition of the CICS communications area contained in the imported CICS program. After the translation runs, the resulting CICS COBOL communications area is translated back to the data values of the other language. This translation step also handles the data conversion between different codepages and machine architectures and program semantics. The resulting language values represent the result of the transaction. The CICS transaction is accessed using the CICS External Call Interface mechanism.

The present invention relates to a method for program transformation and an apparatus for COBOL to Java program transformation. The method consists of: (1) a new approach for statement-to-statement program transformation, facilitated by a predefined target language library, which keeps original comments, program control flow, functionality, and time complexity; (2) a new approach for goto statement elimination, which uses existing exception handling mechanism in target language and its implementation is hidden in a super class in a library; (3) a new extended BNF to distinguish different occurrences of the same term in a BNF production; (4) a new approach for embedded statement as a special marker statement and a comment, (5) in the description of the above, a program transformation specification language is defined to describe relationship between comments in two languages. (6) an apparatus, as the preferred embodiment of the method, is a COBOL to Java program transformation system Cobol2Java; a sample COBOL application and its Cobol2Java translation are given.

A method of and a system for processing an enterpise an application request on an end user application and an application server. This is accomplished by initiating the application request on the end user application in a first language (such as a markup language) with a first application program (such as a Web browser), and transmitting the application request to the server and converting the application from the first language of the first end user application to a language running on the application server, processing the application request on the application server, and transmitting the response from the application server back to the end user application, and converting the response from the language running on the application server to the language of the end user application. The end user application and the application server have at least one connector between them, and the steps of (i) converting the application request from the language of the end user application (as a source language) to the language running on the application server (as a target language), and (ii) converting the response to the application request from the language running on the application server (as a source language) to the language of the end user application (as a target language), each include the steps of invoking connector metamodels of the respective source and target languages, populating the connector metamodels with metamodel data of each of the respective source and target languages, and converting the source language to the target language.

An efficient program analysis method is provided for lazily decomposing aggregates (such as records and arrays) into simpler components based on the access patterns specific to a given program. This process allows us both to identify implicit aggregate structure not evident from declarative information in the program, and to simplify the representation of declared aggregates when references are made only to a subset of their components. The method can be exploited to yield: (i) a fast type analysis method applicable to program maintenance applications (such as date usage inference for the Year 2000 problem); and (ii) an efficient method for atomization of aggregates. More specifically, aggregate atomization decomposes all of the data that can be manipulated by the program into a set of disjoint atoms such that each data reference can be modeled as one or more references to atoms without loss of semantic information. Aggregate atomization can be used to adapt program analyses and representations designed for scalar data to aggregate data. In particular, atomization can be used to build more precise versions of program representations such as SSA form or PDGs. Such representations can in turn yield more accurate results for problems such as program slicing. Our techniques are especially useful in weakly-typed languages such as Cobol (where a variable need not be declared as an aggregate to store an aggregate value) and in languages where references to statically-defined sub-ranges of data such as arrays or strings are allowed.

A computer-implemented system or process is programmed or configured to use a configuration file to specify one or more tasks to apply to raw ingested data. A task may be a sequence of instructions programmed or configured to format raw ingested data into a dataset in a CSV format. Examples of tasks may include: a parser to parse Cobol data into a CSV, a parser to parse XML into a CSV, a parser to parse text using fixed-width fields to a CSV, a parser to parse files in a zip archive into a CSV, a regular expression search/replace function, or formatting logic to remove lines or blank lines from raw ingested data. In one embodiment, the configuration file may specify a schema definition for a task to use for generating a dataset. In one embodiment, the configuration file may also include one or more access control list (ACL) definitions for the generated dataset. In one embodiment, the building of datasets using the configuration file is automated, for example, on a nightly basis.

A method and apparatus is disclosed for compilation of an original Cobol program and building an executable program with support for improved performance by increased parallelism during execution using multiple threads of processing. The approach includes a compilation (or translation) step utilizing a first compiler or translating program which is a parallel aware translating first compiler. The parallel aware first compiler is a specialized compiler/translator which takes as input a Cobol source program, and produces as output an intermediate computer program in a second computer programming language, the intermediate program including parallelization directives, the intermediate program intended for further compilation utilizing an existing selected second compiler, the second compiler providing support for parallelism for programs described in the second programming language. The approach optionally allows for use of pragmas serving as parallelization directives to the compiler in the original Cobol program or in the intermediate program.

A method, apparatus, and program for translating source code programs from COBOL into an object-oriented language and then utilize an “object” that emulates the COBOL's Working-Storage Section. By emulating the Working-Storage Section in an object-oriented program, the object-oriented program source code can closely resemble the original COBOL source code as well as have a very clean syntax. This allows it to be kept in a highly maintainable and readable form after translation.

As manufacturers of very fast and powerful commodity processors continue to improve the capabilities of their products, it has become practical to emulate the proprietary hardware and operating systems of powerful older computers on platforms built using commodity processors such that the manufacturers of the older computers can provide new systems which allow their customers to continue to use their highly-regarded proprietary legacy software on state-of-the-art new computer systems by emulating the older computer in software that runs on the new systems. In an example of the subject invention, a 64-bit Cobol Virtual Machine instruction provides the capability of adding to or improving the performance of legacy 36-bit Cobol code. Legacy Cobol instructions can be selectively diverted, in the host CPU, to a 64 bit Virtual Machine Implementation. The output legacy and new Cobol code is compiled in a dedicated implementation of the Cobol compiler, and the output of the special purpose compiler is emulated in a special purpose software emulator, separate from the main software emulator that handles the normal 36-bit stream of legacy code.

A method of sharing memory between COBOL programs is provided. The method includes maintaining, by a COBOL routine, an index of shared memory addresses, requesting, by a COBOL program, a shared memory block, and receiving to a linkage section of the COBOL program an address of the shared memory block from the COBOL routine. A method of enabling queues for COBOL programs is also provided. The method includes creating a queue using a memory space and providing an operating system having a key related to an address of the memory space. The method provides for maintaining the key in an index and communicating with the operating system to receive the address of the memory space based on the key. The method also provides for resolving the memory space to an operable portion of the COBOL program based on the key from the index.

Automated interface generation for computer programs operating in different environments is provided. An automated interface generation system, method, computer program product and article of manufacture is provided comprising an import utility and a runtime environment. The import utility imports a COBOL IMS transaction source file, parses the specified input and output message records, and generates an application programming interface. The application programming interface operates with the runtime environment to take the data values from the language of a different environment and translate them to a formatted IMS input message. This format is derived from the definition of the input message record in the COBOL IMS transaction source file. After the IMS transaction has executed, the resulting IMS output message is translated back to the data values of the language of the different environment, said values including the results of the transaction. The translation step handles data conversion between different code pages, machine architectures, and program semantics, and handles the dynamic nature of IMS messages.

A method and system for locating assets is disclosed that provides the capability for the gathering of information about assets contained in data repositories and the capturing of the gathered information in a database which can be used for the conducting of subsequent searches. By integrating into the system a series of data analyzers that are specific to each type of data contained in the repositories (e.g., a Java analyzer, a C/C++ analyzer, a COBOL analyzer, an HTML analyzer, and/or an XML analyzer) the system can be used to search the repositories using conventional keyword-searching techniques, as well as by searching for particular attributes specific to a particular language, or by combining keyword-searching with attribute-specific searching.

A system for enabling socket communication in COBOL program is provided. The system includes a memory block, a COBOL program communicating with the memory block, a socket and a COBOL routine callable from the COBOL program. The COBOL routine is operable to read information from the socket and write the information read from the socket to the memory block in response to the COBOL program call. A method for socket and pipe communication in COBOL is also provided. The method includes reading, by a routine, information from a socket or pipe and writing, by the routine, the information to an area. The method provides for reading, by a COBOL program, the information from the area. The COBOL program and the routine operating in the same runtime environment.

A method for facilitating the processing of markup language documents, e.g., XML documents, uses a code generator that creates programs configured to read dynamic XML documents at run time, avoiding many of the complexities arising from the use of conventional “XML Parse” statements. In one embodiment, this process involves (1) creating a template document using the markup language, wherein the template document includes a set of tags associated with the markup language documents; (2) parsing the template document to determine a data structure corresponding to the tags in the template document; and (3) generating an application program in the programming language (e.g., COBOL), wherein the application program includes a definition of the data structure, and is configured to read, during run-time, the markup language document and generate a corresponding set of data elements corresponding to the data structure.

A method and apparatus is disclosed for compilation of an original Cobol program with support for improved performance by increased parallelism during execution using multiple threads of processing. The approach includes a two stage compilation process, the first compilation/translation step by a first specialized compiler/translator that takes as input a Cobol source program that includes parallelization directives, and produces as output an intermediate computer program in a second computer programming language, the intermediate program including parallelization directives in the second computer programming language. The intermediate program is then compiled utilizing a selected second compiler that provides support for parallelism described in the second programming language. The approach optionally allows for use of pragmas serving as parallelization directives to the compiler in the original Cobol program or in the intermediate program.

The present invention provides copybook flat data conversion with inline transformation. Specifically, a streaming intermediary formatted data message is generated as a result of converting/transforming a flat file format (non-XML (Extensible Markup Language) format), such as raw fixed-length field COBOL (Common Business-Oriented Language) copybook format or the like. The streaming intermediary format is not fully held in memory, but rather is directly transformed/converted, using XSLT (Extensible Stylesheet Language Transformations) processing, into a target format, such as structured XML or the like. By directly streaming the intermediary format to the XSLT process without holding the entire data message in memory, the present invention utilizes less memory and, as such, less memory is needed to be reclaimed.

The invention relates to a method and a system for converting a traditional program language into a modern program language. The method comprises the following steps that: obtaining a COBOL (Common Business-Oriented Language) source code which needs to be converted and a corresponding configuration rule; generating the COBOL source code into a corresponding JAVA source code according to the corresponding configuration rule; and configuring a basic environment for the JAVA source code. By use of the method, a configuration file is loaded, the COBOL source code which needs to be converted is converted into the JAVA source code, an SDK (Software Development Kit) is used by aiming at the converted JAVA source code to carry out data type packaging and the basic environment configuration of a method interface, a basic platform is adopted to carry out online transaction processing, COBOL grammar conversion is comprehensively supported, program language accuracy before conversion is kept, theredirecting and the pointer assignment processing of the COOL are truly realized, practical operation efficiency is high after conversion, maintainability is good, and maintenance cost can be lowered.

Embodiments of the present invention address deficiencies of the art in respect to XML processing in a COBOL environment and provide a method, system and apparatus for processing a COBOL syntax to allow native XML parsing. In a method of the invention, COBOL source code can be processed and an XML processing directive can be detected in the COBOL source code. In any case, a file path can be extracted from the XML processing directive in the processed COBOL source code. Subsequently, object code can be produced that is configured to process XML data in an XML document stored at a location specified by the file path. Specifically, the object can be configured to parse XML data in an XML document stored at a location specified by the file path, or to generate XML data in an XML document stored at a location specified by the file path.

The invention provides a code cloning detection method based on a hash value, comprising the steps of reading a source code, extracting a code base in the source code through an analyzer, and obtaining a cloning detection object; obtaining the anonymous hash value of the clone detection object by processing the clone detection object with the hash algorithm, and obtaining some code clone groupingby clustering the anonymous hash value; comparing the code in the code cloning grouping in pairs within the group to determine whether the respective lines of the two pieces of code or the number of different code lines are less than a threshold value, and if yes, judging the code cloning to be similar, otherwise not judging the code cloning to be code cloning. The present invention relates to anelectronic device and a readable storage medium for performing the method described above. The invention can detect code cloning with identifier difference and code cloning with line number difference, can detect code cloning according to COBOL source code, has no limitation of platform and specific version language, has good portability, and reduces overall complexity by clustering hash value.

The present disclosure provides a method for enabling events in a COBOL program, including maintaining, in a COBOL program, a index including a process identifier and an event associated with a child process. The method includes placing the child process in a wait state and signaling, by the COBOL program, the child process to run using the process identifier and the event associated with the child process. A system for coordinating processing in COBOL programs is also provided. The system includes a first COBOL program having a first routine for processing, a second COBOL program having a second routine for processing, and a module callable by the first and second COBOL programs. The module maintains a state sharable between the first and second COBOL programs to coordinate the processing of the first and second routines.

A method and apparatus is disclosed providing an improvement in performance for arithmetic computations by a computer system for calculations which include decimal numeric variables. The improvement in at least one embodiment includes use of a special compiler in cooperation with a special decimal numeric subroutine library. The compiler provides comparative alignment information based upon comparing alignments of a plurality of decimal variables. The decimal subroutine library can then provide improved performance at run time by utilizing the information compared by the compiler at compiler time rather than making those computations repeatedly at run time.

A computer readable medium is configured to receive an identification of a plurality of data records, where each data record corresponds to one of a plurality of data record schemas represented in COBOL, and each data record schema corresponds to one of a plurality of standardized data record schemas. The computer readable medium is further configured to specify one of the plurality of standardized data record schemas as a selected standardized data record schema, and to process the plurality of data records based on the selected standardized data record schema.

A method, apparatus, and program product are disclosed for carrying out the compilation of an original Cobol program that includes a mix of Cobol, C++ or JAVA and optional OpenMP directives in a single source program file so as to provide improved performance during execution of the program and improved convenience and features in programming. The approach or method includes performing a compilation (or translation) step utilizing a first compiler or translating program which is a is a specialized compiler/translator that takes as input a Cobol source program including a further provision for the inclusion of C/C++ program statements and OpenMP statements, and produces as output an intermediate computer program, the intermediate program that is entirely in C or C++, the intermediate program being intended for further compilation by an existing selected second compiler, the second compiler being an optimizing compiler that provides support for parallelism for the programs described in the C/C++ programming languages.

A computer determines a cursor location within source code displayed on a display screen. The computer determines a keyword based at least on the cursor location. The cursor location may include: line number, column number, designated non-word location, and/or reserved word. The computer takes an action based on the keyword including, but not limited to the following actions: jumping to the first occurrence of the keyword search term, extracting a COBOL copybook data set, and/or sending an EXPLAIN query to a database manager.

A tilting tree, spinning cones process is employed to map n-dimensional array data originally in markup language, to an n-dimension table suitable for use by COBOL application programs. Mapping is performed without scanning the result array for an empty slot. This allows the result array slots to be pre-loaded with state data. During mapping, the hierarchical nature of the markup language n-dimensional data is represented in two-dimensions using an inverted tree structure having cones for each array level. The tree is tilted to bring a member of a given level into contact with one of the axes of the tree graph, followed by spinning appropriate cones to bring a certain member of that level into contact with the same axis. This results in the ability to use a one-dimensional mapping array. The dimension offset on the mapping axis can then be used as an index value into the mapped array output for storage or retrieval of element data.