We propose a naive version of action semantics that begins with a selection of “transient” and “persistent” facets, each characterized as a partial monoid. Yielders are de...
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Security patterns capture best practice on secure software design and development. They document typical solutions to security problems. To ensure security, large software system ...
We investigate, in a process algebraic setting, a new notion of compliance that we call strong service compliance: composed services are strong compliant if their composition is bo...