1226 search results - page 27 / 246 » Generating Abstractions from Static Domain Analysis |
RTCSA
2000
IEEE
14 years 2 months ago
2000
IEEE
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
TACAS
2009
Springer
14 years 5 months ago
2009
Springer
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
DCOSS
2011
Springer
12 years 10 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
COMPGEOM
2008
ACM
13 years 12 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
BIS
2009
13 years 11 months ago
2009
Abstract. The quality of today's digital maps is very high. This allows for new functionality as illustrated by modern car navigation systems (e.g., TomTom, Garmin, etc.), Goo...