Show simple item record

dc.contributor.authorKonur, Savas*
dc.contributor.authorGheorghe, Marian*
dc.contributor.authorDragomir, C.*
dc.contributor.authorIpate, F.*
dc.contributor.authorKrasnogor, N.*
dc.date.accessioned2017-05-03T11:56:44Z
dc.date.available2017-05-03T11:56:44Z
dc.date.issued2014
dc.identifier.citationKonur 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.en_US
dc.identifier.urihttp://hdl.handle.net/10454/11905
dc.descriptionNoen_US
dc.description.abstractAs 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.en_US
dc.description.sponsorshipSK and MG acknowledge the EPSRC support (grant number: EP/I031812/1) support; NK’s work is supported by EPSRC (grant numbers: EP/I031642/1, EP/J004111/1, EP/L001489/1). MG and FI are partially supported by CNCS UEFISCDI (grant number: PN-II-ID-PCE-2011-3-0688). CD acknowledges an EPSRC studentship.en_US
dc.language.isoenen_US
dc.relation.isreferencedbyhttp://dx.doi.org/10.3233/FI-2014-1093en_US
dc.subjectUnconventional computation; Non-standard programming frameworks; Conventional verification tools; Genetic XOR gateen_US
dc.titleConventional verification for unconventional computing: a genetic XOR gate exampleen_US
dc.status.refereedYesen_US
dc.typeArticleen_US
dc.type.versionNo full-text in the repositoryen_US


Item file(s)

Thumbnail
Name:
Gheorghe_Fundamenta_Informatic ...
Size:
915.4Kb
Format:
PDF
Description:
To keep suppressed, SHERPA states ...

This item appears in the following Collection(s)

Show simple item record