Autonomous vehicle simulation system
US-2024001921-A1 · Jan 4, 2024 · US
Mixed numeric and string constraint analysis
US8996922B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8996922-B2 |
| Application number | US-201213683921-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 21, 2012 |
| Priority date | Nov 21, 2012 |
| Publication date | Mar 31, 2015 |
| Grant date | Mar 31, 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 of determining whether a set of constraints is satisfiable may include identifying a set of constraints associated with a software module. The method may also include modeling a string associated with a string constraint of the set of constraints as a parameterized array. Further, the method may include determining the satisfiability of the set of constraints based on a representation of the string constraint as a quantified expression. The satisfiability of the set of constraints may also be based on elimination of a quantifier associated with the quantified expression such that the string constraint is represented as a numeric constraint. The representation of the string constraint as a quantified expression may be based on the parameterized array that is associated with the string.
First claim
Opening claim text (preview).
What is claimed is: 1. A method of determining whether a set of constraints is satisfiable, the method comprising: identifying a set of constraints associated with a software module; modeling a string associated with a string constraint of the set of constraints as a parameterized array; and determining a satisfiability of the set of constraints based on a representation of the string constraint as a quantified expression and based on elimination of a quantifier associated wit…
Assignees
Inventors
Classifications
- G06F11/362Primary
Physics · mapped topic
- G06F11/3684Primary
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 US8996922B2 cover?
- A method of determining whether a set of constraints is satisfiable may include identifying a set of constraints associated with a software module. The method may also include modeling a string associated with a string constraint of the set of constraints as a parameterized array. Further, the method may include determining the satisfiability of the set of constraints based on a representation …
- Who is the assignee on this patent?
- Fujitsu Ltd
- What technology area does this patent fall under?
- Primary CPC classification G06F11/362. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Mar 31 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).