Alloy is a declarative language for lightweight modelling and analysis of software. The core of the language is based on first-order relational logic, which offers an attractive balance between analysability and expressiveness. The logic is expressive enough to capture the intricacies of real systems, but is also simple enough to support fully automated analysis with the Alloy Analyzer. The Analyzer is built on a SAT-based constraint solver and provides automated simulation, checking and debugging of Alloy specifications. Because of its automated analysis and expressive logic, Alloy has been applied in a wide variety of domains. These applications have motivated a number of extensions both to the Alloy language and to its SAT-based analysis. This paper provides an overview of Alloy in the context of its three largest application domains, lightweight modelling, bounded code verification and test-case generation, and three recent application-driven extensions, an imperative extension to the language, a compiler to executable code and a proof-capable analyser based on SMT.

We discuss quantum algorithms based on the Bernstein–Vazirani algorithm for finding which input variables a Boolean function depends on. There are 2n possible linear Boolean functions of n input variables; given a linear Boolean function, the Bernstein–Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. We show how the same quantum algorithm can also be used to learn which input variables any other type of Boolean function} depends on. The success probability of learning that the function depends on a particular input variable depends on} the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure based on another quantum algorithm, the Grover search, to amplify further the success probability. Finally, we discuss quantum algorithms for learning the exact form of certain quadratic and cubic Boolean functions.

In this paper we consider general probabilistic theories pertaining to circuits that satisfy two very natural assumptions. We provide a formalism that is local in the following very specific sense: calculations pertaining to any region of space–time employ only mathematical objects associated with that region. We call this formalism locality. It incorporates the idea that space and time should be treated on an equal footing. Formulations that use a foliation of space--time to evolve a state do not have this property, nor do histories-based approaches. An operation has inputs and outputs (through which systems travel), for example,

Have formal methods in computer science come of age? While the contributions to this special issue of Mathematical Structures in Computer Science attest to their importance in the design and analysis of particular software systems, their relevance to the field as a whole is far wider. In recent years, formal methods have become more accessible and easier to use, more directly related to practical problems and more adaptable to imperfect and/or approximate specifications in real-life applications. As a result, they are now a central component of computer-science education and research.

We study how graph states on fractal lattices can be used to perform measurement-based quantum computation, and investigate which topological features allow this application. We find fractal lattices of arbitrary dimension greater than one that all act as good resources for measurement-based quantum computation, and sets of fractal lattices with dimension greater than one that do not. The difference is put down to other topological factors such as ramification and connectivity. This is in direct analogy to the tendency of lattices to observe criticality in spin systems. We also discuss the analogy between thermodynamics and one-way computation in this context. This work adds confidence to the analogy and highlights new features of what we require for universal resources for measurement-based quantum computation. This paper is an extended version of Markham et al. (2010), which appeared in the proceedings of DCM 2010.

We compare three different characterisations of the globalness of bipartite unitary operations, namely, delocalisation power, entanglement cost and entangling power, to investigate the global properties of unitary operations. We show that the globalness of the same unitary operation depends on whether input states are given by unknown states representing pieces of quantum information or a set of known states for the characterisation. We extend our analysis of delocalisation power in two ways. First we show that the delocalisation power differs according to whether the global operation is applied to one piece or two pieces of quantum information. Then we introduce a new task called LOCC one-piece relocation, and prove that the controlled-unitary operations do not have enough delocalisation power to relocate one of two pieces of quantum information by adding LOCC.

We present a simple stochastic rule-based approach to multi-level modelling for computational systems biology. Populations are modelled using multi-level multisets; these contain both species and agents, with the latter possibly containing further such multisets. Rules are pairs of such multisets, but they may now also include variables (as well as species and agents), together with an associated stochastic rate.

We give two illustrative examples. The first is an extracellular model of virus infection, coupled with an intracellular model of viral reproduction; this model can demonstrate successive waves of infection. The second is a model of cell division in which a repressor protein is diluted in successive generations, so eventually repression no longer occurs. The multi-level multiset approach can also be seen in terms of stochastic term rewriting for the theory of a commutative monoid equipped with extra constants (for the species) and unary operations (for the agents). We further discuss the relationship of this approach with two others: Krivine et al.'s stochastic bigraphs, restricted to Milner's place graphs, and Coppo et al.'s Stochastic Calculus of Wrapped Compartments. These various relationships provide evidence for the fundamental nature of the approach.

Lambda-calculi with vectorial structures have been studied in various ways, but their semantics remain largely uninvestigated. The main contribution of this paper is to provide a categorical framework for the semantics of such algebraic lambda-calculi. We first develop a categorical analysis of a general simply typed lambda-calculus endowed with the structure of a module. We study the problems arising from the addition of a fixed-point combinator and show how to modify the equational theory to solve them. The categorical analysis carries nicely over to the modified language. We provide various concrete models for both the case without fixpoints and for the case with them.