315 search results - page 47 / 63 » Reasoning about Assignments in Recursive Data Structures |
126
click to vote
IROS
2007
IEEE
15 years 8 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
PLDI
2010
ACM
15 years 11 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
109
click to vote
FMSD
2006
15 years 1 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
109
click to vote
SIGSOFT
2008
ACM
16 years 2 months ago
2008
ACM
Getting the right software requirements under the right environment assumptions is a critical precondition for developing the right software. This task is intrinsically difficult....
125
click to vote
VIS
2009
IEEE
16 years 3 months ago
2009
IEEE
Many techniques have been proposed to show uncertainty in data visualizations. However, very little is known about their effectiveness in conveying meaningful information. In this ...