Database transformations provide a unifying framework for database queries and updates. Recently, it was shown that non-deterministic database transformations can be captured exactly by a variant of ASMs, the so-called Database Abstract State Machines (DB-ASMs). In this article we present a logic for DB-ASMs, extending the logic of Nanchen and Stärk for ASMs. In particular, we develop a rigorou...

This paper introduces QuanFruit v1.1, a Java application available for free. (Source code included in the distribution.) Recently, Farhi-Goldstone-Gutmann (FGG) wrote a paper arXiv:quant-ph/0702144 that proposes a quantum algorithm for evaluating NAND formulas. QuanFruit outputs a quantum circuit for the FFG algorithm.

In this work we provide a space complexity analysis of the core language of the LogicGuard framework. Our approach is to abstract away from the formula structure of the core language in order to construct invariants for a recursive function. This final recursive function provided an upper bound for the number of instances of the monitor that need to be kept in memory over any duration of time. ...