1686 search results - page 111 / 338 » Programs as polygraphs: computability and complexity |
147
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
138
click to vote
VLSID
2002
IEEE
16 years 3 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
161
click to vote
CRV
2008
IEEE
15 years 10 months ago
2008
IEEE
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
120
Voted
HRI
2006
ACM
15 years 9 months ago
2006
ACM
Robot programmers are faced with the challenging problem of understanding the robot’s view of its world, both when creating and when debugging robot software. As a result tools ...
115
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
system during a single processor cycle. But we can abstract out properties of the sequences and focus on the properties of interest. The "specifications" given here are i...