A Semantics for Distributed Erlang
Paper i proceeding, 2005

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.

verification

semantics

Erlang

distributed systems

Författare

Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Datavetenskap

Hans Svensson

Chalmers, Data- och informationsteknik, Datavetenskap

Proceedings of the ACM SIGPLAN 2005 Erlang Workshop

Ämneskategorier

Datavetenskap (datalogi)

ISBN

1-59593-066-3

Mer information

Skapat

2017-10-07