Abstract: Described herein are various embodiments of computer-implemented tools, systems, and methods for managing debugging of different portions of an application (e.g., front-end and back-end) with different respective debuggers in a manner that facilitates debugging the entire application from within the user interface associated with one of the debuggers (e.g., from within a browser interface). In some embodiments, a debug manager acts as a bridge between a web-browser debugger and a back-end debugger, allowing an application developer to debug web applications without leaving the browser.

Abstract: Methods and a system are provided. A method includes implementing a function, which a compiler for a first language does not have, using a compiler for a second language. The implementing step includes generating, by the compiler for the first language, a first abstract syntax tree. The implementing step further includes converting, by a converter, the first abstract syntax tree to a second abstract syntax tree of the compiler for the second language using a conversion table from data representation types in the first language to data representation types in the second language. When a compilation error occurs, the implementing step also includes generating a special node for error processing in the second abstract syntax tree and storing an error token in the special node. When unparsing, the implementing step additionally includes outputting the error token, in the form of source code written in the first language.

Abstract: In response to identification of an error in operation of a system, a debugging module determines where to set a debug entry point for a program subset debug session. An initial file state is captured for at least one file accessed by the system in response to initiation of a subsequent execution of the system. Prior to detection of execution of the system at the debug entry point, any file inputs and file outputs (I/Os) detected during the subsequent execution of the system are queued. Debug entry point metadata, including the captured initial at least one file state, the queued file I/Os, and an image of all instantiated objects at the debug entry point, is stored in response to detection of execution of the system at the debug entry point.

Abstract: In response to identification of an error in operation of a system, a debugging module determines where to set a debug entry point for a program subset debug session. An initial file state is captured for at least one file accessed by the system in response to initiation of a subsequent execution of the system. Prior to detection of execution of the system at the debug entry point, any file inputs and file outputs (I/Os) detected during the subsequent execution of the system are queued. Debug entry point metadata, including the captured initial at least one file state, the queued file I/Os, and an image of all instantiated objects at the debug entry point, is stored in response to detection of execution of the system at the debug entry point.

Abstract: Technologies are provided for locally installing remotely-served API instances. In some examples, a scale-out service may receive a request to provide an installation of a remotely-served API at a particular datacenter. In response to a determination by the scale-out service that a local instance of the remotely-served API can be installed at that datacenter, the scale-out service may install the local instance and route requests to that API from the datacenter to the local instance instead of the remotely-served API.

Abstract: Embodiments herein are directed to a method for installing a program across multiple memories. The method includes calculating a memory space requirement of the program. It may be determined that a first available memory space in a first memory of the first computer system is smaller than the memory space requirement. The first memory is a default memory for installing the program. Upon determining that the first available memory space in the first memory is smaller than the memory space requirement, the method may perform the step of identifying a second memory in communication with the first computer system that has a second available memory space. The first and second available memory spaces, when combined, are sufficient for the memory space requirement to install files of the program. The files of the program may be installed in the first and second memories.

Abstract: Embodiments herein are directed to a method for installing a program across multiple memories. The method includes calculating a memory space requirement of the program. It may be determined that a first available memory space in a first memory of the first computer system is smaller than the memory space requirement. The first memory is a default memory for installing the program. Upon determining that the first available memory space in the first memory is smaller than the memory space requirement, the method may perform the step of identifying a second memory in communication with the first computer system that has a second available memory space. The first and second available memory spaces, when combined, are sufficient for the memory space requirement to install files of the program. The files of the program may be installed in the first and second memories.

Abstract: Improved techniques involve marking each test case routine written in the source code with test case identifiers that describe that test case routine. Software in a development system parses source code to locate such identifiers and, upon compilation of the source code, generates a report based on those identifiers. Advantageously, the improved techniques ensure that test cases remain current with the source code.

Abstract: An install method executed by an apparatus, including receiving a call from a first program when the first program is activated; and installing a second program that is used by the first program, in response to the call.

Abstract: A method, an apparatus and a computer readable medium for debugging and error prevention are provided. In the method, a plurality of debug messages produced by the electronic apparatus in executing debugging is obtained. The debug messages are analyzed to find a plurality of operation procedures associated with each other and having a number of repeated occurrences reaching a threshold according to data of each debug message when at least one error message appears in the debug messages and accordingly conclude at least one error procedure rule. Then, each debug message obtained afterwards is compared with the operation procedures in each error procedure rule sequentially, so as to determine whether a completion percentage of the operation procedures in each error procedure rule reaches a preset percentage. When the completion percentage reaches the preset percentage, a preventive operation of the operation procedure corresponding to the current debug message is executed.

Abstract: A system for upgrading firmware in multiple units or devices of a building control or automation system. A computer may have a tool that can reflash the firmware with an upgrade. The tool may reflash the firmware of multiple devices automatically without intervention of an operator. Devices having firmware that need an upgrade may be identified and classified as eligible for a firmware upgrade. Devices having firmware similar to firmware in other devices may be grouped with the latter devices for upgrading together, sequentially or in parallel, to simplify and expedite firmware upgrading of the devices. Firmware of devices in the field may be upgraded via a communication network or the like by the computer with the tool. The firmware upgrade, communications and/or associated activity associated with the upgrade may be proprietary and/or secured from public availability.

Abstract: At a time after receiving a request to cancel and rollback an update request for a computer system, one or more computer resources within a computer system invoke one or more computer system capabilities at least to cancel computer system operations to update the computer. When the computer system operations to update the computer system are cancelled, one or more computer resources within a computer system invoke one or more computer system capabilities at least to roll back the computer system to a previous good state.

Abstract: A device is configured to execute a first program block associated with program code, and set a first value of a scoped setting associated with the first program block, the first value of the scoped setting controlling a manner in which a first algorithm is performed during execution of the first program block. The device is configured to detect a change in scope of the program code, the change in scope including execution of a second program block that is different from the first program block, and determine a relationship between the first program block and the second program block. The device is configured to set a second value of the scoped setting based on the relationship, the second value of the scoped setting controlling a manner in which a second algorithm, identified in the second program block, is performed during execution of the second program block.

Abstract: An integrated development environment (IDE)-based approach for processing/analyzing proposed program code libraries as a replacement for existing program code libraries in a networked computing environment is provided. A set of annotations associated with a set of program code files and a proposed (e.g., new, modified, etc.) program code library are received in an integrated development environment (IDE). It may then be determined whether the proposed program code library is an excluded program code library based on the set of annotations. It may also be determined whether the proposed program code library meets one or more thresholds for replacing an existing program code library. If the proposed program code library is not excluded and meets the threshold(s), the proposed program code library may then be provided to a computer device hosting the IDE (e.g., for implementation).

Abstract: Techniques are described for generating text in a structured language, such as source code in a programming language, based on audio input. Audible tokens may be associated with higher-level constructs, including design elements such as methods, classes, design patterns, and so forth. Additionally, audible tokens may be associated with lower-level syntactic constructs of a programming language, such as programming language keywords, tokens, and so forth. Techniques may receive and parse the audio input including the audible tokens, and generate source code output. Techniques may also provide audio information indicating a development context that may otherwise be indicated visually in a development environment.

Abstract: A method is provided for a proxy server to assist in the testing of a product. The method includes receiving, from the product, a first request and passing the first request to a server, receiving, from the server, a first response to the first request and passing the first response to the product, recording the first request and the first response, generating one or more second responses from one or more simulated servers based on the first request and the first response, intercepting a second request from the product, in response to the second request, matching the second request to a second response, and sending the second response to the product.

Abstract: A basic block within a thread program is characterized for convergence based on mapping the basic block to an indicator subnet within a corresponding Petri net generated to model the thread program. Each block within the thread program may be similarly characterized. Each corresponding Petri net is enumerated to generate a corresponding state space graph. If the state space graph includes an exit node with an odd execution count attribute, such as by Petri net coloring, then the corresponding basic block is divergent. The corresponding basic block is convergent otherwise. Using this characterization technique, a thread program compiler may advantageously identify all convergent blocks within a thread program and apply appropriate optimizations to the convergent blocks.

Abstract: A system and a method for providing a core dump-level stack trace. In one example, the method includes receiving, by a processing device, a recorded state of a program, the recorded state including a base address of the program and a stack frame including an executable address for a call instruction of a function of the program; determining, by the processing device, a list of functions in view of the recorded state of the program, and creating, by the processing device, a stack trace in view of the list of functions without using debugging symbols.

Abstract: A non-disruptive upgrade technique involves, with (i) a first SP using first virtual SPs (VSPs) defining first environments for first host file systems, (ii) a second SP using second VSPs defining second environments for second host file systems, and (iii) an initial software version installed on each SP, processing host I/Os on the host file systems by the SPs. The technique further involves moving the first VSPs from the first SP to the second SP to provision the second SP to process host I/Os concurrently on the first and second host file systems using the first and second VSPs. The technique further involves, after moving the first VSPs from the first SP to the second SP and while the second SP processes host I/Os concurrently on the first and second host file systems using the first and second VSPs, installing a new backwards compatible software version on the first SP.

Abstract: Methods, computer program products, and systems for installing an application at a runtime instance. A method includes receiving a request to install an application and accessing data defining shared resources required by the application. Data that defines shared resources already installed at existing runtime instances is accessed. An existing runtime instance with the greatest number of installed shared resources common to the shared resources required by the application is selected. The application is installed at the selected runtime instance.