Abstract: A unique tool, i.e., “VeriWeb”, is employed to automatically discover and systematically explore Web-site execution paths that can be followed by a user in a Web application. Unlike traditional spiders (or crawlers) that are limited to the exploration of static links, VeriWeb can navigate automatically through dynamic components of Web sites, including form submissions and execution of client-side scripts. Whenever examining a new Web page, the system determines all possible actions a user might perform—be it a link, via a button with a JavaScript handler, or via form submission—and can execute them in a systematic way. In order to systematically test different paths in a Web site, VeriWeb addresses two critical problems: systematic Web site exploration and automatically filling out forms.

Abstract: A unique tool, i.e., “VeriWeb”, is employed to automatically discover and systematically explore Web-site execution paths that can be followed by a user in a Web application. Unlike traditional spiders (or crawlers) that are limited to the exploration of static links, VeriWeb can navigate automatically through dynamic components of Web sites, including form submissions and execution of client-side scripts. Whenever examining a new Web page, the system determines all possible actions a user might perform—be it a link, via a button with a JavaScript handler, or via form submission—and can execute them in a systematic way. In order to systematically test different paths in a Web site, VeriWeb addresses two critical problems: systematic Web site exploration and automatically filling out forms.

Abstract: A first system for analysis of a portion of a partial state space includes a representation component and an analysis component. The portion of the partial state space is related to a part of a second system. The representation component of the first system employs a value in the portion of the partial state space to represent that information for the part of the second system is unknown. The analysis component of the first system employs the value in the portion of the partial state space to analyze, in response to an analysis question that is related to the part of the second system, the portion of the partial state space.

Abstract: Presence awareness initiatives are implemented in a collaborative system that enables a user to set presence awareness policies, and that provides a reasonably high assurance that the system will correctly implement those policies. Specifically, the collaborative presence awareness system is such as to enable users to specify complex presence awareness policies. The presence awareness system is also such as to have been verified by employing systematic state-space exploration tools to establish a high level of assurance that the presence awareness system has the capability to implement correctly, substantially all possible presence awareness policies. Further, in accordance with another aspect of the invention, the presence awareness policy specifications are modular relative to the rest of the presence awareness system, and can be modified without having to modify computational modules or user interface program code of the presence awareness system.

Abstract: A verification of the protocol between the various communicating elements of a concurrent system may be performed directly using the actual code that implements the element when it is actually operating. This is achieved by combining stateless search techniques with partial order methods, namely, persistent set and sleep set methods. In particular, the code of each element of a system is exercised by a scheduler in such a way that global states of the system are visited according to a stateless search, which is a search that does not use an explicit representation of the global states. A global state is a state in which the next operation to be executed by every element of the system is a visible operation. The set of visible operations includes at least those operations related to communication between the elements.

Abstract: A unique process, i.e., method, is employed to automatically close an open reactive system. This is realized by employing a unique analysis technique to automatically close the open system by eliminating its interface to its environment. This allows the open system being analyzed to be comprised of either a single sequential process or a set of concurrent processes. The effect of closing the system is to make it executable and amenable to analysis. This is because the resulting closed system simulates the behavior of the original open system in its most general environment.

Abstract: The simulation of sequences of the visible operations of a process in a concurrent system is performed by synthesizing the finite-state machine for the process from a projected tree. The synthesis procedure includes a parameter that can be adjusted to obtain machines that represent the desired behavior with varying degrees of approximation. An "on-the-fly" version of the invention provides intermediate results while the state space of the system continues to be explored. The finite-state machines may be abstracted to reduce the magnitude of visible operations to be considered to a more manageable level.