LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B¨uchi automaton for the negation of the formula ...
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...
In this paper, we design and evaluate alternative selection placement strategies for optimizing a very large number of continuous queries in an Internet environment. Two grouping ...
Jianjun Chen, David J. DeWitt, Jeffrey F. Naughton
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...