Abstract: A method and apparatus for providing an undoable programming language. More specifically the present invention relates to providing a fully undoable programming language, where the language includes a fully undoable core language portion and a conventional language portion. In an embodiment of the present invention, a method of encoding a general-purpose undoable programming language to enable fully undoable instructions includes encoding a fully undoable core imperative language portion having a plurality of undoable core instructions, each of the plurality of undoable core instructions to perform at least one undoable operation upon execution, and the at least one undoable operation being fully undoable until final termination of a program written using any of the plurality of undoable core instructions.

Abstract: A method and apparatus are described for providing an undoable programming language. More specifically, the present invention relates to providing a fully undoable programming language, where the language includes a fully undoable core language portion and a conventional language portion. An embodiment of the present invention includes a method of determining an actual target of an event calculating a set of pre-events of the event, adding the set of pre-events as children of the event, and the set of pre-events being set to be raised to a pre-queue of the event. The method also includes applying an event principle to each pre-event of the event such that a set of protected positions being augmented with an upward closure of the target, executing the event, if the actual target is defined and the event is consumable, and applying the event principle to each post-event of the event.

Abstract: A method and apparatus are described for a programming language with fully undoable, timed reactive instructions. More specifically, the present invention relates to providing a multi-modal user interface for controlling the execution of fully undoable programs. An embodiment of the present invention includes a method for providing a multi-modal user interface that is enabled to control the order of execution of a program having fully undoable instructions using checkpoints associated with discrete locations within the program.

Abstract: A method and apparatus for providing an undoable programming language. More specifically the present invention relates to providing a fully undoable programming language, where the language includes a fully undoable core language portion and a conventional language portion. In an embodiment of the present invention, a method of encoding a general-purpose undoable programming language to enable fully undoable instructions includes encoding a fully undoable core imperative language portion having a plurality of undoable core instructions, each of the plurality of undoable core instructions to perform at least one undoable operation upon execution, and the at least one undoable operation being fully undoable until final termination of a program written using any of the plurality of undoable core instructions.

Abstract: A method and apparatus are described for providing an undoable programming language. More specifically, the present invention relates to providing a fully undoable programming language, where the language includes a fully undoable core language portion and a conventional language portion. An embodiment of the present invention includes a method of determining an actual target of an event calculating a set of pre-events of the event, adding the set of pre-events as children of the event, and the set of pre-events being set to be raised to a pre-queue of the event. The method also includes applying an event principle to each pre-event of the event such that a set of protected positions being augmented with an upward closure of the target, executing the event, if the actual target is defined and said event is consumable, and applying the event principle to each post-event of the event.

Abstract: A method and apparatus for performing unit testing of software modules uses a novel directed automated random testing approach that advantageously combines automated extraction of the interface of a program with its external environment using static source code parsing; automatic generation of a test driver for this interface that advantageously performs random testing to simulate the most general environment the program can operate in; and dynamic analysis of how the program behaves under random testing and automatic generation of new test inputs to direct systematically the execution along alternative program paths. Together, these techniques constitute a directed automated random testing approach (DART). With DART, testing can be performed completely automatically on any program that compiles without the need to write any test driver or harness code. During testing, DART detects standard errors such as program crashes, assertion violations, and non-termination conditions.

Abstract: A QWERTY-based cluster keyboard is disclosed. In the preferred embodiment, the keyboard comprises fourteen alphabet keys arranged such that all the letters in the alphabet are distributed in three rows of keys and in the standard QWERTY positions. Stochastic language models are used to reduce the error rate for typing on the keyboards. The language models consist of probability estimates of occurrences of n-grams (sequences of n consecutive words), wherein n is preferably 1, 2 or 3. A delay parameter d, which is related to the period of time the system displays the predicted intended word upon entry of a word boundary, is preferably zero to immediately display the primary word choice at a word boundary and provide the user the option to select the secondary candidate if necessary. Two disambiguation keys enable the user to identify which letter is intended as a secondary option to the language model predictions.

Abstract: A method and apparatus for providing an undoable programming language. More specifically the present invention relates to providing a fully undoable programming language, where the language includes a fully undoable core language portion and a conventional language portion. In an embodiment of the present invention, a method of encoding a general-purpose undoable programming language to enable fully undoable instructions includes encoding a fully undoable core imperative language portion having a plurality of undoable core instructions, each of the plurality of undoable core instructions to perform at least one undoable operation upon execution, and the at least one undoable operation being fully undoable until final termination of a program written using any of the plurality of undoable core instructions.

Abstract: An audio browsing adjunct executes a voice markup language browser. The audio browsing adjunct receives a voice interactive request. Based on the request, the network node obtains a document. The document includes a voice markup, and a parameterized interaction definition or at least one link to a parameterized interaction definition when user interaction is required. The audio browsing adjunct interprets the document in accordance with the parameterized interaction definition. By using the parameterized interaction definition, entered data is typically verified at the audio browsing adjunct instead of at a network server. Further, the parameterized interaction definition can define a finite state machine. When it does, the parameterized interaction definition can be analyzed so that performance problems of the audio browsing adjunct are minimized.

Abstract: A foot-operated keyboard device comprises a support structure and a plurality of switch elements. The support structure extends along a centrally-disposed longitudinal axis and includes an upper panel member. The upper panel member has a first surface with a foot resting region disposed thereon. The foot resting region has a forward toe resting section and a rear heel resting section. The plurality of switch elements are mounted to the support structure and are accessible from the first surface. The plurality of switch elements include at least a first array of switch elements extending traversely to the longitudinal axis in the vicinity of the forward toe resting section of the foot resting region and a second array of switch elements extending transversely to the longitudinal axis in the vicinity of the rear heel resting section of the foot resting region.