A Provable Algorithm for Reconfiguration in Embedded Reconfigurable Computing

Authors:
Phan C. Vinh;Jonathan P. Bowen
Affiliations:
London South Bank University Centre for Applied Formal Methods, Institute for Computing Research, UK;London South Bank University Centre for Applied Formal Methods, Institute for Computing Research, UK
Venue:
SEW '05 Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop
Year:
2005

Citing 0
Cited 2

Formalization of data flow computing and a coinductive approach to verifying flowware synthesis

Transactions on computational science I
Data intensive distributed computing in data aware self-organizing networks

Transactions on Computational Science XV

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.