Thumbnail Image
Publication

Conventional verification for unconventional computing: a genetic XOR gate example

Konur, Savas
; 
Gheorghe, Marian
; 
Dragomir, C.
; 
Ipate, F.
; 
Krasnogor, N.
Publication Date
2014
End of Embargo
Supervisor
Keywords
Unconventional computation; Non-standard programming frameworks; Conventional verification tools; Genetic XOR gate
Rights
Peer-Reviewed
Yes
Open Access status
Accepted for publication
Institution
Department
Awarded
Embargo end date
Collections
Engineering and Digital Technology Publications
Show all metadata
Files
To keep suppressed, SHERPA states that no versions allowed to be included in repositories
Adobe PDF, 915.41 KB
Additional title
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.
URI
http://hdl.handle.net/10454/11905
Version
No full-text in the repository
Citation
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 publisher’s version
Link to published version
Link to Version of Record
https://doi.org/10.3233/FI-2014-1093
Type
Article
Qualification name
Notes