uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Analysing Fault Tolerance for Erlang Applications
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Computer Systems. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2009 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

ERLANG is a concurrent functional language, well suited for distributed, highly concurrent and fault-tolerant software. An important part of Erlang is its support for failure recovery. Fault tolerance is provided by organising the processes of an ERLANG application into tree structures. In these structures, parent processes monitor failures of their children and are responsible for their restart. Libraries support the creation of such structures during system initialisation.A technique to automatically analyse that the process structure of an ERLANG application from the source code is presented. The analysis exposes shortcomings in the fault tolerance properties of the application. First, the process structure is extracted through static analysis of the initialisation code of the application. Thereafter, analysis of the process structure checks two important properties of the fault handling mechanism: 1) that it will recover from any process failure, 2) that it will not hide persistent errors.The technique has been implemented in a tool, and applied it to several OTP library applications and to a subsystem of a commercial system the AXD 301 ATM switch.The static analysis of the ERLANG source code is achieved through symbolic evaluation. The evaluation is peformed according to an abstraction of ERLANG’s actual semamtics. The actual semantics is formalised for a nontrivial part of the language and it is proven that the abstraction of the semantics simulates the actual semantics.

Place, publisher, year, edition, pages
Uppsala: Acta Universitatis Upsaliensis , 2009. , 178 p.
Series
Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1104-2516 ; 86
Keyword [en]
formal methods, symbolic evaluation, fault tolerance, erlang
National Category
Computer Engineering
Research subject
Computer Systems
Identifiers
URN: urn:nbn:se:uu:diva-101975ISBN: 978-91-554-7532-1 (print)OAI: oai:DiVA.org:uu-101975DiVA: diva2:213697
Public defence
2009-06-03, Room 2446, Polacksbacken, Lägerhyddsvägen 2D, Uppsala, 13:00 (English)
Opponent
Supervisors
Projects
ASTEC
Available from: 2009-05-13 Created: 2009-04-28 Last updated: 2011-02-18Bibliographically approved

Open Access in DiVA

fulltext(3375 kB)1949 downloads
File information
File name FULLTEXT01.pdfFile size 3375 kBChecksum SHA-512
1707fbda30b2e9adb9e6c57f7e93336d417a268420a4473b48c18d16726e34d72c0840ee3c180bcf8c0cb48839cedbaa33c5dcaebb6d4f65f9a4bcad3fd6ee71
Type fulltextMimetype application/pdf
Buy this publication >>

By organisation
Division of Computer SystemsComputer Systems
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 1949 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 1239 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf