Formalizing SANE virtual processor in thread algebra

Authors:
Thuy Duong Vu;Chris Jesshope
Affiliations:
Sectie Software Engineering, University of Amsterdam, The Netherlands;Computer Systems Architecture Group, University of Amsterdam, The Netherlands
Venue:
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Year:
2007

Citing 8
Cited 2

A Theory of Computer Instructions

Journal of the ACM (JACM)
Communication and Concurrency

Communication and Concurrency
Introduction to Process Algebra

Introduction to Process Algebra
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
A survey of processors with explicit multithreading

ACM Computing Surveys (CSUR)
Micro-Threading: A New Approach to Future RISC

ACAC '00 Proceedings of the 5th Australasian Computer Architecture Conference
A theory of computer instructions

Science of Computer Programming
Instruction Level Parallelism through Microthreading---A Scalable Approach to Chip Multiprocessors

The Computer Journal

Description of a fault tolerance system implemented in a hardware architecture with self-adaptive capabilities

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
A self-adaptive hardware architecture with fault tolerance capabilities

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The SANE Virtual Processor (SVP) is a fine-grain, thread-based model of concurrent program composition developed and used at the University of Amsterdam as a basis for designing and programming many-core chips. Its design goal was to support dynamic concurrency and hence support self-adaptive systems within the AETHER collaborative European project. It provides an effective solution for programming chip multiprocessor systems [1,2,3]. In this paper, we take thread algebra [4], a semantics for recent object-oriented programming languages such as C# and Java, as a theoretical framework to the verification and evaluation of SVP. We show how a SVP program behavior can be determined in TAsvp , an extension of thread algebra with the features of SVP, and prove that SVP programs satisfy the determinism property, i.e. the programs always give the same result, a key property of the sequential paradigm that SVP will replace.