Abstract: A method of allocating programmable memory in a network device includes receiving a set of desired features for the network device, and determining a plurality of constraints associated with the set of desired features. The plurality of constraints are converted into a plurality of Boolean representations of the constraints, and a feasibility is evaluated for the desired features based on the plurality of constraints.

Abstract: A method, computer program and system for performing a find and replace editing operation of a text starting from a couple of initial find and replace expressions provided by the user, applying each rule defining admissible inflected forms of the initial find expression and the initial replace expression, to the initial find and replace expressions to identify all the derived couples of find and replace expressions. The find expression and the replace expression of the derived couples correspond to inflected forms of the initial find and replace expressions. Then, for each match in the text of the find expression of the derived couples, proposing to the user the derived couples for replacement in the text.

Abstract: A method, computer program and system for performing a find and replace editing operation of a text starting from a couple of initial find and replace expressions provided by the user, applying each rule defining admissible inflected forms of the initial find expression and the initial replace expression, to the initial find and replace expression to identify all the derived couples of find expression and the replace expression which are valid for the rules. The find expression and the replace expression of the derived couples correspond to inflected forms of the initial find and replace expressions. Then, for each match in the text of the find expression of the derived couples, proposing to the user the derived couples for replacement in the text. The user interface is done through the usual graphical user interface of a text editor or through a text based terminal user interface.

Abstract: A system and process for debugging of a computer program, is provided. One implementation includes a function configured for including mark-up information marking certain methods as special fields in a source code of the application program, such annotations denoting debugging instructions and indications of which methods are intended for debugging only; a processing module configured for generating a production version of the application program including the same semantics as the original application program but potentially fewer methods and no debug related annotations, wherein methods that are not annotated as debugging only methods are maintained; and a debugger configured for debugging purposes using the debugging methods.

Abstract: A process and system for debugging of a computer program, is provided. One implementation involves including mark-up information into source code of the application program, generating a debug-enabled version of the computer program including debugging methods based on the mark-up information, and providing the debug-enabled version of the program computer to a debugger for debugging purposes using the debugging methods.

Abstract: A method, computer program and system, which, given a set of Boolean state variables, a set of state transitions described as truth tables for the state variables, a set of initial states (that is states that objects happen to be in when they are brand new or when they are introduced into the system), all established by a natural modeling of the application domain, can derive an encoding that is provably isomorphic to the initial one but smaller, and transitions that match exactly the initial transitions but operating upon the new encoding, without incurring a significant time penalty. This effect is obtained by generating the extensive set of significant states, renumbering those states, then modifying the transitions implementation so as to use the renumbered states in place of the original ones.

Abstract: A process and system for interactive debugging of a computer program, is provided. One implementation involves providing a class for an object oriented computer program capable of executing on a computer system, the class having class methods defining a semantic field of the class; automatically monitoring the class during execution of the program, and leveraging said class methods by executing the class methods upon object-typed variables to obtain a pseudo-field value; and presenting the pseudo-field value along with fields of the said object-typed variables, on a user interface for debugging purposes.

Abstract: A method, computer program and system, which, given a set of Boolean state variables, a set of state transitions described as truth tables for the the state variables, a set of initial states (that is states that objects happen to be in when they are brand new or when they are introduced into the system), all established by a natural modeling of the application domain, can derive an encoding that is provably isomorphic to the initial one but smaller, and transitions that match exactly the initial transitions but operating upon the new encoding, without incurring a significant time penalty. This effect is obtained by generating the extensive set of significant states, renumbering those states, then modifying the transitions implementation so as to use the renumbered states in place of the original ones.

Abstract: A method, computer program and system, which, given a set of Boolean state variables, a set of state transitions described as truth tables for the state variables, a set of initial states (that is states that objects happen to be in when they are brand new or when they are introduced into the system), all established by a natural modeling of the application domain, can derive an encoding that is provably isomorphic to the initial one but smaller, and transitions that match exactly the initial transitions but operating upon the new encoding, without incurring a significant time penalty. This effect is obtained by generating the extensive set of significant states, renumbering those states, then modifying the transitions implementation so as to use the renumbered states in place of the original ones.

Abstract: A system and process for debugging of a computer program, is provided. One implementation includes a function configured for including mark-up information marking certain methods as special fields in a source code of the application program, such annotations denoting debugging instructions and indications of which methods are intended for debugging only; a processing module configured for generating a production version of the application program including the same semantics as the original application program but potentially fewer methods and no debug related annotations, wherein methods that are not annotated as debugging only methods are maintained; and a debugger configured for debugging purposes using the debugging methods.

Abstract: A process and system for interactive debugging of a computer program, is provided. One implementation involves providing a class for an object oriented computer program capable of executing on a computer system, the class having class methods defining a semantic field of the class; automatically monitoring the class during execution of the program, and leveraging said class methods by executing the class methods upon object-typed variables to obtain a pseudo-field value; and presenting the pseudo-field value along with fields of the said object-typed variables, on a user interface for debugging purposes.

Abstract: A process and system for debugging of a computer program, is provided. One implementation involves including mark-up information into source code of the application program, generating a debug-enabled version of the computer program including debugging methods based on the mark-up information, and providing the debug-enabled version of the program computer to a debugger for debugging purposes using the debugging methods.

Abstract: A method, computer program and system, which, given a set of Boolean state variables, a set of state transitions described as truth tables for the the state variables, a set of initial states (that is states that objects happen to be in when they are brand new or when they are introduced into the system), all established by a natural modeling of the application domain, can derive an encoding that is provably isomorphic to the initial one but smaller, and transitions that match exactly the initial transitions but operating upon the new encoding, without incurring a significant time penalty. This effect is obtained by generating the extensive set of significant states, renumbering those states, then modifying the transitions implementation so as to use the renumbered states in place of the original ones.

Abstract: A method, program and system for automatic reengineering of an input client code using an API when an API adapter code, is provided for emulating an old version of the API on a new version of the API, wherein the items no more provided in new API are identified, said method comprising the steps of parsing (200) the API adapter source code into a memory representation of this code; building (210) an index of the items of the API adapter code memory representation which have been identified; generating (220) a parametrized code memory representation of replacement code for the calls to the identified items; parsing (230) the input client code into a memory representation of this code; searching (240) in the memory representation of the input client code the calls to an identified item and reading the corresponding call parameters; replacing (260) the calls by the code memory representation of replacement code using the call parameters read in the preceding step; and, generating (270) the code corresponding to t