4 search results - page 1 / 1 » MUNCH - Automated Reasoner for Sets and Multisets |
114
Voted
VMCAI
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
124
Voted
AISC
2010
Springer
15 years 6 months ago
2010
Springer
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...
106
Voted
SIGMOD
1996
ACM
15 years 5 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
115
Voted
ADAEUROPE
2003
Springer
15 years 6 months ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...