We consider the evaluation of first-order queries over classes of databases with bounded expansion. The notion of bounded expansion is fairly broad and generalizes bounded degree, bounded treewidth and exclusion of at least one minor. It was known that over a class of databases with bounded expansion, firstorder sentences could be evaluated in time linear in the size of the database. We give a ...

BLOCKIN We BLOCKIN BLOCKIN have BLOCKIN BLOCKIN been asked by the editors of the Journal of Philosophical Logic to write a short comment on his most recent work, published in this issue, based in part on a referee report by one of us, that, unfortunately, did not reach Aldo in time.

Model finders are becoming useful in many software engineering problems. Kodkod [19] is one of the most popular, due to its support for relational logic (a combination of first order logic with relational algebra operators and transitive closure), allowing a simpler specification of constraints, and support for partial instances, allowing the specification of a priori (exact, but potentially pa...

Assuming a first-order auto-regressive model for the auto-correlation structure between observations, in this paper, a transformation method is first employed to eliminate the effect of auto-correlation. Then, a maximum likelihood estimator (MLE) of a step change in the parameters of the transformed model is derived and three separate EWMA control charts are used to monitor the parameters of th...

In this paper we investigate to what extent a very simple and natural ”reachability as deducibility” approach, originating in research on formal methods for security, is applicable to the automated verification of large classes of infinite state and parameterized systems. This approach is based on modeling the reachability between (parameterized) states as deducibility between suitable encoding...

This paper is concerned with the interplay of the expressiveness of model and graph transformation languages, of assertion formalisms making correctness statements about transformations, and the decidability of the resulting verification problems. We put a particular focus on transformations arising in graph-based knowledge bases and model-driven engineering. We then identify requirements that ...

The task of designing large real-time reactive systems, which interact continuously with their environment and exhibit concurrency properties, is a challenging one. In this paper, we explore the utility of a combination of behavior and function specification languages in specifying such systems and verifying their properties. An existing specification language, statecharts, is used to specify t...

In this paper we apply the UML-RSDS notation and tools to the “Hello World” case studies and explain the underlying development process for this model transformation approach. 1 Specification of model transformations In UML-RSDS a transformation specification is written in first-order logic and OCL, and consists of one or more predicates: 1. A global specification, Cons, of a model transformati...