506 search results - page 8 / 102 » Proving Properties about Lists Using Containers |
100
click to vote
DM
1998
14 years 9 months ago
1998
We give a counterexample to a conjecture by Wild about binary matroids. We connect two equivalent lines of research in matroid theory: a simple type of basis-exchange property and ...
TACAS
2007
Springer
15 years 3 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
VLDB
2011
ACM
14 years 4 months ago
2011
ACM
A large number of web pages contain data structured in the form of “lists”. Many such lists can be further split into multi-column tables, which can then be used in more seman...
FLAIRS
2000
14 years 11 months ago
2000
Traditional benchmarking methods for information retrieval (IR) are based on experimental performance evaluation. Although the metrics precision and recall can measure the perform...
TACAS
1999
Springer
15 years 1 months ago
1999
Springer
We consider the problem of computing concrete diagnostics for timed automata and reachability properties. Concrete means containing information both about the discrete state change...