Entries |
Document | Title | Date |
20080201692 | SIEBEL SPF TEMPLATE FILE UPDATE UTILITY - The present invention is directed to a Siebel SPF template file update utility. A method for updating a template file in accordance with an embodiment of the present invention includes: obtaining a template file, an existing row_id, and a target row_id; scanning the template file for section markers; locating an encoded length of a section of the template file using a section marker; decoding the encoded length of the section to obtain a section length; reading the section in its entirety using the section length; scanning the section to locate each instance of the existing row_id; replacing each instance of the existing row_id with the target row_id; and recalculating and re-encoding the section length. This process is repeated for each additional section marker | 08-21-2008 |
20080216051 | System and method of interlocking to protect software-mediated program and device behaviours - Methods and devices for thwarting code and control flow based attacks on software. The source code of a subject piece of software is automatically divided into basic blocks of logic. Selected basic blocks are amended so that their outputs are extended. Similarly, other basic blocks are amended such that their inputs are correspondingly extended. The amendments increase or create dependencies between basic blocks such that tampering with one basic block's code causes other basic blocks to malfunction when executed. | 09-04-2008 |
20080244512 | Code optimization based on loop structures - Instructions that have no dependence constraint between them and other instructions in a loop of a critical section may be moved out of the critical section so that the size of the critical section may be reduced. A flow graph of a program including the critical section may be generated, which includes loops. The flow graph may be transformed based on which any unnecessary instructions in loops may be moved out of the critical section. Subsequently, the original flow graph of the critical section may be recovered from the transformed flow graph. | 10-02-2008 |
20080256512 | OUT OF BAND DATA AUGMENTATION - Systems and methods facilitate data augmentation in a computer environment. Data collections of various forms are altered out of band with at least one augmentor specifying alterations thereto. The alterations are applied to an associated collection of data such as programmatic code. In this manner, data can be modified, extended and/or removed from the collection to enable specialization and/or personalization, among other things. | 10-16-2008 |
20080270981 | DETERMINATIOIN OF A SET OF CANDIDATE CODE INSERTIONS FOR INSERTION IN PROGRAM CODE - A code assistance feature provides a user with a set of suggested program code insertions at a given point in the program code being edited. For example, in response to a user command, the feature identifies syntactically correct possible insertions derived from a search for insertions of a compatible type. The feature identifies members in the set of possible code insertions that can be expanded via a field dereference or subroutine call to provide further possible code insertions for selection by the user. | 10-30-2008 |
20080270982 | METHOD FOR AUTOMATING VARIABLES IN END-USER PROGRAMMING SYSTEM - A method for automating variables in an end-user programming system is disclosed. The end-user programming system comprises a script, a shared repository, at least one database, a recorder, an interpreter, and an execution engine. The script comprises at least one command describing an event comprising a data value. Each user has a uniquely identified entry set for the entries distributed in at least one database. The interpreter automatically creates a variable for a data value in a command by comparing the data value with each entry value in the entry set for the user recording the command. The interpreter automatically instantiates a variable in a command with an entry value by comparing the variable with each entry name in the entry set for the user executing the command. | 10-30-2008 |
20080301630 | MECHANISM TO PROVIDE DEBUGGING AND OPTIMIZATION IN POLICY AND KNOWLEDGE CONTROLLED DISTRIBUTED COMPUTING SYSTEMS, THROUGH THE USE OF TAGGED POLICIES AND KNOWLEDGE REPRESENTATION ELEMENTS - A mechanism to provide debugging and optimization in policy and knowledge controlled distributed computing system through the use of tagged policies is provided. An aspect of the mechanism tags one or more policies, for instance, at their creation time, execution time and/or at any other time an event that affects the policies occur. Decisions made according to policy execution or evaluation may be traced using the tags. | 12-04-2008 |
20080307387 | SOFTWARE DEVELOPMENT APPARATUS AND METHOD FOR PROVIDING PERFORMANCE PREDICTION - Provided are an apparatus and method for developing software. More particularly, provided are a software development apparatus and method enabling prediction of non-functional performance, such as execution time, as well as functional performance of each constituent module in a software development process. | 12-11-2008 |
20080320443 | WIKI APPLICATION DEVELOPMENT TOOL THAT USES SPECIALIZED BLOGS TO PUBLISH WIKI DEVELOPMENT CONTENT IN AN ORGANIZED/SEARCHABLE FASHION - The present invention discloses a software development system for WIKIs including a WIKI server, a BLOG server, and a data store. The WIKI server can serve WIKI pages to WIKI clients. The BLOG server can serve BLOGs to BLOG clients. The data store can manage WIKI BLOG entries. Each WIKI BLOG entry can include a link to one of the WIKI pages and metadata for the linked WIKI page. The metadata can include a WIKI page title, a WIKI page version, a WIKI page description, design notes, and other information. Searchable keywords can be generated from the metadata. WIKI BLOG entries can be searched by WIKI developers to find WIKI pages having designer specified criteria based on a keyword search. Wherein searching for WIKI BLOG entries and editing discovered WIKI pages associated with WIKI BLOGs can be performed by a WIKI client via a WIKI interface. | 12-25-2008 |
20080320444 | LATE BOUND PROGRAMMATIC ASSISTANCE - Programmatic assistance is provided for dynamic typing within an integrated development environment (IDE). Types associated with late bound constructs can be inferred from static information and/or determined from design time execution. Assistance can then be provided as a function of a precise and/or speculative type. Furthermore, dynamic type assistance can be employed in conjunction with static type assistance to facilitate development of a program that supports both late and early binding, for example. | 12-25-2008 |
20080320445 | SYSTEMS AND METHODS FOR GATHERING AND PROCESSING USER FEEDBACK - A system for enabling submission of user feedback includes an extension to an application that is configured for execution on a computing system. The extension is for operation with the application and may be invoked during execution of the application in order to submit user feedback on a feature of the application substantially contemporaneously with a presentation of the feature to the user during execution of the application. The extension may visually identify a location of the feature on a user's screen and display on the user's screen textual input, received from the user, concerning the feature. | 12-25-2008 |
20090007065 | LOGGING SYSTEM AND METHOD FOR COMPUTER SOFTWARE - The present invention provides a computer-implemented method to generate a logging dictionary for a compilation of a source code that has a logging statement and associated source code static data, comprising: selecting part of the source code that includes the logging statement; determining source code static data associated with the logging statement; generating a combined data element from the associated source code static data; correlating the combined data element with the logging statement; wherein if the combined data element does not occur in the logging dictionary correlated to said logging statement; assigning a log index value to the combined data element; and adding the log index value, correlated to the logging statement, to the log dictionary. | 01-01-2009 |
20090049425 | Code Obfuscation By Reference Linking - A method of obfuscating executable computer code to impede reverse-engineering, by interrupting the software's execution flow and replacing in-line code with calls to subroutines that do not represent logical program blocks. Embodiments of the present invention introduce decoy code to confuse attackers, and computed branching to relocated code so that actual program flow cannot be inferred from disassembled source representations. | 02-19-2009 |
20090055798 | METHOD AND APPARATUS FOR ADDRESS TAKEN REFINEMENT USING CONTROL FLOW INFORMATION - A computer implemented method, apparatus, and computer program product for obtaining aliasing information for a target variable in a computer program. A control flow graph representing the computer program is partitioned into an taken address portion that includes all reachable nodes in which an address of the target variable is taken and an untaken address portion that includes all other reachable nodes. All references to the target variable are replaced with a temporary variable in the untaken address portion. The target variable is initialized with the value from the temporary variable at each intermediary node in a set of intermediary nodes in the taken address portion. An intermediary node is a node at which an address of a target variable is taken. The aliasing information for the target variable is generated using the modified computer program. | 02-26-2009 |
20090064099 | STATIC ANALYSIS OF REACHABLE METHODS AND FIELDS IN OBJECT-ORIENTED APPLICATIONS USING OBJECT INSTANTIATION - Exemplary embodiments of the present invention comprise an algorithm described herein that utilizes a technique to shrink a set of potentially reachable elements to a close approximation of the actually reachable elements within a software application by closely approximating how the application executes at runtime. The algorithm attempts to identify all of the reachable elements of an object-oriented software application by starting with the entry points into the application and thereafter progressively determining all of the software elements within the application that are reachable. The algorithm instantiates application objects in the same way they would be instantiated at runtime and passes references to these objects from one method and field to the next; emulating as closely as possible object instantiation performed by the application at runtime. | 03-05-2009 |
20090064100 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR RECORDING OPERATIONS PERFORMED ON COMPUTER SOURCE CODE - A system, method, and computer program product are described. An example system comprises a development module creating and editing a plurality of classes in a plurality of files, the development module performing an operation that changes one of the classes and makes references to the class consistent with the change throughout the plurality of files, and a management module in communication with the development module storing the plurality of files, the management module creating and storing a record of the operation. | 03-05-2009 |
20090083704 | System and method for expediting information display - Exemplary systems and methods for expediting information display on a user device are provided. In exemplary embodiments, a request for information is received. An application server then generates and provides source code for a web page containing the requested information. In exemplary embodiments, a removal module is returned with the source code for the first web page. The removal module is configured to remove unnecessary elements from subsequent source code in order to expedite loading and displaying of subsequent web pages on the user device. In some embodiments, the web page comprises a syndicated web page within a window of a main web page. | 03-26-2009 |
20090094579 | METHOD AND SOFTWARE FOR EDITING WEB DOCUMENTS - Disclosed is a method of editing text using a web-based text editor. The method comprises opening a document using a web-based text editor; receiving a first user input for selecting a block of text in the document; in reply to the first user input, inserting, into a source code of the document, a first temporary node before the selected block and a second temporary node after the selected block; receiving a second user input for applying an attribute to the selected block; and in reply to the second user input, adding an attribute node between the first and second temporary nodes of the source code so as to apply the attribute to at least part of the block of the document. | 04-09-2009 |
20090125880 | POLYMORPHIC SOFTWARE ARCHITECTURE - A polymorphic software architecture is provided by which the shape of the architecture is enabled to be dynamically changed by splitting and fusing various architectural components (which may also be called “elements”) responsively to the environment in which the software executes, without changing the application's code. The splitting and fusing points determine, for example, the partitioning of functionality and data across architecture components, communication among the components, and the allocation of resources to the components. A profile of an end-user, or a profile of the runtime environment that supports the end-user, may be used to drive the shape of the software architecture so that overall design goals are met upon initial software deployment, and maintained as the profiles change. | 05-14-2009 |
20090125881 | SYSTEM AND METHOD FOR DYNAMICALLY REDEFINING CLASS FILES IN AN APPLICATION SERVER ENVIRONMENT - Disclosed herein is a system and method for dynamically redefining class files in a Java-based development environment. The existing development cycle in Java generally requires developers to edit, build, and deploy before they can test changes to the code. This process can be quite time consuming. There is a need for dynamically redefining and testing class files in a development environment without a significant time delay or loss of data. In one embodiment, when a developer modifies the class definition a ClassFileTransformer function is used to maintain the original shape of a redefinable class, i.e. its declared fields and methods, without affecting the redefined class' behavior or appearance to outside code. | 05-14-2009 |
20090138848 | COMPUTER READABLE RECORDING MEDIUM ON WHICH PROGRAM CONVERTING PROCESS PROGRAM IS RECORDED, PROGRAM CONVERTING METHOD, AND PROGRAM CONVERTING APPARATUS - A general-purpose rewriting process (patch process) is provided. In a program code, a command statement execution place and initialization of a character string variable of an argument of the command statement execution place are detected, and a range to be replaced is extracted on the basis of the detected place. In an adding operation of the detected character string, a portion (character string) to be added is extracted, and it is determined whether the portion is a fixed character string invariable) Based on information obtained by determining whether the added portion is invariable, a parameterized prepared command statement may be dynamically formed. In execution of the command statement, original function calling may be replaced with function calling using a prepared command statement. By the patch process, a byte code of a target program is rewritten and executed. | 05-28-2009 |
20090144697 | REFRACTOR INNER CLASS WITH OBJECT-ORIENTED PROGRAM OPTIMIZER TOOL FOR REDUCED FOOTPRINT AND FASTER APPLICATION START - A computer implemented method, computer program product, and data processing system for reducing the number of inner classes in a compiled computer program written in an object-oriented programming language. An outer class of the compiled computer program is received, wherein the outer class contains an inner class, wherein the outer class comprises instructions to create an instance of an inner class. The instance is to be used as one of a callback, a listener command, a set of instructions by which an object instance of the inner class transfers information to the corresponding containing instance of the outer class, and combinations thereof. A transformation of the outer class is performed by moving methods of the inner class, as well as their contained instructions, into the outer class. The behavior of the compiled computer program remains unchanged. | 06-04-2009 |
20090164973 | CONTRACT PROGRAMMING FOR CODE ERROR REDUCTION - In one embodiment, a computer system provides an application programming interface (API) for augmenting an application API. A computer system receives software code written in a second programming language indicating a user's intention to augment an application API with contracts from a contract API written in a first programming language. The software code includes a reference to the contract API. The contracts include assertions indicating appropriate use of the application API. The computer system accesses portions of the contract API according to the reference in the software code and compiles the received software code and the referenced portions of the contract API into an intermediate language (IL) version of the software code. The IL version is in an intermediate language common to both the first programming language and the second programming language. The IL version includes the assertions indicating appropriate use of the application API. | 06-25-2009 |
20090204942 | ITERATIVE COMPONENT BINDING - Component domains used to define a binding between various components associated with the component domain. The component domain tracks the various services to be imported by each component, and tracks the various services exported by each component. At runtime, rather than at compile time, the various interrelations between the components are bound using the service import and export data. Accordingly, depending on the components available and their characteristics, the bindings may differ. This permits applications to be much more flexible. In one implementation, the binding is performed iteratively. For example, if after one iteration of binding service imports to service exports, some components may expand the services that they export, or the services that they desire to import. | 08-13-2009 |
20090210856 | EFFICIENT COMPRESSION OF APPLICATIONS - In one embodiment, a method for inserting advertising into an application includes removing first application code from a first input executable file and placing it into an output executable file, wherein the first application code represents code part of the application. Then a first set of proxies is inserted into the first input executable file, wherein the first set of proxies, when run, makes calls to the first application code. Second application code is added into the output executable file, wherein the second application code represents code executable to display the advertising. The output executable file is compressed. Then, the first input executable file and the output executable file are provided to a device such that the device may load and execute the files. | 08-20-2009 |
20090217238 | INCORPORATING STATE MACHINE CONTROLS INTO EXISTING NON-STATE MACHINE ENVIRONMENTS - A computer program product for incorporating state machine controls into existing non-state machine environments includes a tangible storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method. The method includes determining a state machine representation for an existing environment, assigning state indicators to each state of the state machine, transcoding existing software flags of the environment into modifier values associated with the state indicators, assigning state values based on the modifier values and the state indicators, assigning event identifiers for transitions from the state values, and creating a tabular representation of the determined state machine, the tabular representation providing next state information based on the event identifiers and the state values. | 08-27-2009 |
20090249291 | Method To Transfer Annotation Across Versions of the Data - A method, apparatus, and article are provided for managing migration of annotations between versions of source code. Annotations associated with patterns of source code are identified. A comparison of the modified source code is conducted in conjunction with the identified annotations in a prior version of the source code to determine if the annotations may be migrated to any portions of the modified source code. The comparison includes an exact match and a partial match. With respect to the partial match, a threshold value is employed to define the parameters of a partial match. All annotations that are determine to be an exact match or a partial match are automatically migrated to a location in the modified source code determine to match within the threshold value. | 10-01-2009 |
20090259989 | LAYERED STATIC PROGRAM ANALYSIS FRAMEWORK FOR SOFTWARE TESTING - A method for analyzing a set of potential bug statements in source code. The method including obtaining a set of static program analyses; recursively reducing the set of potential bug statements in the source code by: selecting a static program analysis for each recursion from the set of static program analyses in order from least time consuming to most time consuming; evaluating the set of potential bug statements using the static program analysis of the set of static program analyses to determine a subgroup of bug free statements of the set of potential bug statements in each recursion; and removing the subgroup of the bug free statements from the set of potential bug statements to reduce the set of potential bug statements in each recursion; thereby filtering at least one subgroup of bug free statements out of the set of potential bug statements in the source code. | 10-15-2009 |
20090282387 | SYSTEM AND PROGRAM PRODUCT FOR PROVIDING COMPUTING-ENVIRONMENT CONTROL OF A RESOURCE TO BE ACCESSED BY PROGRAM CODE - A system and program product for facilitating computing-environment control of a resource to be accessed by existing program code is provided which includes transparently replacing an uncontrolled resource referenced by existing program code with a resource controlled by a computing environment. The protocol also includes transparently interposing at least one resource management service of the computing environment between the existing program code and the resource controlled by the computing environment, wherein the at least one resource management service provides computing-environment control of the resource to be accessed by the existing program code. The replacing of the uncontrolled resource prevents the existing program code from directly accessing the resource. | 11-12-2009 |
20090288066 | EDITING APPARATUS AND METHOD FOR TEST DRIVEN DEVELOPMENT - An editing apparatus for Test Driven Development (TDD) includes: a design model manager for managing a design model; a test code manager for managing test code; an implementation code manager for managing implementation code; and a TDD synchronization manager, as the design model or the test code is altered, for altering the test code or the design model in synchronization with the design model or the test code, and selectively altering the implementation code. | 11-19-2009 |
20090293041 | SOFTWARE PROTECTION THROUGH INTERDEPENDENT PARAMETER CLOUD CONSTRAINED SOFTWARE EXECUTION - Methods and a tool or instrument for performing the methods of protecting a computer program with a parameter cloud are disclosed. A parameter cloud comprising a plurality of elements may be created. Called functions of a computer program may have defined expected parameter cloud states so that proper behavior of the called function is achieved when the parameter cloud state is the expected parameter cloud state. An expected parameter cloud state may include a selected set of elements of the parameter cloud having assigned values. Static portions of the called functions may depend on a current parameter cloud state, and calling functions may transform the parameter cloud state prior to calling their respective called functions. The methods and instrument may operate on original source code or post-binary targets of the computer program. A fingerprint may be used to identify a specific computer program from a sequence of state transitions. | 11-26-2009 |
20090293042 | APPARATUS, METHOD, AND SYSTEM OF ASSISTING SOFTWARE DEVELOPMENT - An apparatus, method, and system of assisting a user in the process of developing software having a function to access a web service are disclosed. A determination result is generated, which indicates whether an operation test of determining whether the software under development properly operates should be performed by a first test module or a second test module. Based on the determination result, the operation test is performed by a selected one of the first test module and the second test module. | 11-26-2009 |
20090307656 | Optimized Scalar Promotion with Load and Splat SIMD Instructions - Mechanisms for optimizing scalar code executed on a single instruction multiple data (SIMD) engine are provided. Placement of vector operation-splat operations may be determined based on an identification of scalar and SIMD operations in an original code representation. The original code representation may be modified to insert the vector operation-splat operations based on the determined placement of vector operation-splat operations to generate a first modified code representation. Placement of separate splat operations may be determined based on identification of scalar and SIMD operations in the first modified code representation. The first modified code representation may be modified to insert or delete separate splat operations based on the determined placement of the separate splat operations to generate a second modified code representation. SIMD code may be output based on the second modified code representation for execution by the SIMD engine. | 12-10-2009 |
20090307657 | SYSTEM AND METHOD FOR ARRAY OBFUSCATION - Disclosed herein are systems, methods, and computer readable-media for obfuscating array contents in a first array, the method comprising dividing the first array into a plurality of secondary arrays having a combined total size equal to or greater than the first array, expanding each respective array in the plurality of the secondary arrays by a respective multiple M to generate a plurality of expanded arrays, and arranging data elements within each of the plurality of expanded arrays such that a data element located at an index I in a respective secondary array is located at an index I*M, wherein M is the respective multiple M in an associated expanded array, wherein data in the first array is obfuscated in the plurality of expanded arrays. One aspect further splits one or more of the secondary arrays by dividing individual data elements in a plurality of sub-arrays. The split sub-arrays may contain more data elements than the respective secondary array. The principles herein may be applied to single dimensional or multi-dimensional arrays. The obfuscated array contents may be accessed via an index to the first array which is translated to retrieve data elements stored in the plurality of expanded arrays. | 12-10-2009 |
20090319988 | SOFTWARE OPTIMIZATION DEVICE AND SOFTWARE OPTIMIZATION METHOD - A software optimization device includes performance data storage unit to store data indicating performance of each system call, corresponding to a plurality of system calls, system call extraction unit to extract a system call described in a program source and similar-system-call detection unit to detect, from among the system calls the data indicating the performance of which is stored in the performance data storage unit, a system call having a function similar to that of the system call extracted by the system call extraction unit and having a performance better than that of the extracted system call. | 12-24-2009 |
20090327997 | Timing Analysis of Concurrent Programs - Described are various techniques by which a concurrent program is analyzed with respect to timing. In one aspect, code fragments in a concurrent program are modified and/or instrumented by inserting iteration counters inside loops. Examples of modified fragments include those corresponding to concurrently executing code fragments, non-blocking concurrent code fragments, blocking concurrent code fragments, fragments having a loop that may not terminate, fragments having interlocked operation, or fragments having a timeout. Such fragments are modified and/or flagged so as to provide the summary data. When statically analyzed, the instrumented code provides complexity information regarding each fragment, or combinations of fragments, such as concurrent fragments. Summary data regarding the concurrent program is provided by processing the complexity information into at least one computation graph. | 12-31-2009 |
20100011341 | METHOD, SYSTEM, AND APPARATUS FOR DYNAMICALLY INJECTING LOGGING STATEMENTS INTO WEB 2.0 JAVASCRIPT APPLICATIONS - A Method, System and Apparatus for dynamically injecting logging statements into Web 2.0 JavaScript applications includes a single block of JavaScript code configured to execute on a client device by loading a profiler JavaScript code into memory on the client device and registering a target JavaScript object. The profiler JavaScript code is configured to dynamically scan the user-defined JavaScript code and modify the functions to add events to a modified user-defined code which include an identification of when the function was called, when the function was exited and when an exception occurs. The modification module is wrapped into a try/catch block so that exceptions can be handled and posted back to the server or displayed to the user or developer. | 01-14-2010 |
20100023925 | System and method for transforming hierarchical objects - A method and system for transforming a first object into a second object, comprising: receiving the source and second objects; subject to the objects being of attribute type, copying, the value of the source object to the second object; subject to the objects being of node type which comprises, for each member of the second object: locating a corresponding member having a corresponding name in the source object; and invoking the method for the member and the corresponding member; subject to the objects being of list type, the source object adapted to contain elements of a first type and the second object adapted to contain elements of a second type, for each element of the source object: creating a corresponding default element of the second type; and invoking the method for the element and the corresponding default element; and invoking a user-implemented transformation routine. | 01-28-2010 |
20100083222 | Development of Networked Applications - Mashup creation, through the reuse and combination of existing networking or Web applications, are presented. For example, a method for forming a networked software application on a first computer resource coupled by a network to a client computer of a user includes accessing, within a repository that is part of the first computer resource, a first networked software application part, forming, within the first computer resource, a second networked software application part, and providing the second networked software application part to the repository. The second networked software application part comprises a first element of the first networked software application part. The steps of accessing, forming and providing are performed using the first computer resource comprising the repository. The first and the second networked software application parts remain on the first computer resource, and separate from the client computer, during the forming of the second networked software application part. | 04-01-2010 |
20100083223 | COMPILATION MODEL - The claimed subject matter provides a system and/or method that facilitates creating executable code for an industrial environment. A language editor can enable a programming of a portion of data within a programming language. A compiler can compile the portion of data within the programming language. An assembler component can utilize an intermediate language to convert the portion of data into a portion of assembly object code, wherein the assembly object code is target independent. A linker can create a binary file from the portion of assembly object code, wherein the binary file is target independent. A loader can specifically tailor the binary file to a target resource by leveraging at least one PLC definition, wherein the loader creates a target executable code (TEC) program at runtime or at development time. | 04-01-2010 |
20100083224 | METHOD OF MODIFYING CODE OF A RUNNING COMPUTER PROGRAM BASED ON SYMBOL VALUES DISCOVERED FROM COMPARISON OF RUNNING CODE TO CORRESPONDING OBJECT CODE - In a method of modifying code of a running computer program so as to modify the running computer program without having to restart the running computer program for changes to the running computer program to take effect, the improvement is disclosed of: (a) comparing differences in the running program's running binary code versus object code produced by compiling the running program's source code and (b) using the results of step (a), determining what values to use for symbols in said changes to the program. The compiling may be performed using either the compiler originally used to compile the running program or a different compiler. A data storage medium having instructions stored therein for a computer to perform the improved method is also disclosed. | 04-01-2010 |
20100088673 | Optimized Code Generation Targeting a High Locality Software Cache - Mechanisms for optimized code generation targeting a high locality software cache are provided. Original computer code is parsed to identify memory references in the original computer code. Memory references are classified as either regular memory references or irregular memory references. Regular memory references are controlled by a high locality cache mechanism. Original computer code is transformed, by a compiler, to generate transformed computer code in which the regular memory references are grouped into one or more memory reference streams, each memory reference stream having a leading memory reference, a trailing memory reference, and one or more middle memory references. Transforming of the original computer code comprises inserting, into the original computer code, instructions to execute initialization, lookup, and cleanup operations associated with the leading memory reference and trailing memory reference in a different manner from initialization, lookup, and cleanup operations for the one or more middle memory references. | 04-08-2010 |
20100095271 | Fine-Grained Software-Directed Data Prefetching Using Integrated High-Level and Low-Level Code Analysis Optimizations - A mechanism for minimizing effective memory latency without unnecessary cost through fine-grained software-directed data prefetching using integrated high-level and low-level code analysis and optimizations is provided. The mechanism identifies and classifies streams, identifies data that is most likely to incur a cache miss, exploits effective hardware prefetching to determine the proper number of streams to be prefetched, exploits effective data prefetching on different types of streams in order to eliminate redundant prefetching and avoid cache pollution, and uses high-level transformations with integrated lower level cost analysis in the instruction scheduler to schedule prefetch instructions effectively. | 04-15-2010 |
20100131924 | METHOD OF BUILDING VIRTUAL KEYBOARD - A method of building and using of a virtual keyboard program that includes programming a virtual keyboard program by a scripting language programming tool is disclosed. The method includes registering an allowable execution action of a web browser to the virtual keyboard, such that the virtual keyboard is capable of being freely executed in the web browser based on scripting language. An event listener is used to monitor inputting actions. | 05-27-2010 |
20100146481 | DEVELOPING APPLICATIONS AT RUNTIME - Data applications may be developed within an integrated development environment comprising an iterative cycle of writing source code, building the source code, running the data application, and testing the data application. The development becomes iterative because the application is torn down, redesigned, rebuilt, and re-executed if the data application is modified. Developing an application at runtime is disclosed herein, which is generally more efficient than conventional iterative techniques. As provided herein, runtime application comprising prebuilt components is presented to a user. The runtime application may be modified through modification gestures. An update assembly may be built based upon the modification gestures. The runtime application may be updated based upon the updated assembly. For example, prebuilt components modified by modification gestures may be torn down, updated with a corresponding update assembly, and reloaded into the runtime application, while the runtime application is in a runtime state. | 06-10-2010 |
20100153914 | SERVICE RE-FACTORING METHOD AND SYSTEM - A service re-factoring method and system. The method includes selecting by a computing system, a first service comprising a first name. The computing system receives a second name for a second service to be generated from the first service. The computing system executes a service refactoring software application, adjusts a granularity of the first service, and generates the second service. The computing system retrieves first traceability links associated with the first service and a first value associated with a first service identification technique. The first traceability links are created within the second service. The computing system generates a second value associated with a second service identification technique. The first service, the first name, and the first value are removed from the computing system. The computing system stores the second service, the second name, the second value, and the first traceability link. | 06-17-2010 |
20100153915 | UNIQUE CONTEXT-BASED CODE ENHANCEMENT - Unique context-based code enhancement of the core functionality of standard source code objects is performed at any position in the code. Desired insertion/replacement position(s) input by a user trigger the generation of a unique context for an enhancement. The unique context is based on characteristics of the code in the standard source code objects, such as the statements proximate to the insertion/replacement position(s). The unique context is associated with one or more extension source code objects that, when integrated into the existing source code at the insertion/replacement position(s), will provide the enhancement. At compile-time, the unique context used to unambiguously locate the insertion/replacement position(s). The extension source code objects can include industry or customer extensions, add-ons, plug-ins, and the like. | 06-17-2010 |
20100162209 | Embedding Software Developer Comments In Source Code Of Computer Programs - Computer-implemented methods, apparatus, and products for embedding software developer comments in source code of computer programs that includes receiving, by a software development application from a software developer, a location in source code of a computer program at which to insert a multimedia annotation, the multimedia annotation including software developer comments; and inserting, at the location in the source code, by the software development application, a hyperlink including a URL specifying a storage location for the multimedia annotation. | 06-24-2010 |
20100169861 | ENERGY/PERFORMANCE WITH OPTIMAL COMMUNICATION IN DYNAMIC PARALLELIZATION OF SINGLE-THREADED PROGRAMS - A method and apparatus for optimizing parallelized single threaded programs is herein described. Code regions, such as dependency chains, are replicated utilizing any known method, such as dynamic code replication. A flow network associated with a replicated code region is built and a minimum cut algorithm is applied to determine duplicated nodes, which may include a single instruction or a group of instructions, to be removed. The dependency of removed nodes is fulfilled with inserted communication to ensure proper data consistency of the original single-threaded program. As a result, both performance and power consumption is optimized for parallel code sections through removal of expensive workload nodes and replacement with communication between other replicated code regions to be executed in parallel. | 07-01-2010 |
20100175046 | METHOD AND DATA PROCESSING SYSTEM FOR COMPUTER-ASSISTED PERFORMANCE ANALYSIS OF A DATA PROCESSING SYSTEM - A method is disclosed for the computer-assisted performance analysis of a data processing system, wherein a program code with a plurality of code parts is running. During the execution of at least one embodiment of the method, one or more parts of the code parts are at least varied once while using a functionality creating a variance in regard to at least one criterion to be evaluated. The data processing system is executed with the varied code part and parts multiple times. A variance of the at least one criterion to be evaluated of the varied code part or parts, or of all code parts of the program code is determined. Finally, a covariance resulting from the variance is subjected to a multivariant analysis. | 07-08-2010 |
20100180255 | PROGRAMMABLE FRAMEWORK FOR AUTOMATIC TUNING OF SOFTWARE APPLICATIONS - A target application is automatically tuned. A list of solutions for identified performance bottlenecks in a target application is retrieved from a storage device. A plurality of modules is executed to compute specific parameters for solutions contained in the list of solutions. A list of modification commands associated with specific parameters computed by the plurality of modules is generated. The list of modification commands associated with the specific parameters is appended to a command sequence list. The list of modification commands is implemented in the target application. Specific source code regions corresponding to the identified performance bottlenecks in the target application are automatically tuned using the implemented list of modification commands. Then, the tuned target application is stored in the storage device. | 07-15-2010 |
20100186001 | METHOD AND APPARATUS FOR NATIVE METHOD CALLS - A method and apparatus for a native method call. The method comprises: generating, in response to a native method call-associated event, a template copy from a generic template for processing the native method call; filling information required for processing the native method call in corresponding locations in the template copy; and changing a code execution flow to execute the template copy. When a native method is called, the native method is processed by dynamically inserting the template copy in the execution path at the assembly level. | 07-22-2010 |
20100235811 | Promotion of a Child Procedure in Heterogeneous Architecture Software - A method for promotion of a child procedure in a software application for a heterogeneous architecture, wherein the heterogeneous architecture comprises a first architecture type and a second architecture type, comprises inserting a parameter representing a parallel frame pointer to a parent procedure of the child procedure into the child procedure; and modifying a reference in the child procedure to a stack variable of the parent procedure to include an indirect access to the parent procedure via the parallel frame pointer. | 09-16-2010 |
20100275181 | CONVERSION OF A CLASS ORIENTED DATA FLOW PROGRAM TO A STRUCTURE ORIENTED DATA FLOW PROGRAM - System and method for converting a class oriented data flow program to a structure oriented data flow program. A first data flow program is received, where the first data flow program is an object oriented program comprising instances of one or more classes, and wherein the first data flow program is executable to perform a first function. The first data flow program is automatically converted to a second data flow program, where the second data flow program does not include the instances of the one or more classes, and where the second data flow program is executable to perform the first function. The second data flow program is stored on a computer memory, where the second data flow program is configured to be deployed to a device, e.g., a programmable hardware element, and where the second data flow program is executable on the device to perform the first function. | 10-28-2010 |
20100275182 | Knowledge Extraction and Transformation - The present disclosure includes a system and method for learning (or discovering and extracting) business knowledge from a collection of source code. The collection of source code is abstracted to generate an abstracted data stream, which is then transformed to an Extensible Markup Language (XML) format. The transformed data in XML format can be further converted to target formats or processed to satisfy different needs such as software system documentation, migration, impact analysis and security analysis. The disclosure also includes an implementation and operation for a pattern abstraction engine configured to receive an input data stream and format it for abstraction into a standard format using a pattern matching mechanism. The disclosure also includes an implementation and operation for a contextual pattern decoder engine configured to extract knowledge attributes and contextual taxonomy from classified blocks of an input data stream. | 10-28-2010 |
20100281463 | XML based scripting framework, and methods of providing automated interactions with remote systems - A method of creating an XML based framework to perform automated forecasting includes sending a file from a local host computer to a remote computer, receiving a file at the local host computer from the remote computer, installing the received file on the local host computer, and executing commands on the local host computer and the remote computer. Executing a command on the remote computer includes reading a run file and a host definition file. A framework for interacting between the local host computer and the remote computer is determined based on types of XML tags, the XML tags including at least one of a start of a tag, end of a tag, and text between the start of a tag and the end of a tag. Computer program products for creating an XML based framework to perform automated forecasting are also described. | 11-04-2010 |
20100287532 | METHOD AND SYSTEM FOR INTEGRATING MULTIPLE SCRIPTS - A method of testing the server implementation of the Domain Name System protocol by using a first body of computer code in a first programming language capable of sending and receiving DNS requests, and a second body of computer readable code in a second programming language capable of generating DNS requests and verifying responses. The second programming language may be tailored to writing code being capable of generating Domain Name System requests and verifying the response thereby allowing the program to be efficiently reconfigured to test different aspects of the server. | 11-11-2010 |
20100306737 | Techniques for Providing Environmental Impact Information Associated With Code - A technique for providing environmental impact information associated with code includes determining, based on execution of the code on a computer system, an environmental impact of a code execution sequence included in the code. A section of the code that is associated with the code execution sequence is then annotated with environmental impact information associated with the environmental impact of the code execution sequence. | 12-02-2010 |
20110035726 | IDENTIFYING SOURCE CODE ELEMENTS FOR REFACTORING - A solution for identifying build errors associated with a source code file for determining source code elements for refactoring. An embodiment of the invention utilizes a source code management system in combination with build logs generated by a build environment to determine source code elements that would benefit from refactoring. | 02-10-2011 |
20110035727 | UNDO/REDO ARCHITECTURE ACROSS MULTIPLE FILES - Editing operations are monitored for operations for which information must be stored in order to properly apply an undo or undo/redo sequence to plurality of files. A snapshot is taken and persisted before such an operation is performed. Upon the execution of an undo or redo command, the persisted snapshot is retrieved and applied to the newly generated editing element. | 02-10-2011 |
20110078656 | Code Edit Apparatus and Recording Medium - Each of first programs stored in a recording medium causes a computer to execute each specific type of edit process. A second program stored in the recording medium causes the computer to execute the following steps. A first step is a step of acquiring first information for designating a program file and an area to be edited and second information for designating the first program. A second step is a step of causing the computer to execute the process of editing the binary code of the area designated by the first information via the first program designated by the second information. | 03-31-2011 |
20110083118 | REVERSE ENGINEERING FOR CODE FILE REFACTORIZATION AND CONVERSION - A system comprises a processing device, a data store selectively connected to the processing device and configured to store a plurality of segments of a software application, and a code refactoring application included on the processing device. The code refactoring application may include instructions that when executed cause the processing device to receive at least a subset of the segments of the software application from the data store, determine a design structure for the segments based at least in part on the received segments, and refactor the segments into a refactored segment according to the determined design structure. | 04-07-2011 |
20110099534 | INFORMATION PROCESSING APPARATUS, EXECUTION PROGRAM OPERATION MODIFICATION METHOD, AND RECORDING MEDIUM - A disclosed information processing apparatus capable of modifying an operation of an execution program includes an instruction information receiving unit that receives instruction information from an execution environment; an instruction information interpreting unit that interprets a position and execution contents in a source program from the received instruction information; an instruction information executing unit that refers to debug information including a corresponding relationship between the source program and an execution program main body, specifies a position in the execution program main body, the position corresponding to the interpreted position in the source program, and modifies the specified position in the execution program main body based on the interpreted execution contents; and an execution program main body unit that starts execution of the execution program after processes of the instruction information receiving unit, the instruction information interpreting unit, and the instruction information executing unit have been completed. | 04-28-2011 |
20110107297 | SYSTEMS AND METHODS FOR RESOURCE LEAK DETECTION - Systems and methods for detecting resource leaks in a program using static analysis are disclosed. Dynamically adjustable sets of must-access paths can be employed for aliasing purposes to track resources intra- and inter-procedurally through a program. Actionable reports are also disclosed, in which resource leaks are prioritized, filtered and clustered to improve utility. | 05-05-2011 |
20110154290 | METADATA PLUG-IN APPLICATION PROGRAMMING INTERFACE - Computer-based methods and systems for editing a time-based media program involve receiving an instruction to associate metadata with a selected portion of the program, determining a type of the metadata, wherein the type of the metadata is one of a predetermined set of metadata types, identifying a software component available to the editing system that is configured to process metadata of the determined type, and associating the metadata with the selected portion of the program by executing the identified software component to process the metadata. Metadata is represented using a scheme that is shared among the various computational components that manipulate the metadata; the scheme may also be shared with a host media processing system, as well as with other systems that are used in a time-based media editing and production workflow. | 06-23-2011 |
20110185341 | OPTIMIZING BOUNDS CHECKING USING COMPUTER ALGEBRA - Some embodiments of the present invention provide techniques and systems for optimizing bounds-checking During operation, the system can receive one or more instructions which when executed evaluate a first expression whose value is required to be between a lower bound expression's value and an upper bound expression's value, such that at least one of the following three values is not determinable before execution: the first expression's value, the lower bound expression's value, and the upper bound expression's value. Next, the system can use computer algebra to determine whether the first expression's value is guaranteed to be between the lower bound expression's value and the upper bound expression's value. If the system determines that the first expression's value is not guaranteed to be between the lower bound expression's value and the upper bound expression's value, the system can add bounds-checking instructions to the one or more instructions. | 07-28-2011 |
20110219356 | CONFLICT RESOLUTION IN APPLICATIONS - A method, a system and computer program product for resolving conflicts in applications are disclosed, A first set of instructions configured to use a second set of instructions is identified during execution of a program having the first set of instructions. A third set of instructions couples the first set of instructions to the second set of instructions. I Incompatibility between the first set of instructions and the second set of instructions is identified, in response to compiling the first set of instructions and compiling the second set of instructions. A mechanism is provided for the third set of instructions to modify the second set of instructions, which result in a modified second set of instructions compatible with the first set of instructions. | 09-08-2011 |
20110225564 | Cross-Module Inlining Candidate Identification - Routines which are likely to be good candidates for cross-module inlining are automatically identified according to criteria based on service history, compiler inlining criteria, and/or execution performance criteria. Candidates can also be automatically identified by pattern matching codes of routines which satisfy service history, execution performance, and/or compiler criteria. Automatically identified candidate routines are presented in an inlining advisory tool, allowing developers to approve/veto automatically identified candidates, to add other routines, and to either suggest or require that the development tools perform cross-module inlining with particular routines. Changes to a candidate routine can trigger regeneration of native image(s) into which the routine has been compiled. | 09-15-2011 |
20110252401 | SUPPORTING AND DEPLOYING DISTRIBUTED COMPUTING COMPONENTS - Methods and systems consistent with the present invention provide an improved software development tool that generates code corresponding to a distributed computing component, and verifies and corrects compliance of the code. In some embodiments, the improved software development tool verifies compliance of the code with a specification for the distributed computing component, and corrects any non-compliant portions of the code, using methods and systems consistent with the present invention. | 10-13-2011 |
20110296376 | Dynamically Injecting Behaviors Into Flex View Components - Systems, methods and articles of manufacture for dynamically injecting behaviors into view components are described herein. In an embodiment, a view component resides in an MXML file, while its behavior code (e.g., ACTIONSCRIPT) is stored in a separate file (e.g., .as file). In this way, the view component can be reused in separate applications where different behaviors may be applied to the same view component. In addition, because the behavior code is stored in a separate file, the behavior code is easier to read and maintain. Furthermore, behaviors can be dynamically (i.e., at runtime) injected into and un-injected from the view component. Embodiments of the invention also allow multiple behaviors to be injected into the same view component. | 12-01-2011 |
20110314446 | METHOD AND SYSTEM FOR SELECTIVELY COPYING PORTIONS OF A DOCUMENT CONTENTS IN A COMPUTING SYSTEM (SMART COPY AND PASTE - An improved method for generating text by using snippets of existing text and providing a command structure allowing a user to cut and paste from existing text. | 12-22-2011 |
20110314447 | MULTI-INSTANCE "SHADOW" SYSTEM AND METHOD FOR AUTOMATED RESOURCE REDUNDANCY REDUCTION ACROSS DYNAMIC LANGUAGE APPLICATIONS UTILIZING APPLICATION OF DYNAMICALLY GENERATED TEMPLATES - A system and method are provided that allows, by adding a loadable module to the language runtime engine and overriding some of the core engine's operating system access functionality, the system to create a customizable copy of the installed application without creating complete copies of the actual files (scripts, executables, binaries, etc.) and without redundancies in content storage. | 12-22-2011 |
20120060146 | Automatic Application Tuning - According to an embodiment, a method of automatically tuning a software application is provided. The method includes modifying the execution of the software application using a first parameter, and scoring the first parameter based on a log value from the software application and an improvement goal. Next, the first parameter, the score of the first parameter and the log value is stored in a data store. The first parameter is then combined with a selected parameter retrieved from the data store, resulting in a second parameter. The listed steps are repeated until a criteria is met, and when the criteria is met, tuning results are generated based on the parameters, the log values and the improvement goal. | 03-08-2012 |
20120089962 | Unchanged Object Management - A method includes, using a static analysis performed on code, analyzing the code to determine a set of unchanged objects and modifying the code to exercise a singleton-pattern technique for one or more members of the set of unchanged objects. The method also includes outputting the modified code. Apparatus and program products are also disclosed. Another method includes accessing code from a client, and in response to any of the code being source code, compiling the source code into object code until all the code from the client comprises object code. The method further includes, using a static analysis performed on the object code, analyzing the object code to determine a set of unchanged objects and modifying the object code to exercise a singleton-pattern technique for one or more members of the set of unchanged objects. The method additionally includes returning the modified object code to the client. | 04-12-2012 |
20120096431 | METHOD AND APPARATUS FOR PROVIDING ADVERTISING DURING APPLICATION LOADING PROCESSES - A method and system in which a loading process of an application is controlled to present still or moving imagery such as advertisements, public service messages and the like to a user waiting for the application to load on a user device. Reporting and/or transacting mechanisms are provided to facilitate a business model between any of advertisement vendors (which supply the advertisements), application vendors (which adapt their code to display the advertisements) and advertising servers (which update user device advertisements and collect statistical data supporting the various transactions). | 04-19-2012 |
20120096432 | Adding Funtionality To Existing Code At Exits - New code is added to existing object code in order to add new functionality. For example, a call to start a profiler function can be added at the beginning of a Java method and a call to stop the profiler function can be added at the exits of the Java method. A method may have many different exits. To insure that the profiler process is stopped regardless of which exit is performed, the byte code and exception table are modified. | 04-19-2012 |
20120102454 | SOFTWARE DEVELOPMENT - A method, system and computer program product for developing software in which the software comprises a plurality of programs. A change to a program is received. A data structure checking procedure may then be invoked. The changed program is parsed for a reference to a data structure. Other instances of the data structure are located in other programs within the software. The referenced data structure is compared to the located other instances of the data structure. A predefined action (such as notifying a programmer or correcting the inconsistencies) is performed in response to any detected differences between the referenced data structure and the located other instances of the data structure. These steps are repeated for all data structures within the changed program. | 04-26-2012 |
20120117536 | METHODS AND APPARATUS FOR SUB-ASSET MODIFICATION - Methods and apparatus for on-the-fly identification of sub-asset modifications in a data pipeline are described. | 05-10-2012 |
20120131549 | SYSTEMS AND METHODS FOR AUTOMATICALLY OPTIMIZING HIGH PERFORMANCE COMPUTING PROGRAMMING LANGUAGES - Systems and methods for replacing inferior code segments with optimal code segments. Systems and methods for making such replacements for programming languages using Message Passing Interface (MPI) are provided. For example, at the compiler level, point-to-point code segments may be identified and replaced with all-to-all code segments. Programming code may include X10, Chapel and other programming languages that support parallel for loop. | 05-24-2012 |
20120144366 | REFACTOR EXCEPTION CLASS HIERARCHY FOR REDUCED FOOTPRINT AND FASTER APPLICATION START - A method, system, and program product for removing exception classes that match a pattern is disclosed. Exception classes are searched for those of the exception classes that match that pattern. The parent classes of matched exception classes are refactored to accept an exception type argument. Code that throws the matched exceptions is rewritten by replacing the exception class with the parent class and adding a corresponding exception type. Code that catches the thrown exceptions is rewritten by changing a catch clause to catch a parent exception class and inserting a case statement for the exception type in that catch clause. The matched exception classes are removed. | 06-07-2012 |
20120167040 | IDENTIFYING SOURCE CODE ELEMENTS FOR REFACTORING - A solution for identifying build errors associated with a source code file for determining source code elements for refactoring. An embodiment of the invention utilizes a source code management system in combination with build logs generated by a build environment to determine source code elements that would benefit from refactoring. | 06-28-2012 |
20120210297 | Virtual Typing Executables - A method for modifying a computer program. According to one embodiment, a new value to replace a value associated with a virtual type in a computer program is received. The new value is received during execution of the computer program by a processor unit. The replacement of the value by the new value modifies the computer program while the computer program is executed by the processor. | 08-16-2012 |
20120222001 | PROGRAM CREATION SUPPORT DEVICE - A program creation support device includes a program component creating, upon a user setting a content of a reuse parameter corresponding to each program element, a program in accordance with the set content, and a program component holding unit editing the program by reuse of that. The program component includes a program element creating, upon a plurality of parameters being enumerated and set in the reuse parameter, a program in which a plurality of elements corresponding to respective parameters are combined. The program creation support device can reduce efforts in the selection and combination of program components for creating a program conforming to predetermined specifications, to thereby enhance the efficiency of creating a program. | 08-30-2012 |
20120227029 | METHOD FOR CODE TRANSFORMATION SUPPORTING TEMPORAL ABSTRACTION OF PARAMETERS - A method of code transformation supporting temporal abstraction of parameters is provided herein. The method includes the following stages: extracting a set of statements from an original code and further creating a residual code being the original code without the statements, wherein two or more of the extracted statements are not on a same loop in the original code; adding conditions from the original code to the extracted set of statements, such that the added conditions are sufficient to render the set of statements executable; adding statements from the original code to the residual code, such that the added statements are sufficient to render the residual code executable; and adding code portions and variables to the set of statements and the residual code, such that a passing of values between the enhanced set of statements and the residual code maintains a respective passing of values in the original code. | 09-06-2012 |
20120240101 | SYSTEM, METHOD AND PROGRAM PRODUCT FOR CORRECTING SEMANTIC ERRORS IN CODE USING PEER SUBMITTED CODE SNIPPETS - A method, system and/or program product corrects semantic errors in code in an integrated development environment. The method includes inputting, using a code editor, code being developed in an integrated development environment. One or more nodes, in a syntax tree constructed for inputting the code, are identified as containing semantic errors pertaining to use of a third-party library. A primary executable code snippet and a secondary code snippet for correcting the semantic errors are displayed. If execution of the primary code snippet does not correct the semantic errors, then the secondary code snippet is automatically executed. | 09-20-2012 |
20120272212 | METHOD FOR INSERTING CODE INTO .NET PROGRAMS AND APPARATUS THEREFOR - The present invention discloses a method for inserting code into .Net program and an apparatus therefor, relating to the field of information security. The method comprises the steps of: writing information of code to be inserted to import table of a .Net executable file; adding address of the code to be inserted to import address table (IAT) of the .Net executable file to form a new import address table; change offset address of entry point of the .Net executable file to address of the new IAT; and change flag in header of metadata table of the .Net executable file to enable the .Net executable file to meet certification requirements when being executed. The apparatus comprises a writing module, a forming module, and a modification module. The method and apparatus provided by the present invention implement code insertion into .Net executable file without the dependency on assembly and disassembly tools and are easy to use. The problems of low efficiency, poor stability, and poor compatibility in inserting code into .Net executable file can be solved by the present invention. | 10-25-2012 |
20120272213 | DYNAMIC GENERATION OF FORMATTED USER INTERFACES IN SOFTWARE ENVIRONMENTS - Methods and systems for selecting multiple entities of a model or models to set or change data of the multiple entities together in a modeling environment are disclosed. When users create or edit a model or models, information on the entities of the model or models is provided to the users so that the users can select multiple entities in the model or models. On the selection of the multiple entities in the model or models, the modeling environment dynamically generates a user interface for the selected entities of the model or models for displaying, setting or changing data of the selected entities together. The user interface may display data of the selected entities that is not common to all of the selected entities in a different manner so that the users can identify common data of the selected entities. | 10-25-2012 |
20120284688 | SYSTEM AND METHOD FOR BLURRING INSTRUCTIONS AND DATA VIA BINARY OBFUSCATION - Disclosed herein are systems, methods, and non-transitory computer-readable storage media for obfuscating a computer program. A system configured to practice the method identifies a set of executable instructions at a first location in an instruction section of the computer program and identifies a second location in a data section of the computer program. Then the system moves the set of executable instructions to the second location and patches references in the computer program to the set of executable instructions to point to the second location. The instruction section of the computer program can be labeled as _TEXT,_text and the data section of the computer program is labeled as _DATA,_data. The set of executable instructions can include one or more non-branching instructions optionally followed by a branching instruction. The placement of the first and second locations can be based on features of a target computing architecture, such as cache size. | 11-08-2012 |
20120291010 | DETERMINATION OF A SET OF CANDIDATE CODE INSERTIONS FOR INSERTION IN PROGRAM CODE - A code assistance feature provides a user with a set of suggested program code insertions at a given point in the program code being edited. For example, in response to a user command, the feature identifies syntactically correct possible insertions derived from a search for insertions of a compatible type. The feature identifies members in the set of possible code insertions that can be expanded via a field dereference or subroutine call to provide further possible code insertions for selection by the user. | 11-15-2012 |
20120297361 | CONFIGURATION MANAGEMENT SYSTEM FOR SOFTWARE PRODUCT LINE DEVELOPMENT ENVIRONMENT - A system that includes: a configuration management system configured to receive resource updates submitted by developers of a product line; an update monitor configured, in manual monitoring, to mark each submitted resource update with respective variability data specified as relevant to the update submission, by the developer; and a tracer configured, in automatic monitoring, to trace portions of the updated resource into respective features or products of the product line, to determine variability data relevant to the update submission, wherein when an update request is initiated by the developer, the configuration management system is configured to associate the submitted resource updates with the update request based on common variability data, to provide resource updates on demand, based on variability data, wherein in automatic update, the configuration management system is configured to notify developers on resource updates, based on variability data common to the updated resource and the notified developers. | 11-22-2012 |
20120297362 | EDITING SOURCE CODE - A method for editing source code includes receiving a modification to the source code made by a user, determining whether the modification would change the semantics of the source code, and handling the modification depending on the result of the determining. | 11-22-2012 |
20120304149 | Editor with Commands for Automatically Disabling and Enabling Program Code Portions | 11-29-2012 |
20120317545 | SYSTEMS AND METHODS FOR PROVIDING FEEDBACK FOR SOFTWARE COMPONENTS - Systems and methods for transforming applications to provide uniform mechanisms for commenting on application objects, and mechanisms for collecting and processing feedback are described herein. An aspect provides for analyzing application code for at least one user action event handler associated with at least one object; and for modifying each at least one user action event handler located within the application code to contain at least one action configured to handle feedback for the associated at least one object; wherein invoking the at least one user action event handler triggers the at least one action configured to handle feedback. Other embodiments and aspects are also described herein. | 12-13-2012 |
20120324424 | SOFTWARE ACCESSIBILITY TESTING - According to exemplary embodiments, method and systems for software accessibility testing are provided. Aspects of the exemplary embodiments include: obtaining accessibility information on content of a graphical user interface (GUI) of software under test, wherein accessibility information is content of the GUI for which describing text is available or content of the GUI which is accessible by keyboard use; determining content of the GUI which should not be available in a test due to a lack of accessibility information; restricting the GUI to restrict access to the content not available; and providing the restricted GUI to a user for testing. | 12-20-2012 |
20120331445 | Unchanged Object Management - Apparatus and program products are disclosed. Using a static analysis performed on code, the code is analyzed to determine a set of unchanged objects and modifying the code to exercise a singleton-pattern technique for one or more members of the set of unchanged objects. The modified code is output. Another technique includes accessing code from a client, and in response to any of the code being source code, compiling the source code into object code until all the code from the client comprises object code. Using a static analysis performed on the object code, the object code is analyzed to determine a set of unchanged objects and the object code is modified to exercise a singleton-pattern technique for one or more members of the set of unchanged objects. The modified object code is returned to the client. | 12-27-2012 |
20130074035 | SOURCE CODE COMPARISON DEVICE, SOURCE CODE COMPARISON METHOD AND SOURCE CODE COMPARISON PROGRAM - A source code comparison device includes a difference extraction portion extracting a difference between a source code before correction and the source code after correction, a syntax analysis portion dividing the extracted difference into divided differences which are portions corresponding to components usable in the source code, and generating a syntax analysis result having associated the divided difference with the component corresponding to the divided difference, a feature analysis portion setting a feature division for each of the divided differences included in the syntax analysis result, and an output portion outputting a comparison result having associated the divided difference with the feature division set for the divided difference. The feature analysis portion sets the feature division associated with the component in a correction history for the divided difference associated with the component in the syntax analysis result. | 03-21-2013 |
20130086550 | REORGANIZATION OF VIRTUALIZED COMPUTER PROGRAMS - In an embodiment, a data processing method comprises obtaining access to computer program code; identifying a plurality of code segments in the computer program code; reorganizing the computer program code into reorganized code, by re-ordering the plurality of code segments into a new order that is potentially different than an original order of the plurality of code segments; wherein the new order is unpredictable based on the original order; rewriting one or more pointers of the reorganized code to point to new locations in the reorganized code consistent with the order of the reorganized code; wherein the method is performed by one or more computing devices. | 04-04-2013 |
20130152042 | AUTOMATED AND HEURISTICALLY MANAGED SOLUTION TO QUANTIFY CPU AND PATH LENGTH COST OF INSTRUCTIONS ADDED, CHANGED OR REMOVED BY A SERVICE TEAM - Embodiments of the present invention provide a method, system, and computer program product for qualifying changes to an instruction set in source code. In an embodiment of the invention, a method for quantifying changes to an instruction set in source code can be provided. The method can include receiving text in a code editor as an edit to source code of a computer program querying a data store of code change costs with at least a portion of the edit. The method additionally can include retrieving in response to the query a code change cost associated with the edit. Finally, the method can include displaying in the code editor the retrieved code change cost. | 06-13-2013 |
20130152043 | METHODS AND SYSTEMS FOR GENERATING TEST INFORMATION FROM A SOURCE CODE - Systems and methods for generating test information from a source code are described. One of the methods includes accessing the source code. The method further includes receiving a modification of the source code to generate a modified source code. The modification includes one or more instructions that do not affect functions performed by executing the source code. The modification further includes one or more instructions for generating test information regarding each executable line of the source code. | 06-13-2013 |
20130185696 | MANIPULATING SOURCE CODE PATCHES - A computerized apparatus, a computer-implemented method and a computer program product for manipulating source code patches. The apparatus comprising a processor that is configured to: obtain a source code patch comprising plurality of source code modification instructions with respect to a source code and to automatically split the source code patch into plurality of sub-patches, wherein applying the plurality of sub-patches on the source code in an order is equivalent to applying the source code patch. | 07-18-2013 |
20130227521 | VALIDATION OF APPLICATIONS FOR GRAPHICS PROCESSING UNIT - The techniques described in this disclosure are directed to validating an application that is to be executed on a graphics processing unit (GPU). For example, a validation server device may receive code of the application. The validation server device may provide some level of assurance that the application satisfies one or more performance criteria. In this manner, the probability of a problematic application executing on the device that includes the GPU may be reduced. | 08-29-2013 |
20130232468 | SYSTEMS, METHODS, AND COMPUTER-READABLE MEDIA FOR FERTILIZING MACHINE-EXECUTABLE CODE - Disclosed herein are systems, computer-implemented methods, and non-transitory computer-readable storage media for obfuscating code, such as instructions and data structures. Also disclosed are non-transitory computer-readable media containing obfuscated code. In one aspect, a preprocessing tool (i.e. before compilation) identifies in a source program code a routine for replacement. The tool can be a software program running on a computer or an embedded device. The tool then selects a function equivalent to the identified routine from a pool of functions to replace the identified routine. A compiler can then compile computer instructions based on the source program code utilizing the selected function in place of the identified routine. In another aspect, the tool replaces data structures with fertilized data structures. These approaches can be applied to various portions of source program code based on various factors. A software developer can flexibly configure how and where to fertilize the source code. | 09-05-2013 |
20130247000 | DYNAMIC SYNTHESIS OF PROGRAM SYNCHRONIZATION - Dynamic synthesis includes receiving a program P and a specification S that describes desired properties of P. The dynamic synthesis also includes initializing a constraint C to true, enumerating schedules up to a defined limit that satisfy C, and executing a schedule of P. The dynamic synthesis further includes determining whether execution of the schedule violates S. In response to determining that the execution violates S, the dynamic synthesis includes determining whether to avoid future executions of the schedule. In response to determining that future executions of the schedule should be avoided, the dynamic synthesis includes computing a constraint that avoids the future execution, and adding the constraint to C; otherwise, the dynamic synthesis includes selecting another schedule for execution. In response to determining that the execution of the schedule does not violate S, the dynamic synthesis includes selecting another schedule for execution. | 09-19-2013 |
20130247001 | DYNAMIC SYNTHESIS OF PROGRAM SYNCHRONIZATION - Dynamic synthesis includes receiving a program P and a specification S that describes desired properties of P. The dynamic synthesis also includes initializing a constraint C to true, enumerating schedules up to a defined limit that satisfy C, and executing a schedule of P. The dynamic synthesis further includes determining whether execution of the schedule violates S. In response to determining that the execution violates S, the dynamic synthesis includes determining whether to avoid future executions of the schedule. In response to determining that future executions of the schedule should be avoided, the dynamic synthesis includes computing a constraint that avoids the future execution, and adding the constraint to C; otherwise, the dynamic synthesis includes selecting another schedule for execution. In response to determining that the execution of the schedule does not violate S, the dynamic synthesis includes selecting another schedule for execution. | 09-19-2013 |
20130247002 | ABSTRACTING BENEFIT RULES FROM COMPUTER CODE - A method that includes: obtaining a computer code usable to process insurance claims; building a computer readable directed graph representing a control flow of the code, by identifying decisions and actions in the code, the graph comprising nodes connected by edges, some of the nodes being decision nodes associated with the decisions and some of the nodes being action nodes associated with the actions; determining, on the graph, benefit action nodes that are each associated with at least one monetary outcome of a specified insurance claim; identifying all logic paths that lead to each benefit action node by traversing the graph from each benefit action node backwards, each logic path comprising a sequence of preceding decision nodes and action nodes connected by edges, each set of paths being associated with a specified benefit action node representing a benefit rule; and outputting all benefit rules by presenting each specified benefit action vis à vis grouped logic paths associated with the specified benefit action. | 09-19-2013 |
20130254741 | SOFTWARE SETTINGS MANAGEMENT TOOL - A software settings management tool is described that automates much of the process of checking, changing, creating and/or maintaining software settings. The software settings management tool provides users and/or administrators with user-friendly interfaces to view, modify and save all of their software settings (perhaps thousands of settings, extracted from thousands of proprietary software files) all in one place, while the underlying methods and routines of the software settings management tool handle the complex and error-prone tasks of managing modifications of proprietary files and ensuring that added and changed settings are installed correctly. | 09-26-2013 |
20130305219 | APPARATUS AND METHOD FOR PROVIDING CUSTOM SOFTWARE, AND METHOD FOR SOFTWARE CUSTOMIZATION - The apparatus for providing custom software: transmits a core code to a terminal to be used for software customization by using the core code divided into a plurality of lines; receives a custom code corresponding to a software customization result from the terminal; and stores software information separated from the core code after extracting the custom software information including content altered in the coed code from the custom code. | 11-14-2013 |
20140007046 | INITIALIZATION SAFETY | 01-02-2014 |
20140007047 | INITIALIZATION SAFETY | 01-02-2014 |
20140007048 | MODIFYING PRE-EXISTING MOBILE APPLICATIONS TO IMPLEMENT ENTERPRISE SECURITY POLICIES | 01-02-2014 |
20140019935 | AUTOMATED APPLICATION GENERATION - A modification method and system. The method includes retrieving by a computer processor of a computing system a list of features and plug-ins associated with an application. The features include features version metadata and the plug-ins include plug-ins version metadata. The computer processor compares features source code associated with the features with previous versions of associated source code. The computer processor generates modified features version metadata associated with the features version metadata. The modified features version metadata includes updated version labels differing from previous version labels of the previous versions of associated source code. The features are assembled into an application. | 01-16-2014 |
20140047413 | Developing, Modifying, and Using Applications - Among other things, a continuous framework is provided with which users can interact, on one or more platforms that support web standards, and which supports: (a) the hosting of applications, (b) the publication of hosted applications to a portal within the framework, and (c) the creation and direct editing of files, including text files, that embody those applications and conform to web standards. | 02-13-2014 |
20140053129 | Parallelization of Dataflow Actors with Local State - Processing a dataflow program by a program development tool includes analyzing an actor defined by the dataflow program to identify original sequences of actions that can be reformulated to achieve greater execution parallelism while maintaining the same functionality as the original sequences. A processed dataflow program is produced comprising processed dataflow program instructions and decision point program instructions. The processed dataflow program instructions comprise alternative sequences of reformulated actions that achieve greater execution parallelism while maintaining the same functionality as the identified one or more original sequences. The decision point program instructions direct processing equipment to select and execute one or more of the alternative sequences of reformulated actions, wherein selection is based on state and token information in existence at the time of selection. When more than one alternative sequence can be selected, selection of sequence with highest parallelism is preferred. | 02-20-2014 |
20140053130 | DETERMINING CORRECTNESS CONDITIONS FOR USE IN STATIC ANALYSIS - An embodiment comprising a method is associated with static analysis of a program, which detects violations of conditions of the program correctness specification. The method includes selectively encoding the program and adding one or more correctness conditions to the encoded program, wherein the added conditions comprise a set of assumptions that render the program correct with respect to one or more properties pertaining to detected violations. The set of assumptions are reported to a program user, together with a request to the user to verify the validity of each assumption of the set. | 02-20-2014 |
20140053131 | AUTOMATIC ASYNCHRONOUS OFFLOAD FOR MANY-CORE COPROCESSORS - Methods and systems for asynchronous offload to many-core coprocessors include splitting a loop in an input source code into a sampling sub-part, a many integrated core (MIC) sub-part, and a central processing unit (CPU) sub-part; executing the sampling sub-part with a processor to determine loop characteristics including memory- and processor-operations executed by the loop; identifying optimal split boundaries based on the loop characteristics such that the MIC sub-part will complete in a same amount of time when executed on a MIC processor as the CPU sub-part will take when executed on a CPU; and modifying the input source code to split the loop at the identified boundaries, such that the MIC sub-part is executed on a MIC processor and the CPU sub-part is concurrently executed on a CPU. | 02-20-2014 |
20140068554 | Identifying a Defect Density - A technique to determine defect density in a portion or subset of code. Changes to code may be tracked. Defects in the code that are addressed by the changes may also be tracked. A defect density in a portion or subset of the code having a characteristic can be determined by identifying changes modifying the portion or subset of the code and that address a defect. | 03-06-2014 |
20140143755 | SYSTEM AND METHOD FOR INSERTING SYNCHRONIZATION STATEMENTS INTO A PROGRAM FILE TO MITIGATE RACE CONDITIONS - A system and method are provided for inserting synchronization statements into a program file to mitigate race conditions. The method includes reading a program file and determining one or more convergent statements in the program file. The method also includes inserting one or more synchronization statements in the program file between the determined convergent statements. The method further includes removing one or more of the inserted synchronization statements and writing the modified program file. The method may include, after removing the inserted synchronization statements, identifying to a user any remaining inserted synchronization statements. | 05-22-2014 |
20140157229 | Streamlining Hardware Initialization Code - According to one embodiment of the present disclosure, hardware initialization code and error action information are retrieved from separate storage areas. The hardware initialization code includes code that initializes a device, and also includes placeholders corresponding to actions that are performed when the device fails initialization. Likewise, the error action information describes the actions that are performed when the device fails initialization. The error action information is converted into macros that include lines of code. As such, the error action placeholders are matched to the macros and, in turn, each of the error action placeholders is replaced with the lines of code corresponding to the matched macros. | 06-05-2014 |
20140157230 | Streamlining Hardware Initialization Code - According to one embodiment of the present disclosure, hardware initialization code and error action information are retrieved from separate storage areas. The hardware initialization code includes code that initializes a device, and also includes placeholders corresponding to actions that are performed when the device fails initialization. Likewise, the error action information describes the actions that are performed when the device fails initialization. The error action information is converted into macros that include lines of code. As such, the error action placeholders are matched to the macros and, in turn, each of the error action placeholders is replaced with the lines of code corresponding to the matched macros. | 06-05-2014 |
20140157231 | Modifying a Middleware - The present disclosure discloses a method and apparatus for modifying a middleware shared by multiple tenants by preparing a data packet comprising modification information and tenant information, the modification information comprising information of a specific class to be modified in the middleware as well as modification content for the specific class, the tenant information indicating a specific tenant of the plurality of tenants to which the modification content is directed; and in response to acquisition of the data packet: modifying the specific class in the middleware in runtime according to the modification information to create a modified specific class; and applying the modified content only to the specific tenant. When multiple tenants share a same middleware, different versions of the middleware may be provided for respective tenants, without affecting the use by other tenants, thereby satisfying sharing and customization requirements of each of the multiple tenants. | 06-05-2014 |
20140157232 | Method and Apparatus for Detecting Code Change - The present invention provides a method and an apparatus for detecting a code change. The method includes adding a tag to a function to be changed in a source code, and compiling the source code to acquire, according to the tag, position information and relocation information of the function to be changed in the compiled source code. In embodiments of the present invention, a tag is added to a function to be changed, a source code is compiled into a binary file, and position information and relocation information of the function to be changed in the binary file are acquired by using the tag, so that in subsequent operations, a hot patch file modifies, according to the position information and the relocation information, the function to be changed in software. | 06-05-2014 |
20140165029 | REPLACING ANNOTATED PROGRAM CODE IN A NETWORKED COMPUTING ENVIRONMENT - An approach for replacing one program code library (or method(s) thereof) with another program code library (or method(s) thereof) during execution is provided. Specifically, an annotation (e.g., comprising a runtime optimization request and associated performance/measurement criteria) within a program code file will be detected, analyzed, and used to monitor/assess the performance of a running set of methods of the program code file or the like (e.g., a set of initial/original methods). As this is occurring, a set of substitute methods will be identified from a program code library (e.g., based on similarities to the original set of methods) and likewise monitored/assessed. Based on the monitored performance, one or more alternate method(s) may be substituted for the original method(s) in the program code file. Such a capability allows for methods to be evaluated during runtime, and for performance to be optimized by utilizing the highest performing methods. | 06-12-2014 |
20140165030 | METHODS AND APPARATUS FOR CORRELATION PROTECTED PROCESSING OF DATA OPERATIONS - A method and an apparatus for receiving a first source code having a code block to update the first source code with multiple copies of the code block to protect against correlation attacks are described. The code block can perform one or more operations for execution based on the first source code. The operations can be performed via a random one of the copies of the code block. A second source code based on the updated first source code can be generated to be executed by a processor to produce an identical result as the first source code. | 06-12-2014 |
20140189640 | Native Language IDE Code Assistance - An embodiment of the invention provides a method including receiving input from a user interface, wherein the input includes the name of a code segment in a first language. A database is queried with the name of the code segment in the first language to identify the name of the code segment in a second language different from the first language. The database includes names of code segments in a plurality of languages. The name of the code segment is displayed in the second language and/or the name of the code segment in the first language is replaced with the name of the code segment in the second language. | 07-03-2014 |
20140189641 | CONTINUOUS DEPLOYMENT SYSTEM FOR SOFTWARE DEVELOPMENT - Examples of a continuous deployment system are provided that manage and track releases of software code, where some or all of the steps between check-in and deployment to production can be automated. Such systems can reduce the amount of developer effort needed to deploy a package, as developers may not have to be responsible for scheduling package builds, clicking deployment buttons, or manually running tests. The system can take care of all or some of that work. | 07-03-2014 |
20140196007 | SYSTEM AND METHOD FOR COMPUTATIONAL UNIFICATION OF HETEROGENEOUS IMPLICIT AND EXPLICIT PROCESSING ELEMENTS - A system and method for computational unification of heterogeneous implicit and explicit processing elements which supports the aggregation of any number of such processing elements. The system and method of the present invention supports the generation of a unified executable program through the use of directive statements which are analyzed in conjunction with the semantic structures in the parsed source code to generate appropriate source code targeted to the implicit and explicit processing elements. The computational unification system and method of the present invention further embodies expertise with the particular programming style and idiom of the various processing elements. | 07-10-2014 |
20140237447 | METHOD FOR PROGRAMMING LANGUAGE DEPENDENT MERGING OF PROGRAM CODES - Method executed by a computer for automatically merging changes applied to a first modified program code of a program code and to a second modified program code of the program code, both modified program codes being electronically coded and comprising one or more items, the items being items of a specific programming language; the method comprising the steps of determining from each of the program code, the first modified program code and the second modified program code a respective data structure by programming language dependent parsing of the program code, the first modified program code and the second modified program code, thereby obtaining a syntax information of the program code and the first and second modified program code; determining a first data structure difference between the data structure of the program code and the data structure of the first modified program code by comparing items X | 08-21-2014 |
20140282380 | METHOD AND APPARATUS FOR ENABLING AGILE DEVELOPMENT OF SERVICES IN CLOUD COMPUTING AND TRADITIONAL ENVIRONMENTS - Prepending a name object or setting a type of a software object to a name and prepending a value object to the software object provides inheritance of a name value pattern by the software object to establish particular types or classes of attributes of the software object without modification of the software object itself that is thus strongly typed and accessible by type. | 09-18-2014 |
20140282381 | DEVICE AND METHOD OF INCREASING DYNAMICALLY-TYPED SOFTWARE EFFICIENCY - According to an aspect of an embodiment, a method of increasing efficiency of a software program may include executing a software program that is developed based on a dynamically-typed programming language. The method may also include determining, during execution of the software program, type information for variables included in the software program. Additionally, the method may include generating a modified software program based on the software program and the type information and distributing the modified software program. | 09-18-2014 |
20140282382 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR ALTERING A LINE OF CODE - A system, method, and computer program product are provided for altering a line of code. In use, a line of code is identified, where the line of code is written utilizing both a programming language and one or more syntax extensions to the programming language. Additionally, the line of code is altered so that the altered line of code is written using only the programming language. Further, the altered line of code is returned. | 09-18-2014 |
20140282383 | Techniques for Providing Environmental Impact Information Associated With Code - A technique for providing environmental impact information associated with code includes determining, based on execution of the code on a computer system, an environmental impact of a code execution sequence included in the code. A section of the code that is associated with the code execution sequence is then annotated with environmental impact information associated with the environmental impact of the code execution sequence. | 09-18-2014 |
20140298288 | DIGITAL ITEM INGESTION PROCESS - Disclosed are various embodiments for an ingestion process modifying digital items. A computing system receives an uploaded digital item configured to communicate with a testing server application when executed. The ingestion process reconfigures the digital item to communicate with a production server application when executed. | 10-02-2014 |
20140351788 | RENAMING INSTANCES OF AN ENTITY IN A CODING ENVIRONMENT - Exemplary embodiments provide computer-implemented methods, computer-readable media, and systems for changing the identifier associated with an entity, such as a variable or function, in a portion of code. During editing, a reference may be maintained that identifies the location of each instance of the entity in the code. When the identifier associated with one instance of the entity is changed, the change in the identifier may be propagated throughout the code to change each instance of the identifier in the code. The identifier may be changed without interrupting the workflow of the user and without the need to change to a separate refactoring mode. In some embodiments, a syntactical analysis may be performed and some or all instances of the identifier may be changed based on one or more rules. | 11-27-2014 |
20140359571 | METHOD AND APPARATUS FOR DYNAMIC DOCUMENT OBJECT MODEL (DOM) AWARE CODE EDITING - A computer implemented method and apparatus for dynamic Document Object Model (DOM) aware code editing. The method comprising storing, in a DOM model, a plurality of Document Object Model (DOM) elements in one or more HyperText Markup Language (HTML) files for a project; and storing, in the DOM model at least one modification to the DOM that results from execution of one or more JavaScript code files for the project, wherein during JavaScript code editing, the at least one modification to the DOM identifies an interaction between the JavaScript code and the DOM elements. | 12-04-2014 |
20140372976 | SYSTEM AND METHOD FOR AUTOMATICALLY MODIFYING SOURCE CODE TO ACCOMMODATE A SOFTWARE MIGRATION - A system for automatically modifying source code to accommodate a software migration receives a software codebase a software codebase that supports international classification of diseases, ninth revision (ICD-9) codes and that contains a plurality of lines of source code, receives a codebase impact assessment report identifying each impacted line of the plurality of lines of source code in the codebase, each impacted line requiring modification in order to support migration from ICD-9 codes to international classification of diseases, tenth revision (ICD-10) codes, and automatically modifies the codebase by modifying each impacted line of source code identified in the codebase impact assessment report so that the modified codebase supports migration from ICD-9 codes to ICD-10 codes. | 12-18-2014 |
20140372977 | Modifying a Middleware - A method for modifying a middleware shared by multiple tenants by preparing a data packet comprising modification information and tenant information, the modification information comprising information of a specific class to be modified in the middleware as well as modification content for the specific class, the tenant information indicating a specific tenant of the plurality of tenants to which the modification content is directed; and in response to acquisition of the data packet: modifying the specific class in the middleware in runtime according to the modification information to create a modified specific class; and applying the modified content only to the specific tenant. When multiple tenants share a same middleware, different versions of the middleware may be provided for respective tenants, without affecting the use by other tenants, thereby satisfying sharing and customization requirements of each of the multiple tenants. | 12-18-2014 |
20140380271 | SYSTEMS AND METHODS FOR INCREMENTAL SOFTWARE DEVELOPMENT - Methods and systems for facilitating incremental software development are disclosed. For example, a method can include receiving a plurality of binary software libraries sufficient for building a software project. A request from a user to modify source code for at least one of the plurality of binary libraries is received. In response to receiving the request, the source code for the at least one of the plurality of binary libraries is retrieved. The source code for the at least one of the plurality of binary libraries is presented to the user. Modified source code for the at least one of the plurality of binary libraries is received. The modified source code is compiled to produce compiled modified code. A revised version of the software project is built using the compiled modified code and the plurality of binary libraries. | 12-25-2014 |
20150026660 | METHODS FOR BUILDING APPLICATION INTELLIGENCE INTO EVENT DRIVEN APPLICATIONS THROUGH USAGE LEARNING, AND SYSTEMS SUPPORTING SUCH APPLICATIONS - Certain example embodiments relate to application intelligence gathering systems and/or methods, e.g., in connection with Event Driven Applications and/or the like. More particularly, certain example embodiments relate to the effective recording of application evolution and usage information for usage learning and/or event auditing purposes. With respect to usage learning, certain example embodiments may help to capture data on the usage patterns and/or apply learning algorithms that work on the captured data to provide required intelligence to the application. With respect to event auditing, certain example embodiments may help to identify the “who”, “what”, “when”, “where”, “how”, and/or “why” of particular operations. Application intelligence optionally may be used in determining application “hotspots” or commonly used features that could help in areas such as application maintenance, performance tuning, and/or the like. | 01-22-2015 |
20150046901 | DYNAMIC CLASS LOADING - Approaches are described for loading code on an electronic device by altering the behavior of an application's classloader. The application can be received at an application store, and the application can be injected with code. The application can be downloaded from the application store and installed on the portable computing device or other device, and in response to starting the application, the injected code can be configured to select classes or other application code, and modify a classpath associated with the application to reference the selected classes or application code. | 02-12-2015 |
20150089471 | INPUT FILTERS AND FILTER-DRIVEN INPUT PROCESSING - Input filters correlate to target components. For a given target component, the input filter defines input validation information. The input filter might also define conversions or transformations to be applied to valid input prior to being provided to the target component. At build time, code is accessed that contains the input validation, conversion and transformation and that identifies the associated target component. The information is then used to construct an input filter. At run time, when an input processing component receives an input, the input processing component identifies the target component, accesses the associated input filter, and uses the information contained in the input filter to determine whether the input is valid, and whether and how to convert and transform the value. | 03-26-2015 |
20150095884 | AUTOMATED TEST RUNS IN AN INTEGRATED DEVELOPMENT ENVIRONMENT SYSTEM AND METHOD - A method, computer program product, and computer system for editing code, by a computing device, via an integrated development environment. The code is determined to be syntactically valid. While editing the code, a subset of automated tests associated with the code is executed in response to determining that the code is syntactically valid. It is determined whether at least one automated test error is detected. The at least one automated test error is reported. | 04-02-2015 |
20150121336 | SCREEN-ORIENTED COMPUTING PROGRAM REFACTORING - Techniques for refactoring a screen-oriented computing program are described herein. The techniques include a method that identifies screens of the computing program, and determines a starting point of the computing program based on the identified screens. The techniques include refactoring the computing program based on the starting point and the identified screens. | 04-30-2015 |
20150128107 | COMPILER GENERATION OF THUNKING CODE - A computer system receives a source code comprising an annotation, wherein the annotation is associated with a portion of the source code and wherein the annotation indicates a first bit-width. The computer system identifies a first data type of the portion of the source code. The computer system receives compatibility information corresponding to the first data type, the compatibility information indicating at least one compatible bit-width of the first data type. The computer system modifies the source code to insert a first code segment. | 05-07-2015 |
20150128108 | COMPILER GENERATION OF THUNKING CODE - A computer system receives a source code comprising an annotation, wherein the annotation is associated with a portion of the source code and wherein the annotation indicates a first bit-width. The computer system identifies a first data type of the portion of the source code. The computer system receives compatibility information corresponding to the first data type, the compatibility information indicating at least one compatible bit-width of the first data type. The computer system modifies the source code to insert a first code segment. | 05-07-2015 |
20150363172 | AUTOMATED MODIFICATION INTEGRATION AND CONFLICT RESOLUTION FOR SOFTWARE DEVELOPMENT - Proposed changes to a source code generated by client computing devices are integrated with a master version of the code resident on a server computing system remote from the client devices. The client devices connect to the server system over a network and transmit proposed changes to the server system, where resident integration/conflict resolution software automatically integrates the proposed changes into the master version. Any unresolved conflicts remaining after the automatic integration are identified and the server system automatically sends an email notifying the one or more client devices that there are unresolved conflicts. The email includes a link that enables a client device to launch a window on a monitor, and the client device user employs the window to transmit commands directly to and receive further communications directly from the integration/conflict resolution software in an interactive operation to attempt to manually resolve the conflicts. | 12-17-2015 |
20150378687 | AUTOMATED CODE PARSER FOR REVIEWING AUTOMATION SCRIPTS - Automation scripts may be examined and compared to a set of new or changed operating system messages to identify potential issues with the automation script that occur with updates to the operating system. When the issue is identified, the reference in the automation script may be updated to refer to the changed operating system message. Further, the reference in the automation script may be modified to address other changes in the system messages, such as changes in information and/or parameters reported in the message. | 12-31-2015 |
20150378689 | APPLICATION INSTANCE STAGING - The present invention discloses an application instance staging method and apparatus. The method comprising: obtaining a list of functional services bound to an application program; determining a buildpack corresponding to the bound functional service; and performing, by the determined buildpack, application instance staging of the application program. With the technical solution according to embodiments of the invention, an application program can be automatically extended during application instance staging, such that it can interact with the bound service. | 12-31-2015 |
20150378690 | APPLICATION INSTANCE STAGING - An application instance staging method comprises installing a runtime environment for an application program pushed to a cloud client; installing dependency of the application program; reading an environment variable of the application program to identify a functional service bound to the application program; modifying the application program based on the functional service bound to the application program; and packaging the modified application program, runtime environment, and dependency into an executable droplet. | 12-31-2015 |
20160041826 | ADAPTATION OF A WEB APPLICATION FOR USE BY A MOBILE DEVICE - Client side code of a web application can be received by a mobile device. The mobile device can automatically inject mobile aware code into the client side code of the web application. The mobile aware code can modify the client side code of the web application for use by the mobile device, wherein the client side code of the web application is not modified for use by the mobile device prior to the mobile aware code being injected. The client side code of the web application modified by the mobile aware code can be executed by the mobile device. | 02-11-2016 |
20160062741 | MOBILE DEVELOPMENT PLATFORM IN A CLOUD BASED ARCHITECTURE - Embodiments are directed towards mobile application development in a cloud-based architecture. Mobile applications may be designed to communicate with a cloud platform over a network. Mobile application developers may be enabled to submit cloud code to cloud platforms for use by mobile applications. If cloud code is provided to a cloud platform, the cloud platform may perform one or more actions to authenticate the cloud code, such as, ensuring that that the user providing the cloud code is authorized to provide the cloud code. If the cloud code is authenticated the cloud platform may perform one or more actions to validate the cloud code. If validated, the cloud code may be activated for use by mobile applications and/or mobile application developers. Activation of the cloud code may include associating the cloud code with one or more function calls and/or with one or more trigger points. | 03-03-2016 |
20160070543 | User corrections in translation - Techniques that enable correction of inaccurate or inappropriate words and phrases users can find in a translated program, without requiring undue efforts by those users to contact the programmers with that information. A program user can communicate back to the programmer, with the effect that the user is able to inform the programmer of any inaccurate or inappropriate words or phrases that user has found in a translated program. The technique for communication does not require the user to know where, or even who, the programmer is. Users can edit the words displayed by the program, replacing mistranslated words or phrases with replacements that are more accurate or more appropriate. Users' edits that are agreed to by multiple users can each have a “vote” count associated therewith, so the programmer can determine the vox populi for that translation. | 03-10-2016 |
20160170717 | ASSOCIATION OF PROGRAM CODE AND APPLICATION FEATURES | 06-16-2016 |
20160196116 | Method and Apparatus for Detecting Code Change | 07-07-2016 |
20160202956 | RESOURCE CLOSING | 07-14-2016 |