| Thread algebra for SANE virtual processors. Available at http://staff.science.uva.nl/ ∼ jesshope (2009) | |||||||||||||||
Abstract | |||||||||||||||
| Abstract. This paper presents a formal approach to the verification and evaluation of a programming/machine model being developed at the University of Amsterdam, called the SANE Virtual Processor (SVP). The model is being used as a basis for designing and programming chip multiprocessors and to support self-adaptive computation. This model can provide solutions for effectively programming distributed multiprocessor systems [12, 13, 17]. We take thread algebra [11], a semantics for recent object-oriented programming languages such as C # and Java, as a theoretical framework of our approach. We model the basic interleaving strategies used in SVP, and show in thread algebra that the SVP programs has a desired property, i.e. they are communication-deadlock free. 1 | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||