Sciweavers

5086 search results - page 242 / 1018
» The Power of Comparative Reasoning
Sort
View
PLDI
2010
ACM
16 years 3 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
TIME
2005
IEEE
16 years 3 days ago
Version Management and Historical Queries in Digital Libraries
Historical information can be effectively preserved using XML and searched through powerful historical queries written in XQuery. Indeed, by storing the successive versions of a d...
Fusheng Wang, Carlo Zaniolo, Xin Zhou, Hyun J. Moo...
FUZZIEEE
2007
IEEE
15 years 10 months ago
A System for Querying with Qualitative Distances in Networks
A central role of Geographic Information Systems (GIS) is to allow the identification and visualisation of relevant spatial features from typically large volumes of data. This requ...
Carl P. L. Schultz, Hans W. Guesgen, Robert Amor
LICS
1998
IEEE
15 years 10 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
MASCOTS
2004
15 years 8 months ago
Disk Scrubbing in Large Archival Storage Systems
Large archival storage systems experience long periods of idleness broken up by rare data accesses. In such systems, disks may remain powered off for long periods of time. These s...
Thomas J. E. Schwarz, Qin Xin, Ethan L. Miller, Da...