The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
This article gives a brief look at the idea of creating a software debugger that is capable of going backwards (backtracking) the steps that take place in a program's source code.
English (United States)
This text was extracted from a PDF file.
100% of the total text.
Page 1 of 1
Backtrackable Software Debugger
Disclosed is a technique that allows a user who mistakenly goes too far into the debugging session to conveniently backtrack to any desired point within the debug session. In this patent idea the program state is not saved, which is admittedly an extremely inefficient method. Instead a log is saved as the program progresses in the debugger. This log can be interpreted in a reverse mode allowing the programmer to back up in debugger.
Below is an example of a C line of code, the corresponding assembly, the debugger save state code and the corresponding backup code.
C code corresponding assembly debugger save state code corresponding backup code. | push i on stack_for_variable_i | i = pop from stack_for_variable_i i = 6; | addi gr4=6 |
| stw i(gr1,64)=gr4 |
From this the debugger pushes variable values before assigning new variable values. When the user selects the backup (opposite of next or step in dbx) the debugger will pop the old previous values from the corresponding stack and assign it to the variable.
Most likely it would be easy to implement within a routine even with pointer to memory, although pointers to memory would require a great deal of stack, basically one stack per word of changed memory.
Disclosed by International Business Machines Corporation