Conventional verification for unconventional computing: a genetic XOR gate example
Abstract
As unconventional computation matures and non-standard programming frameworks are demonstrated, the need for formal verification will become more prevalent. This is so because “programming” in unconventional substrates is difficult. In this paper we show how conventional verification tools can be used to verify unconventional programs implementing a logical XOR gate.Version
No full-text in the repositoryCitation
Konur S, Gheorghe M, Dragomir C et al (2014) Conventional verification for unconventional computing: a genetic XOR gate example. Fundamenta Informaticae. 134(1-2): 97-110.Link to Version of Record
https://doi.org/10.3233/FI-2014-1093Type
Articleae974a485f413a2113503eed53cd6c53
https://doi.org/10.3233/FI-2014-1093