Interaction design for domains that involve complex abstractions can prove challenging. This problem is particularly acute in domains where the intricate nature of domain-specific knowledge can be difficult for even the most experienced expert to conceptualise or articulate. One promising solution to the problem of representing complex domain abstractions involves the use of conceptual metaphor...

As part of a comprehensive design concept for complex re-active systems we investigate the derivation of formal requirements and design speciications at systems level. We discuss the meaning of cor-rectness with respect to the embedding of mathematical models into the physical world. A crucial aspect in our attempt to make the logic link between the application domain speciic view and the forma...

In his categorical framework, Stark defines a domain-theoretic model for the π-calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize Stark’s denotational model for the π-calculus and provide a full definition of the semantic domains...

In the context of standard abstract interpretation theory, a reduced relative power operation for functionally composing abstract domains is introduced and studied. The reduced relative power of two abstract domains DI (the exponent) and DZ (the base) consists in a suitably defined lattice of monotone functions from DI to Dz, called dependencies, and it is a generalization of the Cousot and Cou...

We propose a new approach to heap analysis through an abstract domain of automata, called automatic shapes. The abstract do-domain of automata, called automatic shapes. The abstract domain uses a particular kind of automata, called quantified data automata on skinny trees (QSDAs), that allows to define universally quantified properties of singly-linked lists. To ensure convergence of the abstra...