349 search results - page 39 / 70 » Recursive Path Orderings Can Also Be Incremental |
ICDT
2003
ACM
14 years 24 days ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
ISSTA
2010
ACM
13 years 9 months ago
2010
ACM
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
GIS
2007
ACM
14 years 8 months ago
2007
ACM
Many Geographic Information System (GIS) applications must handle large geospatial datasets stored in raster representation. Spatial joins over raster data are important queries i...
HPCC
2007
Springer
14 years 1 months ago
2007
Springer
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...