A Logic For Reflective Asms

Reflective algorithms are algorithms that can modify their own behaviour. Recently a behavioural theory of reflective algorithms has been developed, which shows that they are captured by reflective abstract state machines (rASMs). Reflective ASMs exploit extended states that include an updatable representation of the ASM signature and rules to be executed by the machine in that state. Updates to the representation of ASM signatures and rules are realised by means of a sophisticated tree algebra defined in the background of the rASM. In this article the theory is taken further by an extension of the logic of ASMs, by means of which we can formally express properties a reflective algorithm must satisfy. The proof theory associated with the logic then enables static verification of adaptive systems. The key is the introduction of terms that are interpreted by ASM rules stored in some location. We show that fragments of the logic with a fixed bound on the number of steps preserve completeness, whereas the full run-logic for rASMs becomes incomplete. (C) 2021 Elsevier B.V. All rights reserved.