loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
29th Annual IEEE/NASA Software Engineering Workshop
A Provable Algorithm for Reconfiguration in Embedded Reconfigurable Computing
Greenbelt, Maryland
April 06-April 07
ISBN: 0-7695-2306-4
ASCII Text
x 
 
Phan C. Vinh, Jonathan P. Bowen, "A Provable Algorithm for Reconfiguration in Embedded Reconfigurable Computing," Software Engineering Workshop, Annual IEEE/NASA Goddard, pp. 245-252, 29th Annual IEEE/NASA Software Engineering Workshop, 2005.
 
 
BibTex
x
 
@article{ 10.1109/SEW.2005.14,
author = {Phan C. Vinh and Jonathan P. Bowen},
title = {A Provable Algorithm for Reconfiguration in Embedded Reconfigurable Computing},
journal ={Software Engineering Workshop, Annual IEEE/NASA Goddard},
volume = {0},
year = {2005},
isbn = {0-7695-2306-4},
pages = {245-252},
doi = {http://doi.ieeecomputersociety.org/10.1109/SEW.2005.14},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering Workshop, Annual IEEE/NASA Goddard
TI - A Provable Algorithm for Reconfiguration in Embedded Reconfigurable Computing
SN - 0-7695-2306-4
SP245
EP252
A1 - Phan C. Vinh,
A1 - Jonathan P. Bowen,
PY - 2005
KW - null
VL - 0
JA - Software Engineering Workshop, Annual IEEE/NASA Goddard
ER -
 
Phan C. Vinh, London South Bank University Centre for Applied Formal Methods, Institute for Computing Research, UK
Jonathan P. Bowen, London South Bank University Centre for Applied Formal Methods, Institute for Computing Research, UK

Dynamically reconfigurable computing within embedded computer-based systems can be partially modified at runtime without stopping the operation of the whole system. In this paper, a provable algorithm for runtime evolution of a logical configuration is formally represented by the appropriate graph transformation. In other words, programming is considered as a visual transformation of the logical configuration by the formulated rules. Their soundness is proved. A logical configuration in evolution is provable from another by applying these rules. Subsequently, an algorithmic approach to programming is formally developed and analyzed.

Citation:
Phan C. Vinh, Jonathan P. Bowen, "A Provable Algorithm for Reconfiguration in Embedded Reconfigurable Computing," sew, pp.245-252, 29th Annual IEEE/NASA Software Engineering Workshop, 2005
Usage of this product signifies your acceptance of the Terms of Use.