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

A Semantics for Distributed Erlang

Koen Claessen (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)) ; Hans Svensson (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers))
Proceedings of the ACM SIGPLAN 2005 Erlang Workshop (2005)
[Konferensbidrag, refereegranskat]

We propose an extension to Fredlund's formal semantics for Erlang that models the concept of nodes. The motivation is that there exist sequences of events that can occur in practice, but are impossible to describe using a single-node semantics, such as Fredlund's. The consequence is that some errors in distributed systems might not be detected by model checkers based on Fredlund's original semantics, or by other single-node verification techniques such as testing. Our extension is modest; it re-uses most of Fredlund's work but adds an extra layer at the top-level.

Nyckelord: Erlang, semantics, distributed systems, verification

Denna post skapades 2006-08-25. Senast ändrad 2013-08-12.
CPL Pubid: 11246


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)


Datavetenskap (datalogi)

Chalmers infrastruktur