Determining the semantic similarity is an important issue in the development of semantic search technology. In this paper, we propose an approach to determining the semantic simil...
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
A common assumption for many process-centred support environments is that they provide the same process support at different levels of the organization. We believe that the requir...
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...