Kuperstein
Michael Kuperstein, Wellesley, MA US
Patent application number | Description | Published |
---|---|---|
20090018829 | Speech Recognition Dialog Management - Described is a speech recognition dialog management system that allows more open-ended conversations between virtual agents and people than are possible using just agent-directed dialogs. The system uses both novel dialog context switching and learning algorithms based on spoken interactions with people. The context switching is performed through processing multiple dialog goals in a last-in-first-out (LIFO) pattern. The recognition accuracy for these new flexible conversations is improved through automated learning from processing errors and addition of new grammars. | 01-15-2009 |
Michael Kuperstein, New York, NY US
Patent application number | Description | Published |
---|---|---|
20110296424 | Synthesis of Memory Barriers - A framework is provided for automatic inference of memory fences in concurrent programs. A method is provided for generating a set of ordering constraints that prevent executions of a program violating a specification. One or more incoming avoidable transitions are identified for a state and one or more ordering constraints are refined for the state. The set of ordering constraints are generated by taking a conjunction of ordering constraints for all states that violate the specification. One or more fence locations can optionally be selected based on the generated set of ordering constraints. | 12-01-2011 |
Michael Kuperstein, Rishon Le Tzion IL
Patent application number | Description | Published |
---|---|---|
20120278792 | Automatic Verification and Synthesis for Weak Memory Models - Techniques are provided for automatic verification and inference of memory fences in concurrent programs that can bound the store buffers that are used to model relaxed memory models. A method is provided for determining whether a program employing a relaxed memory model satisfies a safety specification. An abstract memory model is obtained of the relaxed memory model. The abstract memory model represents concrete program states of the program as a finite number of abstract states. The safety specification is evaluated for the program on the abstract memory model having the finite number of abstract states. Fence positions at one or more locations can be determined to ensure that the safety specification is satisfied. | 11-01-2012 |