A Logic for Reflective ASMs
|K. Schewe, F. Ferrarotti. A Logic for Reflective ASMs. volume 12071, pages 93-106, DOI https://doi.org/10.1007/978-3-030-48077-6_7, 5, 2020.|
|Buch||Rigorous State-Based Methods - Proc. ABZ 2020|
|Serie||Lecture Notes in Computer Science|
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 paper the theory is taken further by an extension of the logic of ASMs to capture inferences on rASMs. 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.