CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A Machine Verified Distributed Sorting Algorithm

Jörgen H. Andersen ; Ed Harcourt ; K. V. S. Prasad (Institutionen för datavetenskap)
Aarhus, Denmark. : BRICS Report Series RS-96-4, Department of Computer Science University of Aarhus., 1996.
[Rapport]

We present a verification of a distributed sorting algorithm in ALF, an implementation of Martin Löf's type theory. The implementation is expressed as a program in a priortized version of CBS, (the Calculus of Broadcasting Systems) which we have implemented in ALF. The specification is expressed in terms of an ALF type which represents the set of all sorted lists and an HML (Hennesey-Milner Logic) formula which expresses that the sorting program will input any number of data until it hears a value triggering the program to begin outputting the data in a sorted fashion. We gain expressive power from the type theory by inheriting the language of data, state expressions, and propositions.



Denna post skapades 2014-02-04.
CPL Pubid: 193433

 

Institutioner (Chalmers)

Institutionen för datavetenskap (1993-2001)

Ämnesområden

Datavetenskap (datalogi)

Chalmers infrastruktur