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

A More Accurate Semantics for Distributed Erlang

Hans Svensson (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)) ; Lars-Åke Fredlund
Proceedings of the ACM SIGPLAN 2007 Erlang Workshop p. 43-54. (2007)
[Konferensbidrag, refereegranskat]

In order to formally reason about distributed Erlang systems, it is necessary to have a formal semantics. In a previous paper we have proposed such a semantics for distributed Erlang. However, recent work with a model checker for Erlang revealed that the previous attempt was not good enough. In this paper we present a more accurate semantics for distributed Erlang. The more accurate semantics includes several modifications and additions to the semantics for distributed Erlang proposed by Claessen and Svensson in 2005, which in turn is an extension to Fredlund's formal single-node semantics for Erlang. The most distinct addition to the previous semantics is the possibility to correctly model disconnected nodes.



Denna post skapades 2007-10-08.
CPL Pubid: 52078

 

Institutioner (Chalmers)

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

Ämnesområden

Programvaruteknik

Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:


Verification of Distributed Erlang Programs using Testing, Model Checking and Theorem Proving