Abstract. In this paper, we consider two particular problems of directed graph matching. The ļ¬rst problem concerns graphs with nodes that have been subdivided into classes of diļ...
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a ļ¬rst-order data processing language with reļ¬nement...