Lamana
Leonardo Lamana, Amiens FR
Patent application number | Description | Published |
---|---|---|
20090139824 | Friction clutch, particularly for a motor vehicle, comprising differentiated friction means - A clutch comprises at least one damper ( | 06-04-2009 |
Michael Lamana, Warrenton, VA US
Patent application number | Description | Published |
---|---|---|
20100064294 | Maintaining Vitality of Data In Safety-Critical Systems - A mechanism for maintaining configuration or other vital data outside of source code is disclosed. In accordance with the illustrative embodiment of the present invention, a data manager software component serves as an interface between an external configuration data store and one or more applications, processes, and threads. In contrast with techniques of the prior art, the illustrative embodiment does not suffer from the risk of undetected corruption of vital data, and therefore is especially advantageous in safety-critical systems. | 03-11-2010 |
20100094816 | Safety-Critical Data Checking In Object-Oriented Systems - Methods for detecting the corruption of vital data during the execution of object-oriented programs are disclosed. In accordance with the illustrative embodiments, code is generated at run-time for computing a checksum of vital data in an object, and the code is inserted into the object. When the object is created, this code is executed to compute an initial checksum, and subsequently the code re-computes the checksum during program execution so that a change in the checksum—and inferentially, a change in one or more vital data—can be detected. The checksum is subsequently re-computed during program execution—either periodically, or in response to events such as when the object is modified or when a method of the object is invoked. | 04-15-2010 |
Michael A. Lamana, Manassas, VA US
Patent application number | Description | Published |
---|---|---|
20100125830 | Method of Assuring Execution for Safety Computer Code - A method and apparatus for preventing inadvertent execution of a segment of computer code is contemplated. One or more allowed executors are associated with each code segment. Each code segment is adapted to autonomously compare an originating code segment to each of the allowed executors to determine if it has been appropriately invoked. When a match is found execution will be allowed to continue, however, when a match is not found the code segment will take appropriate action such as blocking continued execution. In this way inadvertent execution of the code segment is prevented. | 05-20-2010 |