Specification, Testing and Verification of Unconventional Computations using Generalised X-Machines

There are as yet no fully comprehensive techniques for specifying, verifying and testing unconventional computations. In this paper we propose a generally applicable and designer-friendly specification strategy based on a generalised variant of Eilenberg's X-machine model of computation. Our approach, which extends existing approaches to SXM test-based verification, is arguably capable of modelling very general unconventional computations, and would allow implementations to be verified fully against their specifications.