No / 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. / SK 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.
| Identifer | oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/11905 |
| Date | January 2014 |
| Creators | Konur, Savas, Gheorghe, Marian, Dragomir, C., Ipate, F., Krasnogor, N. |
| Source Sets | Bradford Scholars |
| Language | English |
| Detected Language | English |
| Type | Article, No full-text in the repository |
Page generated in 0.002 seconds