Abstract: In an embodiment a software application may include a “baseline trace” indicating proper application execution. The baseline trace may include counts for various types of instructions (e.g., how many times each of a LR instruction and a MV instruction occurs during an execution of code). The finished application includes the baseline trace. Upon execution the application randomly selects which of the various types of instructions to count during execution (e.g., LR or MV instruction) to produce a “real time trace”. The application executes and produces the real-time trace. The baseline trace is then compared to the real-time trace, which is specific to the randomly chosen type of instruction. If the traces are within a pre-determined range of each other the user has a level of assurance the software is operating correctly. Other embodiments are described herein.

Abstract: Provided are techniques for the tracing of computer processes and, more specifically, to techniques that enable a work unit to be traced across multiple processing components. A data structure is created and associated with a work unit. The first time a unit of work is processed a tracing context is retrieved form a pool and associated with the data structure. As the unit of work is passed from component to component, the data structure is passed so that each component has access and is able to augment the same tracing context associated with the unit of work.

Abstract: Systems and methods for generating a set of event filtering rules for filtering events being produced in response to emulation of a program. A plurality of sample programs is constructed based on a plurality of known program development tools. Emulated execution of the plurality of sample programs is carried out in an isolated virtual machine environment and events occurring in the virtual machine environment as a result of the emulated execution of the plurality of sample programs are recorded in an event log. A set of rules is formulated for distinguishing events from among the event log that are determined to be insignificant with respect to malware detection processing to be performed.

Abstract: A method of developing a tracing solution for the execution of blocks of computer code. The method comprises representing each block of code of an initial tracing solution as a vertex on an initial tracing solution graph. The vertices on the initial tracing solution graph constitute an initial set of vertices. The method further comprises checking whether there are any redundant vertices in the initial set of vertices. Redundant vertices are vertices not needed for a tracing solution. If there are any redundant vertices in the initial set of vertices, one or more of the redundant vertices is eliminated from the initial set of vertices, thereby deriving a reduced set of vertices.

Abstract: Data relating to execution flows at a computer system is aggregated across multiple execution flows by categorizing each execution flow into an execution flow shape. The execution flows may represent sequences of software components that are invoked or other computer system resources that are consumed. The execution flow shapes are developed by observing and recording the execution flows at the computer system and applying lossy compression rules. Execution flows are categorized into an execution flow shape which is a closest match. The execution flow data may be aggregated by an agent at the computer system, and communicated to a manager for subsequent use. The aggregation combines the information from all execution flows into a small enough data set that can be reported without consuming unduly large processing overhead while still preserving as many of the interesting aspects of the execution flows as possible.

Abstract: A computer-readable medium stores computer-executable instructions. The medium may hold: one or more instructions for executing a first code block; one or more instructions for generating an exception object based on the executing of the first code block; one or more instructions for receiving the exception object at a second code block; and one or more instructions for storing the exception object in a memory.

Abstract: A monitoring of a server system during an execution of a server system processing logic, includes: during collection and storage of operational metrics by a given thread in a thread-local memory, determining that a checkpoint within the server system processing logic is reached; determining whether a threshold number of checkpoints have been encountered by the given thread; in response to the threshold number of checkpoints having been encountered, determining whether a threshold time interval since a last rollup of the collected operational metrics has been exceeded; and in response to the threshold time interval being exceeded, performing a rollup of the collected operational metrics from the thread-local memory to an accumulation point in a shared memory, where the accumulation point stores aggregated operational metrics from a plurality of threads.

Abstract: A non-stop debugging environment includes a debugger configured to debug a multi-threaded debuggee, where encountering an event by one of the threads stops execution of only the one thread without concurrently stopping execution of other threads. In such a non-stop debug environment, impact indication of thread-specific events includes tracking, by the debugger, activity associated with a thread-specific event and displaying, by the debugger in a graphical user interface (‘GUI’), an indication of thread-specific event impact in dependence upon the tracked activity.

Abstract: In general, techniques are described for providing thread-level tracing within an operating system kernel. A computing device comprising processes, an operating system and a control unit that executes the operating system may implement the techniques. Each of the processes comprises an instance of an application program. Each of the processes comprises one or more separate threads of instruction execution. The operating system concurrently executes the processes. The control unit traces execution of a system call issued to the operating system by one of the threads currently being executed by the control unit to generate a trace log that traces execution of the system call by the operating system without tracing execution of any other ones of the one or more threads corresponding to those of the plurality of processes that are also being executed by the operating system during execution of the system call.

Abstract: Dynamic determination of affinity between fields of structure may be determined based on accesses to the same instance. The affinity may be utilized in determining a data layout of a structure so as to optimize performance of a target program. The affinity determination may be an estimation based upon a trace of an execution of the target program. Access relation between proximate accesses to fields of the same instance may be utilized to estimate an optimized data layout of the structure.

Abstract: A method for a hybrid code signature including executing, via a processor, an application, the executing comprising executing a root instruction of the application; profiling, via the processor, the executing of the application, the profiling comprising storing a reference signature; determining, via the processor, a working signature of instructions executed subsequent to the executing of the root instruction, the determining comprising implementing a hashing function of the instructions in response to storing the reference signature; tracking the updating of the working signature by storing a value in a counter; and updating continuously, via the processor, the working signature with the hashing function while at least the working signature does not match the reference signature.

Abstract: A debugger can step through target code in a computer program. The debugger can identify a coroutine yield point in the target code, and can obtain identifying information to identify continued processing of a coroutine instance triggered by the operator. The debugger can set a breakpoint at a location for continued stepping after the coroutine yield point. The breakpoint can have a condition of matching the identifying information with runtime information. The debugger can perform the coroutine instance and resume execution of the target code after the coroutine yield point. The debugger can also encounter the breakpoint in the target code, and can determine whether the condition of the breakpoint is met. If so, the debugger can pause execution of the target code at the breakpoint. If not, the debugger can continue execution of the target code past the breakpoint without pausing at the breakpoint.

Abstract: An apparatus includes a processor for executing instructions at runtime and instructions for dynamically compiling the set of instructions executing at runtime. A memory device stores the instructions to be executed and the dynamic compiling instructions. A memory device serves as a trace buffer used to store traces during formation during the dynamic compiling. The dynamic compiling instructions includes a next-executing-cycle (N-E-C) trace selection process for forming traces for the instructions executing at runtime. The N-E-C trace selection process continues through an existing trace-head when forming traces without terminating a recording of a current trace if an existing trace-head is encountered.

Abstract: Static analysis of a computer software application can be performed by applying a first level of abstraction to model a plurality of run-time objects, thereby producing a set of object abstractions. Static data-flow analysis of the computer software application can be performed using the set of object abstractions, thereby producing a first data-flow propagation graph. A data-flow bottleneck can be identified within the data-flow propagation graph. A second level of abstraction can be applied to model any of the run-time objects having in the set of object abstractions a corresponding object abstraction that is traceable to the data-flow bottleneck. The applying the second level of abstraction can decompose the corresponding object abstraction into a set of object abstractions, thereby modifying the set of object abstractions. Static data-flow analysis of the computer software application can be performed using the modified set of object abstractions.

Abstract: Coverage analysis may be performed using reverse time. The coverage analysis may be based on last hit data. The last hit data may comprise a timestamp indicating a last time in which a coverage event was covered. Utilizing last hit data instead of first hit data as is known in the art enables distinction between coverage goals that were never covered and coverage goals that were not covered lately.

Abstract: A testing system, a testing process, a medical device, e.g., an anesthesia device (G), and a computer program product are provided for testing installed program versions for acceptability. The anesthesia device (G) comprises a plurality of electronic components (K), which are operated and/or controlled with a program, which may have various versions. A release function (50) is activated for releasing the anesthesia device (G) or for putting same into operation only if a consistent set of acceptable program versions can be detected, and the anesthesia device (G) is otherwise blocked.

Abstract: A monitoring of a server system during an execution of a server system processing logic, includes: during collection and storage of operational metrics by a given thread in a thread-local memory, determining that a checkpoint within the server system processing logic is reached; determining whether a threshold number of checkpoints have been encountered by the given thread; in response to the threshold number of checkpoints having been encountered, determining whether a threshold time interval since a last rollup of the collected operational metrics has been exceeded; and in response to the threshold time interval being exceeded, performing a rollup of the collected operational metrics from the thread-local memory to an accumulation point in a shared memory, where the accumulation point stores aggregated operational metrics from a plurality of threads.

Abstract: Aspects of the subject matter described herein relate to injecting faults into programs for testing. In aspects, a program is instrumented with instrumentation points. A request that an exception be raised at an instrumentation point is received. In response, a sink is configured to listen for the event associated with the instrumentation point. The sink is further configured to cause the exception to be raised to the program in response to receiving the event. The exception may be raised without modifying code of the program.

Abstract: A method for instrumenting a computer program, the method including identifying a program slice within a computer program, and instrumenting the program slice within the program.

Abstract: Computation execution can be visualized and debugged. A computation such as a database query plan graph can be extracted from a database query expression. Trace points can be injected into the database query expression while preserving original behavior. Query graphs can be generated with automatic inserting of mechanisms to connect to trace points, enabling visualization of query execution lifecycle states, collection of data traces across operators, and historical debugging with replay of data sets.

Abstract: A device receives a test case from a management server. The test case includes a request used for a test of an application, an expected response to the request, and an identifier of an application server that executes the application. The device transmits, based on the identifier, the request to the application server. The device further receives a test response in reply to the request. The device also generates a test result based on the expected response and the test response, and displays the test result.

Abstract: In an information processing apparatus, a program execution section executes a program, and in the stage of execution of a log acquisition command, acquires the value of a variable set in the log acquisition command. A trace log generation section generates a trace log including identification information on a file set in the log acquisition command, version number on a source code, and the acquired value of the variable, and stores the trace log in a storage device. A source code acquisition section acquires a source code corresponding to a combination of the identification information and the version number, based on the trace log. A character string addition section extracts a character string related to the value of the variable included in the trace code, from the acquired source code, adds the extracted character string to the trace log, and stores the trace log in a storage device.

Abstract: A Unified Debugger that enables the debugging of graphical models with combinations of entities from multiple domains such as time-based block diagrams, statecharts, and physical system models, with additional features for the debugging of hand-written and automatically generated code is disclosed. A view of the entity being executed that is consistent with the type of the modeling domain to which the entity currently being executed belongs is automatically generated for a user. Rather than requiring a user to manually transition from one debugger to the next, the Unified Debugger applies the appropriate debugging features from each modeling domain. The Unified Debugger also enables integration of diagnostic information from a multitude of modeling domains into a central user interface. In addition, a standard diagnostic interface which spans a plurality of modeling domains is defined that enables the customization of debug behavior.

Abstract: In a distributed system that includes a debug server and debug clients coupled for data communications through a data communications network, where the debug server includes a debug administrator, a message router, a back-end debugger, and a debuggee, collaborative software debugging includes receiving, from the debug clients, application-level messages, including receiving, from a symbol locking debug client, a request to lock one or more symbols from value modification; routing, by the message router, the application-level messages among the debug clients, the debug administrator, and the back-end debugger, including: establishing a lock for each of the one or more symbols; and returning, to the debug clients, client-specific debug results including, returning, responsive to a request to modify a value of a locked symbol, an indication that the symbol is locked without modifying the value of the locked symbol as requested.

Abstract: Computer-implemented methods, computer program products and computer systems that assess business logic architecture compliance by defining an ideal business logic architecture hierarchy of a desired application, retrieving one or more applications from a data repository, breaking down these applications into a plurality of processes and analyzing the plurality of processes for common inter-application processes. Common inter-application processes are located and store in the middleware layer. The desired application is developed using the applications and common inter-application processes from the middleware layer to provide a resultant application, followed by determining an actual business logic hierarchal structure of the resultant application. This actual business logic hierarchal structure of the resultant application is compared against the ideal business logic architecture hierarchy to calculate compliance thereof, which in turn, reflects the maturity level of the developed resultant application.

Abstract: A computer-implemented method involving detecting a creating or opening of a suppression file presenting a suppression edits, executing an auto complete search in response to input to define a suppressions and storing the suppression file to be utilized with a profiling tool to hide data defined by the suppression file.

Abstract: A debug tool that generates a call stack listing by analyzing the crash memory dump data without relying on register data values. The tool uses information gathered by the compiler and linker when the program was compiled and linked, including the stack's size and location in memory. By examining the stack location in the crash memory dump image in conjunction with the debugging data generated by the compiler and the linker and any existing trace data, the last valid frame may be reconstructed indicating the location of the crash.

Abstract: A processing device executing an application analyzer analyzes a call stack having a plurality of stack frames to identify potential return addresses for the plurality of stack frames. The processing device records a value of each of the potential return addresses and records a location on the call stack for each of the potential return addresses. The processing device then determines which of the potential return addresses are actual return addresses based on debugging information and the recorded locations of the potential return addresses. The processing device generates a stack trace based on the actual return addresses.

Abstract: A method for software debugging in a multi-tenant database network system is provided. When an exception occurs the stack frames in temporary working memory are dumped into long term memory for later analysis. A stack trace is performed from which performance information may be derived, which may aid in discovering the cause of the exception.

Abstract: A scalable, computer implemented method for finding subtle flaws in software programs. The method advantageously employs 1) scope bounding which limits the size of a generated model by excluding deeply-nested function calls, where the scope bounding vector is chosen non-monotonically, and 2) automatic specification inference which generates constraints for functions through the effect of a light-weight and scalable global analysis. Advantageously, scalable software model checking is achieved while at the same time finding more bugs.

Abstract: A program trace is obtained and events of the program trace are traversed. For each event identified in traversing the program trace, a trace slice of which the identified event is a part is identified based on the parameter instance of the identified event. For each trace slice of which the identified event is a part, the identified event is added to an end of a record of the trace slice. These parametric trace slices can be used in a variety of different manners, such as for monitoring, mining, and predicting.

Abstract: A computer system may provide various resources to users through one or more programming libraries, such as application programming interfaces (APIs), in order to standardize access to such resources through various general-purpose mechanisms. These programming libraries may be operated by other programs, such as task-specific user interfaces, through which a user may utilize the programming library without having to understand its structure and functions. However, in many scenarios, a user may wish to know the manner of invoking a programming library to achieve an invoked behavior, or may wish to reproduce the behavior without having to utilize the user interface. A user may therefore capture an invocation of the programming library, and may generate an instruction set representing the captured invocation that may be studied, copied, modified, subsequently performed, etc.

Abstract: A computer implemented software testing method includes receiving a bug report regarding software under test; storing the bug report in a computer readable data store upon receiving the bug report; setting an a status indicator for the bug report to an open condition upon storing the bug report; requesting execution of a test procedure corresponding to the bug report; executing the test procedure using a processor; receiving a test result from the processor indicating a pass state or a fail state for the test procedure; and setting the status indicator for the bug report to a closed condition if the pass state is determined for the test procedure.

Abstract: An electronic device is provided that, in an embodiment, saves a plurality of values for a variable specified by a condition after a respective plurality of encounters of a breakpoint by a program that modifies the variable. One of the plurality of values is selected based on a condition. A determination is made whether to stop execution of the program at the breakpoint based on the one of the plurality of the values. Execution of the program is stopped at the breakpoint if the determining is true. The program is allowed to continue to execute if the determining is false.

Abstract: A computer-implemented method for detecting test similarity between first and second tests for a software system. The computer-implemented method includes receiving data indicative of respective method call sequences executed during each of the first and second tests, generating, with a processor, a similarity score for the first and second tests based on a comparison of the respective method call sequences, and providing, via a user interface, a result of the comparison based on the similarity score.

Abstract: A computer implemented testing methodology employing a scenario-driven modeling of specific instances of bug patterns that commonly occur in concurrent programs which encodes these instances in an SMT-based symbolic analysis. Such modeling and encoding advantageously allow the symbolic analysis framework to focus on real bugs, thereby allowing effective utilization of resources. Experimentation determined a number of previously unknown bugs in public benchmarks and advantageously scenario-specific modeling and encoding improves the scalability of symbolic technique and, therefore, improves overall quality of concurrency testing.

Abstract: A system and method for providing detailed information about how a software application is running has a processor and memory including a shared memory. The method provides an automated way of extracting information from a first software application having a plurality of libraries as the application executes. A special library used to interrogate an execution application is placed in the execution path but does not use I/O resources while it is extracting information about an executing software application. An intercept causes the special library to execute, and information is seamless provided to an output device during execution of the interrogated application.

Abstract: In a method of testing a software item, a graphical user interface is presented for scheduling a test of the software item. Specified information regarding conduct of a test is received via the graphical user interface. The specified information includes a test time for initiating the test. The test is initiated at the test time.

Abstract: A method and information processing system facilitate debugging of a multi-threaded application. A control program request associated with at least one thread of a process that has been designated for debugging is generated. The control program request is placed into a memory buffer associated with the thread by the debugger. The memory buffer is passed to a control program. A plurality of memory buffers is monitored. Each memory buffer in the plurality of memory buffers is associated with a different thread of the process. At least one memory buffer in the plurality of memory buffers is determined to include debugging event information from the control program determining. The debugging event information is processed. The processing includes at least one of notifying a user of the debugging event information and generating at least one control program request for a thread associated with the at least one memory buffer.

Abstract: An aspect of the present invention facilitates identification of test cases to be run after changes to modules of a software application. In one embodiment, a reference data is generated by inspecting the instructions (static analysis) forming the modules of the software application, with the reference data specifying a corresponding set of modules in the application that are referenced by each of the modules in the application. The reference data is then examined to find a referencing set of modules which reference any of the changed modules either as immediate reference or multi-level reference through other modules. Test cases invoking any of the modules in the referencing set are identified as suitable test cases to be run.

Abstract: A unified debug system with multiple user-configurable trace volumes is disclosed, including embodiments as a system, a method, and a computer-readable medium. Embodiments of the present invention provide more robust and flexible solutions for introducing configurable trace volumes to firmware, allowing a user to specify firmware system configurations for trace buffers, trace frames, and trace volumes, and offer other advantages over the prior art. One embodiment of the present invention pertains to a system that includes a firmware component comprising firmware, and a firmware interface communicatively connected to the firmware component. The firmware includes a plurality of trace volumes for storing a plurality of trace entries. The trace volumes are user-configurable through the firmware interface. The plurality of trace volumes includes first, second and third trace volumes. The first trace volume includes storing at least some of the trace entries to a trace buffer in a first volatile memory component.

Abstract: According to one general aspect, a method may include monitoring the execution or at least a portion of a software application. The method may also include collecting subroutine call information regarding a plurality of subroutine calls included by the portion of the software application, wherein one or more of the subroutine calls is selected for detailed data recording. The method may further include pruning, as the software application is being executed, a subroutine call tree to include only the subroutine calls selected for detailed data recording and one or more parent subroutine calls of each subroutine calls selected for detailed data recording.

Abstract: In one embodiment, a method of batch processing electronic data is provided. The method includes identifying one or more batch processing features common to a plurality of batch processing applications. The method also includes defining software code for managing execution of the common batch processing features, integrating the software code into at least one of the batch processing applications, and defining and taking one or more checkpoints. Moreover, the method includes retrieving input data in response to control data, processing at least a portion of the input data, determining the time of an error in response to the error during processing, retrieving data stored at the most recent one of the checkpoints, and processing at least a portion of the retrieved checkpoint data.

Abstract: Disclosed are various embodiments for replication of machine instances in a computing environment. A clone machine instance is instantiated from a machine image associated with an original machine instance. A stored execution state of the original machine instance is applied to the clone machine instance. At least a portion of a series of stored events received by the original machine instance is applied to the clone machine instance.

Abstract: 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.

Abstract: Systems, methods and computer program products may provide monitoring of software performance on a computer. A method of monitoring software performance in a computer may include marking at least one of a load request and a store request, the marked request including an effective instruction address and an effective data address, recording the effective instruction and data addresses in a processor core and sending the marked request to a memory subsystem. The method may also include receiving a fabric response for the marked request, recording the fabric response in the core and tying the effective instruction and data addresses and the fabric response together in a sample.

Abstract: A method, computer program product, and computing device for initiating a first instance of an application to be debugged. A second instance of the application to be debugged is initiated. A common command is simultaneously executed on the first and second instances of the application to be debugged.

Abstract: An event-driven performance measurement technique provides a set of transaction definitions that specify transaction actions that correspond to start and end points of a transaction. Events associated with execution of an application are received by a processor-based machine. The machine uses the events to generate transactions in accordance with the set of transaction definitions. The transactions can be used to evaluate performance of the application.

Abstract: A computer-implemented method, system, and computer program product for detecting and monitoring server side state during the scanning of a web application. The method includes: monitoring executed code of the web application while scanning the web application; retrieving code coverage information from the monitoring of the executed code and retrieving scanning information from the scanning of the web application; correlating the code coverage information with the scanning information; and determining a change in the server side state based on the correlation. The system includes one or more devices that executes the steps of the method. The computer program products includes computer program instructions stored on a computer readable storage medium, where the instructions, when executed, will cause a computer to perform the steps of the methods.

Abstract: A method for allowing license tools to detect the installation of applications that are not physically installed on a machine when an Application Virtualization Environments is used. In one embodiment of the invention, the license tools may further detect application usage. In one embodiment of the invention, a virtual installation signature may be defined. Agents in a target computer may be used to compare the virtual installation signature of an application with a localized list of potential applications to detect whether the software is installed on the target computer.