Modeling memory use of applications
US-9519566-B2 · Dec 13, 2016 · US
Method for divergence analysis of pointer-based program
US9201636B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9201636-B2 |
| Application number | US-201314086481-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 21, 2013 |
| Priority date | Nov 21, 2013 |
| Publication date | Dec 1, 2015 |
| Grant date | Dec 1, 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 method comprises generating an intermediate representation of a pointer-based program; providing a control flow graph of the intermediate representation; selecting an analysis candidate from the intermediate representation as a traced variable and a root node; determining a definition site of the trace variable according to a use-define chain and the control flow graph; defining a node for each definition site variable; defining an edge by using each definition site variable and the traced variable; using each definition site variable of the definition site as a traced variable; repeating the steps of determining a definition site, defining a node, defining an edge and using each definition site to obtain a divergence relation graph; transforming the divergence relation graph into a directed acyclic graph; and determining whether the analysis candidate is divergent or not according to a divergent node and the directed acyclic graph.
First claim
Opening claim text (preview).
What is claimed is: 1. A computer-implemented divergence analysis method for a pointer-based program, comprising: generating an intermediate representation of a pointer-based program, wherein the intermediate representation is at least in gated single static assignment form; providing a control flow graph of the intermediate representation; selecting a variable of the intermediate representation as an analysis candidate; using the analysis candidate as a traced variable and…
Assignees
Inventors
Classifications
- G06F8/434Primary
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 US9201636B2 cover?
- A method comprises generating an intermediate representation of a pointer-based program; providing a control flow graph of the intermediate representation; selecting an analysis candidate from the intermediate representation as a traced variable and a root node; determining a definition site of the trace variable according to a use-define chain and the control flow graph; defining a node for ea…
- Who is the assignee on this patent?
- Nat Univ Tsing Hua
- What technology area does this patent fall under?
- Primary CPC classification G06F8/434. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Dec 01 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).