Approximating finite domains in symbolic state exploration
US8533680B2 · kind B2 · utility
2Cited by
4References
19Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Dec 30, 2005 |
| Grant date | Sep 10, 2013 |
| Priority date | — |
| Expiry date | Aug 30, 2029 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F11/3672
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A finite domain approximation for symbolic terms of a symbolic state is derived, given some finite domains for basic terms of the symbolic state. A method is executed recursively for symbolic sub-terms of a symbolic term, providing a domain over-approximation that can then be provided to a solver for determining a more accurate domain. The method can be applied to a wide array of system terms, including, for example, object states, arrays, and runtime types.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.