Abstract: Systems, methods, and computer-readable media are disclosed for generating a test case based on valid function codes that have not been selected for test case generation bypassing. A test program is provided that allows a user to specify, for each instruction, one or more function codes that the user does not want to use to generate a test case (e.g., that should be bypassed). A test stream generator is provided that has knowledge of valid and invalid function codes for any given supported instruction. A test case generator is provided that compares the function codes selected for bypassing to the valid function codes to identify a valid non-bypassed function code, which is used to generate a test case. Systems, methods, and computer-readable media are also disclosed for generating an exception test case using only one or more invalid function codes that have not been selected for bypassing.

Abstract: Aspects of the invention include tracking actions performed by a via a user device, and detecting that the user has made reservations for at least a subset of a first vacation at a first vacation location. Based at least in part on the tracking and detecting, attractions and events related to the first vacation location are extracted. Conditions at the first vacation location and at the extracted attractions and events are monitored. The user is notified of any conditions that may negatively impact the first vacation. In response to a request from the user, an alternative vacation is offered to the user with attractions and events that are similar to the extracted attractions and events. The alternate vacation is at an alternate vacation location different than the first vacation location.

Abstract: Methods, systems and computer program products for providing notifications to drivers based on observed local driver patterns are provided. Aspects include storing a number of times that each driver travels across a road segment and classifying the drivers as local drivers for the road segment if the number of times the driver traversed the road segment is greater than a threshold number. Aspects also include determining an expected driving pattern for the road segment. Based on a determination that a local driver deviated from the expected driving pattern, aspects include storing an indication of how the local driver deviated from the expected driving pattern and a condition at that time. Based on a determination that greater than a threshold percentage of local drivers deviated from the expected driving pattern, aspects include notifying a driver traversing the road segment of a variant driving pattern for the road segment.

Abstract: Determining a route based on road conditions includes receiving an origin and a destination from a user and calculating a plurality of routes from the origin to the destination. Aspects also include obtaining weather data along each of the plurality of routes and ranking each of the plurality of routes based on the weather data, a user profile, and on historical weather response data for areas along each of the plurality of routes. Aspects also include providing a route with a highest ranking from the plurality of routes to the user.

Abstract: Methods, systems and computer program products for providing navigation based on local-driver route deviations are provided. Aspects include monitoring drivers and storing a route that each of the drivers take from an origin to a destination and a number of times that each of the drivers has traveled the route. Aspects also include classifying one or more drivers as local drivers based on a determination that the number of times the one or more drivers traveled the route is greater than a threshold number and receiving a routing request from a driver including a starting point and an endpoint and calculating an expected route from the starting point to the endpoint. Aspects further include calculating a generated route from the starting point to the endpoint, wherein calculating includes determining routes local drivers have taken from the starting point to the endpoint and providing the generated route to the driver.

Abstract: Embodiments include method, systems and computer program products for display turn off override control. Aspects include receiving an indication of the launching of a mobile application on an electronic device. An override authorization is requested from a user of the electronic device. The automatic display turn off features of the electronic device is altered based at least in part on receiving an override authorization from the user.

Abstract: An approach for new recipient inclusion to e-mail chains. E-mail chain manager receives include participants associated with an e-mail chain, current participants in the current e-mail chain distribution and authorization rules associated with the e-mail chain. The e-mail chain manager determines inclusion authorizations for the include participants based on comparing the include participants with the authorization rules and creates authorization results associated with the include participants. In response to determining the authorization results are passed, the e-mail chain manager creates authorized include participants. The e-mail chain manager creates the participant notifications where the participant notifications are based on the authorized include participants and outputs the participant notifications based on predetermined participant preferences of the current participants.

Abstract: In an approach to cleanup of unpredictable test results, one or more computer processors generate a data area associated with a first test instruction in a test stream. The one or more computer processors determine whether the generated data area overlaps with an unpredictable data area. In response to determining the generated data area overlaps with an unpredictable data area, the one or more computer processors determine a second test instruction associated with the overlapped unpredictable data area, where the second test instruction precedes the first test instruction in the test stream. The one or more computer processors select a location in the test stream between the first test instruction and the second test instruction. The one or more computer processors insert one or more pre-requisite instructions in the selected location, where the one or more pre-requisite instructions load the overlapped unpredictable data area with pre-defined data.

Abstract: In an approach to cleanup of unpredictable test results, one or more computer processors generate a data area associated with a first test instruction in a test stream. The one or more computer processors determine whether the generated data area overlaps with an unpredictable data area. In response to determining the generated data area overlaps with an unpredictable data area, the one or more computer processors determine a second test instruction associated with the overlapped unpredictable data area, where the second test instruction precedes the first test instruction in the test stream. The one or more computer processors select a location in the test stream between the first test instruction and the second test instruction. The one or more computer processors insert one or more pre-requisite instructions in the selected location, where the one or more pre-requisite instructions load the overlapped unpredictable data area with pre-defined data.

Abstract: An approach for new recipient inclusion to e-mail chains. E-mail chain manager receives include participants associated with an e-mail chain, current participants in the current e-mail chain distribution and authorization rules associated with the e-mail chain. The e-mail chain manager determines inclusion authorizations for the include participants based on comparing the include participants with the authorization rules and creates authorization results associated with the include participants. In response to determining the authorization results are passed, the e-mail chain manager creates authorized include participants. The e-mail chain manager creates the participant notifications where the participant notifications are based on the authorized include participants and outputs the participant notifications based on predetermined participant preferences of the current participants.

Abstract: An approach for new recipient inclusion to e-mail chains. The approach determines inclusion authorizations for one or more include participants in a current e-mail chain distribution. Responsive to a determination that the one or more authorization results are passed, the approach creates one or more authorized include participants. The approach creates one or more participant notifications based, at least in part, on the one or more authorized include participants. The approach outputs an e-mail chain to the one or more authorized include participants, wherein outputting the email chain includes outputting the one or more participant notifications based, at least in part, on predetermined participant preferences of one or more current participants in the current email chain distribution. The approach creates a next e-mail chain distribution based, at least in part, on combining the one or more authorized include participants and the one or more current participants.

Abstract: Embodiments of the present invention provide a method, computer program product, and a computer system for predicting message personalization. According to one embodiment a message is received on a first device, wherein the message is sent from a second device, and wherein the first device and the second device are in a community. An escape character followed by a keyword in the received message is detected. A detailed message is determined based in part on the keyword in the received message associated with the community. Next the escape character and the keyword are replaced with the determined detailed message. Finally, the received message and the determined detailed message are displayed.

Abstract: Systems, methods, and computer-readable media are disclosed for processing and message padding an input message as well as processing an extended output message (EOM) in a manner that ensures that the input message and the padded message are processed only a single time, thus avoiding generation of an incorrect message digest. In addition, in those scenarios in which multiple padded message blocks are generated, the disclosed systems, methods, and computer-readable media ensure that all of the padded message blocks are processed.

Abstract: A test program is run repeatedly (either as a loop that is programmed into the code of the test program itself, or by repeatedly running the test program manually in response to user input instructing repeated run(s) of the test program. At least some run(s) of the test program use a cipher key that was derived and saved by the test program during a previous run of the test program (rather than re-deriving the cipher key based on information provided by the operating system). In this way, if the corresponding cipher key, as stored in the system space of the operating system has become corrupted during previous run(s) of the test program, then the incompatibility between the corrupted cipher key in the system space, and the previously saved cipher key that was previously derived by the test program, will be more easily detected.

Abstract: A test program is run repeatedly (either as a loop that is programmed into the code of the test program itself, or by repeatedly running the test program manually in response to user input instructing repeated run(s) of the test program. At least some run(s) of the test program use a cipher key that was derived and saved by the test program during a previous run of the test program (rather than re-deriving the cipher key based on information provided by the operating system). In this way, if the corresponding cipher key, as stored in the system space of the operating system has become corrupted during previous run(s) of the test program, then the incompatibility between the corrupted cipher key in the system space, and the previously saved cipher key that was previously derived by the test program, will be more easily detected.

Abstract: A test program is run repeatedly (either as a loop that is programmed into the code of the test program itself, or by repeatedly running the test program manually in response to user input instructing repeated run(s) of the test program. At least some run(s) of the test program use a cipher key that was derived and saved by the test program during a previous run of the test program (rather than re-deriving the cipher key based on information provided by the operating system). In this way, if the corresponding cipher key, as stored in the system space of the operating system has become corrupted during previous run(s) of the test program, then the incompatibility between the corrupted cipher key in the system space, and the previously saved cipher key that was previously derived by the test program, will be more easily detected.

Abstract: Embodiments include methods, reconfiguration and verification systems, and computer program products automating manual reconfiguration and verification process. Aspects include manually configuring processing units (Pus) through LPAR partition's reconfiguration panel using a hardware management console, creating by an computer operating system an MSGLOG API to allow a test program (TP) to communicate with an automation system's automation program (AP), TP generating reconfiguration tests (RT) of PUs and transmitting RTs to AP while holding an MSGLOG API lock, and TP going to sleep for a predetermined time using a sleep timer to allow AP to perform tests, determining whether sleep timer is expired. When sleep timer is expired, print a sleep timer expiration error, and exit. Otherwise, TP obtains states of PUs under RTs, and determine whether results of RTs are correct. When results of RTs are not correct, test program prints reconfiguration test failure error messages, and exit.

Abstract: A test program is run repeatedly (either as a loop that is programmed into the code of the test program itself, or by repeatedly running the test program manually in response to user input instructing repeated run(s) of the test program. At least some run(s) of the test program use a cipher key that was derived and saved by the test program during a previous run of the test program (rather than re-deriving the cipher key based on information provided by the operating system). In this way, if the corresponding cipher key, as stored in the system space of the operating system has become corrupted during previous run(s) of the test program, then the incompatibility between the corrupted cipher key in the system space, and the previously saved cipher key that was previously derived by the test program, will be more easily detected.

Abstract: A test program is run repeatedly (either as a loop that is programmed into the code of the test program itself, or by repeatedly running the test program manually in response to user input instructing repeated run(s) of the test program. At least some run(s) of the test program use a cipher key that was derived and saved by the test program during a previous run of the test program (rather than re-deriving the cipher key based on information provided by the operating system). In this way, if the corresponding cipher key, as stored in the system space of the operating system has become corrupted during previous run(s) of the test program, then the incompatibility between the corrupted cipher key in the system space, and the previously saved cipher key that was previously derived by the test program, will be more easily detected.

Abstract: A test program is run repeatedly (either as a loop that is programmed into the code of the test program itself, or by repeatedly running the test program manually in response to user input instructing repeated run(s) of the test program. At least some run(s) of the test program use a cipher key that was derived and saved by the test program during a previous run of the test program (rather than re-deriving the cipher key based on information provided by the operating system). In this way, if the corresponding cipher key, as stored in the system space of the operating system has become corrupted during previous run(s) of the test program, then the incompatibility between the corrupted cipher key in the system space, and the previously saved cipher key that was previously derived by the test program, will be more easily detected.