Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Conventional paging systems do not perform well with large object-oriented environments (such as Smalltalk-801 [GR83]) due to the fine granularity of objects and the persistence o...