Boolean logic in a state machine lattice
US-9509312-B2 · Nov 29, 2016 · US
State machine control of a debugger
US9110682B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9110682-B2 |
| Application number | US-201213655480-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 19, 2012 |
| Priority date | Oct 19, 2012 |
| Publication date | Aug 18, 2015 |
| Grant date | Aug 18, 2015 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
A debugger utilizes a finite state machine to control when execution of a software application is suspended. The finite state machine uses breakpoints as transitions that move the finite state machine from a start state to an acceptance state. The debugger tracks when breakpoints used in the finite state machine occur. When the finite state machine reaches an acceptance state, the debugger suspends execution of the software application to allow a developer to observe and/or alter the program state or software application. The finite state machine may be generated by a developer as a graph or as a regular expression that is then converted into a finite state machine. In this manner, a developer may specify more complex conditions upon which to suspend execution of a debugger.
First claim
Opening claim text (preview).
What is claimed: 1. A computer-implemented method for debugging a software application, the computer-implemented method comprising the steps of: receiving a set of breakpoints, the set of breakpoints part of a finite state machine (FSM), the FSM having a set of states, the set of states including a start state and at least one acceptance state, each state connected to another state by at least one of the set of breakpoints, a state transitions to another state upon occurrence of a…
Assignees
Inventors
Classifications
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
- G06F9/444Primary
Physics · mapped topic
- G06F9/4498Primary
Physics · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US9110682B2 cover?
- A debugger utilizes a finite state machine to control when execution of a software application is suspended. The finite state machine uses breakpoints as transitions that move the finite state machine from a start state to an acceptance state. The debugger tracks when breakpoints used in the finite state machine occur. When the finite state machine reaches an acceptance state, the debugger susp…
- Who is the assignee on this patent?
- Microsoft Corp, Microsoft Technology Licensing Llc
- What technology area does this patent fall under?
- Primary CPC classification G06F9/444. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Aug 18 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).