506 search results - page 6 / 102 » Proving Properties about Lists Using Containers |
FTCS
1998
14 years 11 months ago
1998
Most RAID controllers implemented in industry are complicated and di cult to reason about. This complexity has led to software and hardware systems that are di cult to debug and h...
91
Voted
ENTCS
2008
14 years 9 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
72
Voted
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
We prove several results about the relations between injectivity and surjectivity for sand automata. Moreover, we begin the exploration of the dynamical behavior of sand automata ...
SEFM
2007
IEEE
15 years 3 months ago
2007
IEEE
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
159
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...