294 search results - page 46 / 59 » Formal Verification of the Implementability of Timing Requir... |
ICSE
2004
IEEE-ACM
14 years 8 months ago
2004
IEEE-ACM
Despite their benefits, programmers rarely use formal specifications, because they are difficult to write and they require an up front investment in time. To address these issues,...
DAM
2011
13 years 3 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
CAV
2009
Springer
14 years 9 months ago
2009
Springer
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
In today's society, people have very little control over what kinds of personal data are collected and stored by various agencies in both the private and public sectors. We de...
OSDI
2006
ACM
14 years 8 months ago
2006
ACM
Storage systems such as file systems, databases, and RAID systems have a simple, basic contract: you give them data, they do not lose or corrupt it. Often they store the only copy...