Abstract: A distributed computing system includes worker nodes and a master node including a processor coupled to a memory. Each worker node crawls a portion of an interactive client-server application. The memory includes a master state graph, including the results of crawling. The master node is configured to examine the master state graph to determine a number of reconverging traces, receive a result from a job from a worker node if the number of reconverging traces is below a threshold, and add the result to the master state graph without attempting to remove duplicate states or transitions. A trace includes states and transitions representing valid. A reconvergent trace includes a trace including a reconvergent state, which is a state that can be reached through two or more distinct traces. The result containing states and transitions is associated with crawling a first portion of the interactive client-server application.

Abstract: An electronic device includes a memory and a processor coupled to the memory. The memory contains a master state graph. The master state graph includes information regarding the operation of interactive client-server application. The processor is configured to send a first job to a first worker node, send a second job to a second worker node, receive results of crawling the interactive client-server application, and integrate results of crawling the interactive client-server application into the master state graph. The first job includes crawling instructions for crawling a first portion of an interactive client-server application. The second job includes crawling instructions for crawling a second portion of the interactive client-server application. The first worker node and second worker node crawl the interactive client-server application in parallel.

Abstract: A method for verifying software includes determining the result of a bounding function, and using the result of the bounding function to apply one or more policies to the execution of the received job. The bounding function evaluates the execution of a received job, the received job indicating a portion of software to be verified. The result of the bounding function is based upon the present execution of the received job, one or more historical parameters, and an evaluation of the number of idle nodes available to process other jobs.

Abstract: A method for verifying software includes monitoring a resource queue and a job queue, determining whether the resource queue and the job queue contain entries, and if both the resource queue and the job queue contain entries, then applying a scheduling policy to select a job, selecting a worker node as a best match for the characteristics of the job among the resource queue entries, assigning the job to the worker node, assigning parameters to the worker node for a job creation policy for creating new jobs in the job queue while executing the job, and assigning parameters to the worker node for a termination policy for halting execution of the job. The resource queue indicates worker nodes available to verify a portion of code. The job queue indicates one or more jobs to be executed by a worker node. A job includes a portion of code to be verified.

Abstract: An electronic device includes a memory including a state graph, and a processor coupled to the memory. The state graph includes a plurality of states of an interactive client-server application to be crawled. Te plurality of states and transitions result from the crawling of the client-server application. The plurality of states includes an initial state and a second state. The initial state includes one or more initial state nodes. The second state includes one or more second state nodes. The processor is configured to determine the differences between the initial state and the second state and compress the second state with respect to the initial state using the differences, resulting in a compressed state.

Abstract: An electronic device includes a memory including a crawling application and a processor coupled to the memory. The processor is configured to execute the crawling application, which causes the processor to receive a job, crawl the interactive client-server application based on the initialization information until a boundary condition is reached, and report the results of crawling. The job contains initialization information indicating a portion of an interactive client-server application to be crawled. Crawling it includes programmatically determining possible actions available on a first state of the interactive client-server application, recording the first state, selecting an action, recording the actions not taken, taking the action, reaching a second state, recording the second state, and recording the action taken as a transition between the first state and the second state.

Abstract: In one embodiment, a distributed computing system includes a first worker node configured to execute a first job, a second worker node configured to execute a second job, and a master node including a processor coupled to a memory. The first job indicates a first portion of an interactive client-server application to be crawled. The second job indicates a second portion of an interactive client-server application to be crawled. The second worker node and the first worker node are configured to execute their respective jobs in parallel. The second job indicates a second portion of an interactive client-server application to be crawled. The master node is configured to assign the first job to the first worker node, assign the second job to the second worker node, and integrate the results from the first worker node and the second worker node into a record of operation of the application.

Abstract: A method for verifying software includes accessing a job queue, accessing a resource queue, and assigning a job from the job queue to a resource from the resource queue if an addition is made to the a job queue or to a resource queue. The job queue includes an indication of one or more jobs to be executed by a worker node, each job indicating a portion of a code to be verified. The resource queue includes an indication of a one or more worker nodes available to verify a portion of software. The resource is selected by determining the best match for the characteristics of the selected job among the resources in the resource queue.

Abstract: A method for synchronizing a state graph includes generating a partial state graph by executing a crawling task to crawl an interactive client-server application, transmitting the partial state graph from a first electronic device to a second electronic device, and transmitting the partial state graph on a periodic basis. The partial state graph includes one or more new states of the interactive client-server application identified while crawling the interactive client-server application since a previous transmission.

Abstract: In one embodiment, a method includes statically analyzing a validation toolkit environment. The method may also include, identifying a plurality of computational threads that do not share data structures with each other based on analysis of the validation toolkit environment. The method may additionally include calculating computational requirements of the computational threads. The method may further include distributing the threads among a plurality of resources such that the aggregate computational requirements of the computational threads are approximately evenly balanced among the plurality of resources.

Abstract: In one embodiment, a method may include accessing a particular page of Web application that includes an interactive form having at least one field for entry of data by a user of the Web application, the interactive form rendered by the Web application based on code for the interactive form. The method may also include extracting input validation code from the code, the input validation code including at least one constraint on data entered into the at least one field. The method may additionally include extracting the at least one constraint based on an analysis of the input validation code. The method may further include solving, for the at least one field, for a string value based at least on the at least one constraint for the at least one field. The may also include automatically entering, into the at least one field, the string value. The method may additionally include automatically submitting the interactive form, including the string value entered into the at least one field.

Abstract: A role based access control system is described that assigns roles, which otherwise are mutually exclusive, to users based on detecting designated conditions when the user initiates actions or operations on the network. The assignment of the role to a particular user may be conditional upon one or more such designated conditions occurring. In particular, two roles that are mutually exclusive of one another may be occupied by one user for purpose of performing specified operations upon designated conditions being detected when the user initiates one or more of the specified operations. Business rules specify conditions for assigning the conditional roles.

Abstract: A method and apparatus are disclosed for modifying a subscription of a subscriber to a telecommunications service based on subscriber information and service information that are stored in a directory repository. A directory-enabled service selection framework is coupled to the directory repository for receiving stored information therefrom. The directory-enabled service selection framework receives a request to identify one or more services to which a subscriber is subscribed, based on a prior request to modify the subscription of the subscriber to the telecommunications service. A list is generated of the one or more services to which the subscriber is currently subscribed, based on group membership of the subscriber, one or more roles occupied by the subscriber, and authorization information associated with the subscriber that is stored in the directory repository.

Abstract: A method is disclosed for managing network resources in multiple administrative domains. According to the method, a user is authenticated in a first administrative domain. A token is generated for the user that identifies the user as being assigned a role. The token is configured to identify the user by the role to a component of a second administrative domain. When the user requests a resource of the second administrative domain, its component examines the token and the role to determine whether to grant access to the resource. As a result, the second administrative domain may grant the user access to its resources without re-authenticating the user in the second administrative domain.

Abstract: A method is provided to configure access to a plurality of data repositories. The data repositories each provide data objects for applications operated by users. A request is received to access data objects in the plurality of data repositories. The request may specify a parameter. Metadata is retrieved that characterizes a portion of the data objects stored in each data repository. One or more objects are selected from the data repositories using the parameter in the request and the metadata.

Abstract: A system and method for synchronizing database information over a communications network distributed among a plurality of servers. The system allows each server to track the state of a replica on each of the servers, and changes to the servers are communicated between the servers along with their states. The states may be stored as an array of timestamps, the timestamps each indicating a time at which the replica on each server was updated. In a network wherein two servers (a first and third server) cannot communicate directly, a first network server transmits a change to an intermediate (a second) server including its state information. The second server transmits the change to the third server, and the third server updates its replica. The third server transmits its state information to the second server, and the timestamp information is conveyed to the first server. The state information of the third server may be transmitted to the second server during later updates of the third server's replica.

Abstract: A method and apparatus for reorganizing a distributed directory is disclosed. A source logical group, such as a partition, is identified for reorganization. A destination object is selected to which the source logical group will become subordinate. Multiple simultaneous reorganizations of the distributed directory can be handled.

Abstract: Methods and systems for managing replicated objects in a partitioned hierarchical database are disclosed. One method combines partition-wide object identifiers in order according to ancestry to form a database-wide object identifier that identifies a target object relative to all other objects in the database. Each partition-wide object identifier includes a replica identifier and at least one integer value. Suitable integer values include timestamp values, event counter values, random values, and GUID values. Other methods use the identifiers to access objects after a single object or a subtree of objects has been renamed or moved.

Abstract: A method of moving leaf objects and subtrees in computer networks that employ a distributed network directory is disclosed. The method employs the existing directories and an authentication procedure for each server. A first object that is under the physical control of the administrator of one partition of the distributed network directory requests access to a second object that is under the physical control of the administrator of another partition of the distributed network directory. The directory verifies that the access control list of the first object includes the second object. The access control list of the second object is then checked to verify that it includes a reference to the first object as an object that is permitted access to the second object. As a result, access is only granted in response to requests from objects that appear in the access control list of the second object. a method of synchronizing the access control lists based upon an authoritative access control list is also disclosed.

Abstract: A method of moving leaf objects and subtrees in computer networks that employ a distributed network directory is disclosed. The method employs the existing directories and an authentication procedure for each server. A first object that is under the physical control of the administrator of one partition of the distributed network directory requests access to a second object that is under the physical control of the administrator of another partition of the distributed network directory. The directory verifies that the access control list of the first object includes the second object. The access control list of the second object is then checked to verify that it includes a reference to the first object as an object that is permitted access to the second object. As a result, access is only granted in response to requests from objects that appear in the access control list of the second object. a method of synchronizing the access control lists based upon an authoritative access control list is also disclosed.