Patent application number | Description | Published |
20080208827 | Device, System and Method of Modeling Homogeneous Information - Device, system and method of modeling homogeneous information. For example, a method that includes providing to a model-based application an input model including a refinable homogeneous record having a base type, wherein said homogeneous record is defined with a homogeneous constraint to only include data members of a type compatible with the base type. The homogeneous record is defined in a modeling environment that is able to automatically enforce the homogeneous constraint for the homogeneous record and for refinements thereof. | 08-28-2008 |
20090143055 | Mobile Application and Content Provisioning using Web Services Technology - A method for provisioning one or more mobile applications. The method including deploying the mobile application as a web service in a UDDI directory, downloading the mobile applications from the UDDI directory by invoking the web service. The method may also include locating the mobile application in the UDDI directory. The method further includes extending a WSDL template to define the mobile application, wherein the extending provides for wrapping the mobile application as the web service, and publishing the WSDL defined mobile application in the UDDI directory. | 06-04-2009 |
20090241076 | Test-Cases for Functional Verification of System-Level Interconnect - Generation of test cases for functional verification of a complex system-under-test is achieved by the use of a probability matrix. The probability matrix represents a non-uniform distribution function of resource combinations used in the transactions, and can be created randomly, or by application of various types of testing knowledge. The matrix is used by a test generator for selecting resources that participate in a transaction involving an interconnect between different types of system components. Applying the inventive principles increases the quality of design verification by stimulation of both the system's resources and its internal interconnects, with almost no knowledge of the structure of the system. | 09-24-2009 |
20090327862 | VIEWING AND EDITING MARKUP LANGUAGE FILES WITH COMPLEX SEMANTICS - A data processing system for editing a document written in a markup language is provided. The system includes a memory storing the document, a primary editor, and a plurality of specialized editors, a display, a computer processor connected to the display and the memory operative to automatically define a tree of hierarchical elements of the document comprising a first layer of hierarchical elements, a second layer of hierarchical elements, and a boundary layer of hierarchical elements, according to a document type definition (DTD) or schema of the document, the boundary layer being disposed between the first layer and the second layer, wherein the hierarchical elements in the boundary layer head respective subtrees comprising a portion of the second layer of hierarchical elements, the subtrees having child elements; edit the first layer of hierarchical elements using a tree view editor; establish an association of respective the specialized editors with the hierarchical elements in the boundary layer; responsively to the association automatically associate the specialized editors with the child elements of the subtrees, respectively; and cooperatively with the display, the computer processor presents and edit content of the hierarchical elements in the boundary layer and present and edit content of the child elements of the subtrees thereof using the respective specialized editors. | 12-31-2009 |
20100010950 | DETERMINING COMPLIANCE RATES FOR PROBABILISTIC REQUESTS - Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented. | 01-14-2010 |
20100312738 | CONTEXT-BASED FAILURE REPORTING FOR A CONSTRAINT SATISFACTION PROBLEM - A method for solving a constraint satisfaction problem (CSP) comprises identifying a first illegal combination associated with at least one variable, wherein the first illegal combination contradicts at least one constraint; grouping the first illegal combination with a second illegal combination, in response to determining that the first and second illegal combinations contradict the same constraint; identifying at least one failure explanation for each group of illegal combinations, wherein the failure explanation is associated with at least one illegal combination in said group to provide a reason for a contradicted constraint associated with the illegal combination; assigning a value to each variable in the given domain to solve the CSP within the limitations defined by the constraints in a solution path; and generating a result, in response to determining that at least one assigned value to a variable contradicts a constraint. | 12-09-2010 |
20130080363 | CONTEXT-BASED FAILURE REPORTING FOR A CONSTRAINT SATISFACTION PROBLEM - A method for solving a constraint satisfaction problem (CSP) comprises identifying a first illegal combination associated with at least one variable, wherein the first illegal combination contradicts at least one constraint; grouping the first illegal combination with a second illegal combination, in response to determining that the first and second illegal combinations contradict the same constraint; identifying at least one failure explanation for each group of illegal combinations, wherein the failure explanation is associated with at least one illegal combination in said group to provide a reason for a contradicted constraint associated with the illegal combination; assigning a value to each variable in the given domain to solve the CSP within the limitations defined by the constraints in a solution path; and generating a result, in response to determining that at least one assigned value to a variable contradicts a constraint. | 03-28-2013 |
Patent application number | Description | Published |
20090259454 | AUTOMATIC TEST PROGRAM GENERATION USING EXTENDED CONDITIONAL CONSTRAINT SATISFACTION - Apparatus for automatically generating test programs is provided. The apparatus includes a test generator, which is adapted to receive a description of a system under test, expressed in terms of variables associated with the system and conditional constraints including semantics applied to the variables, to receive a definition of an event to be tested in the system, to generate an ECondCSP over the variables responsively to the definition of the event and to the conditional constraints, such that at least some of the semantics of the conditional constraints are preserved in the ECondCSP when one or more of the variables to which the semantics are applied are inactive, and to solve the ECondCSP to generate a test case for the system. | 10-15-2009 |
20090313590 | HIGHLY SPECIALIZED SCENARIOS IN RANDOM TEST GENERATION - A computer software product is provided. The product includes a computer-readable medium in which computer program instructions are stored, which instructions, when read by a computer, cause the computer to perform a method for functional verification of a design, having an operational space comprising the steps of accepting as an input a test template that specifies test parameters directed to a function of the design, the template comprising constraints and variables covering a working space within the operational space, associating an exemption mode of operation with at least one of the constraints or at least one of the variables, wherein a domain of the at least one of the variables is modified or the at least one of the constraints is disabled in the exemption mode of operation, producing a test case that lies in the operational space of the design by enabling the exemption mode of operation, the test case comprising a series of transactions originating from the template, wherein the transactions exercise the function of the design, wherein the working space is modified in the exemption mode of operation and submitting the test case for execution by the design, wherein the exemption mode of operation is associated with only a portion of the template. | 12-17-2009 |