Abstract: A method and system are disclosed for modeling non-deterministic queues for efficient model checking. In this method and system, a multitude of messages are held in a plurality of queues, and these messages having n priorities. The method comprises the steps of providing (n+1) queues, including a first queue, and n priority queues; passing said messages from a source to the first queue; passing each of said messages from the first queue to one of said n priority queues based on the priority of the message; and passing each of said messages from the n priority queues to a destination based on the priority of the message. One or more non-deterministic waits are introduced into one or more of the passing steps to simplify passing the messages into or out of the n priority queues.

Abstract: A method and system to identifying the use of dangling pointers in software instrumentation irrespective of the location of the pointer in the memory. The main memory is preferably segmented into three parts defined as a first memory, a version segment and a pointer version segment. By use of the version segment and pointer version stored in the pointer version segment, checksum are made on a pointer version with a version on dereferencing a pointer in the first memory to identify references to a dangling pointer on negative determination. Identified dangling pointer may be reported to the end user.

Abstract: A method uses a SAT solver operating to cycle k to find bugs in a model having finite computation paths therein, wherein said bugs are on computation paths of less than length k. Another method includes adding an additional state variable to a model to be checked, where a governing state machine of the additional variable has a “sink” state. The method includes having a translation using the additional variable whenever a state indicates a bad state and performing satisfiability solving with the model and the translation.

Abstract: A method uses a SAT solver operating to cycle k to find bugs in a model having finite computation paths therein, wherein said bugs are on computation paths of less than length k. Another method includes adding an additional state variable to a model to be checked, where a governing state machine of the additional variable has a “sink” state. The method includes having a translation using the additional variable whenever a state indicates a bad state and performing satisfiability solving with the model and the translation.

Abstract: A computer-implemented method for reviewing software includes monitoring a review session held by one or more reviewers for locating errors in a computer program, and automatically detecting a suggestion-triggering event in the monitored session. A suggested action predicted to increase a likelihood of locating the errors is determined based on known bug patterns responsively to the detected suggestion-triggering event. The suggested action is applied in an execution of the review session.

Abstract: A method and system are disclosed for modeling non-deterministic queues for efficient model checking. In this method and system, a multitude of messages are held in a plurality of queues, and these messages having n priorities. The method comprises the steps of providing (n+1) queues, including a first queue, and n priority queues; passing said messages from a source to the first queue; passing each of said messages from the first queue to one of said n priority queues based on the priority of the message; and passing each of said messages from the n priority queues to a destination based on the priority of the message. One or more non-deterministic waits are introduced into one or more of the passing steps to simplify passing the messages into or out of the n priority queues.

Abstract: A method includes generating a model of a software program in which, at each cycle of the model, a program counter and at most one non-program-counter variable change value. The method also includes generating at least one disjunctive partition and/or at least one partial disjunctive partition for each variable of the model. The method also includes computing an image and/or a pre-image using partial disjunctive partitions. A model checker includes a modeler to generate a model of a software program in which, at each cycle of the model, a program counter and at most one non-program-counter variable change value.

Abstract: A method and system to identifying the use of dangling pointers in software instrumentation irrespective of the location of the pointer in the memory. The main memory is preferably segmented into three parts defined as a first memory, a version segment and a pointer version segment. By use of the version segment and pointer version stored in the pointer version segment, checksum are made on a pointer version with a version on dereferencing a pointer in the first memory to identify references to a dangling pointer on negative determination. Identified dangling pointer may be reported to the end user.

Abstract: A system for remote operation of the computer software applications, the system including a remote application controller for associating a master control with both a master application and a master action associated with the master application, and a command receiver/implementer for associating a slave control with both a slave application and a slave action associated with the slave application, where the remote application controller commands the command receiver/implementer to perform the slave action in connection with the performing of the master action.

Abstract: A computer-implemented method for reviewing software includes monitoring a review session held by one or more reviewers for locating errors in a computer program, and automatically detecting a suggestion-triggering event in the monitored session. A suggested action predicted to increase a likelihood of locating the errors is determined based on known bug patterns responsively to the detected suggestion-triggering event. The suggested action is applied in an execution of the review session.

Abstract: A computer-implemented method for verifying a target system includes defining a specification including properties applicable to the target system. Execution sequences of the target system are identified. A set of the execution sequences is grouped into an equivalence class characterized by a common control flow. A symbolic representation of the equivalence class is evaluated so as to verify a compliance of the set of the execution sequences with one or more of the properties.

Abstract: A method uses a SAT solver operating to cycle k to find bugs in a model having finite computation paths therein, wherein said bugs are on computation paths of less than length k. Another method includes adding an additional state variable to a model to be checked, where a governing state machine of the additional variable has a “sink” state. The method includes having a translation using the additional variable whenever a state indicates a bad state and performing satisfiability solving with the model and the translation.

Abstract: A model checker includes a model checker to generate a model of a piece of generally asynchronous hardware in which the set of variables includes a separate process chooser variable and the remainder of the variables are divided into disjoint sets of groups. At each cycle of the model, the process chooser and maximally, variables from one group of variables change values.

Abstract: A method includes generating a model of a software program in which, at each cycle of the model, a program counter and at most one non-program-counter variable change value. The method also includes generating at least one disjunctive partition and/or at least one partial disjunctive partition for each variable of the model. The method also includes computing an image and/or a pre-image using partial disjunctive partitions. A model checker includes a modeler to generate a model of a software program in which, at each cycle of the model, a program counter and at most one non-program-counter variable change value.

Abstract: Chimeric compounds are disclosed which are covalent conjugates of reversible or irreversible cholinergic up-regulators and non-steroidal anti-inflammatory drugs (NSAIDs), methods for their synthesis and use thereof for treatment and/or prevention of central nervous system (CNS) disorders and diseases.