The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
We propose a calculus of local equations over one-way measurement patterns [1], which preserves interpretations, and allows the rewriting of any pattern to a standard form where e...
Technologies for overcoming heterogeneities between autonomous data sources are key in the emerging networked world. In this paper we discuss the initial results of a formal inves...
George H. L. Fletcher, Catharine M. Wyss, Edward L...
Abstract. The need to use position-dependent parameters often hamdefinition of flexible, extensible, and reusable abstractions for software composition. This observation has led ...