- In order to accomplish independence on the logical data organization, a relational DBMS must be capable of interpreting query language sentences which reference attributes belong...
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
The Hoare approach to program verification relies on the construction and discharge of verification conditions (VCs) but offers no support to trace, analyze, and understand the VCs...
Abstract. Web services are increasingly used for building enterprise information systems according to the Service Oriented Architecture (Soa) paradigm. We propose in this paper a t...
Abstract. There are two main traditions in defining a semantics for agent communication languages, based either on mental attitudes or on social commitments. In this paper, we tran...