140 search results - page 28 / 28 » Orderings and Constraints: Theory and Practice of Proving Te... |
ANCS
2009
ACM
13 years 3 months ago
2009
ACM
The problem of maintaining efficiently a large number (say millions) of statistics counters that need to be updated at very high speeds (e.g. 40 Gb/s) has received considerable re...
PLDI
2011
ACM
12 years 8 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
In today's Internet applications or sensor networks we often encounter large amounts of data spread over many physically distributed nodes. The sheer volume of the data and ba...
COOPIS
2002
IEEE
13 years 10 months ago
2002
IEEE
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
SDB
1995
13 years 8 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...