Model Checking Erlang Programs – Abstracting Recursive Function Calls
7
TL;DR: An abstraction of the control-flow that replaces the recursive calls in non-tail positions by jumps to the last call of the same function, which is safe for all properties that have to hold on all paths of a system, like properties in LTL.
read more
About: This article is published in Electronic Notes in Theoretical Computer Science. The article was published on 01 Sep 2002. and is currently open access. The article focuses on the topics: Abstraction model checking & Erlang (programming language).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A general method for rendering static analyses for diverse concurrency models modular
TL;DR: The ModConc method transforms an abstract concurrent semantics modeling processes and communication into a modular static analysis treating the behavior of processes separately from their communication, and demonstrates its applicability by instantiating it for multi-threaded and actor-based programs.
14
•Book
Verification of Message Passing Concurrent Systems
Emanuele D'Osualdo
- 21 Nov 2016
TL;DR: This dissertation is concerned with the development of fully-automatic methods of verification, for message-passing based concurrent systems, and defines a sound parametric control-flow analysis for Erlang, which is used to bootstrap the construction of an abstract model that is called Actor Communicating System.
7
From software architecture to formal verification of a distributed system
Juan José Sánchez Penas
- 01 Jan 2006
TL;DR: Usando diversas herramientas del area, proponemos un metodo innovador para extraer de forma automatica informacion sobre rendimiento para mejorar la calidad del sistema.
4
Model checking Erlang programs – LTL-propositions and abstract interpretation
Frank Huch
- 01 Jan 2004
TL;DR: An approach for the formal verification of Erlang programs using abstract interpretation and model checking and it is shown how state propositions must be satisfied, negated state propositions have to be refuted by means of the abstract domain.
Automatic Verification of Erlang-Style Concurrency
TL;DR: In this paper, an abstract model of Lambda-Actor programs called Actor Communicating System (ACS) is formalised, which has a natural interpretation as a vector addition system, for which some verification problems are decidable.
References
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
Patrick Cousot,Radhia Cousot +1 more
- 01 Jan 1977
TL;DR: In this paper, the abstract interpretation of programs is used to describe computations in another universe of abstract objects, so that the results of abstract execution give some information on the actual computations.
•Book
The Temporal Logic of Reactive and Concurrent Systems: Specification
Amir Pnueli,Zohar Manna +1 more
- 18 Dec 1991
TL;DR: An introduction to temporal logic and a computational model for reactive systems .
3.6K
•Book
The temporal logic of reactive and concurrent systems
Zohar Manna,Amir Pnueli +1 more
- 01 Jan 1992
TL;DR: Temporal logic is a formal tool/language which yields excellent results in specifying reactive systems, and this volume (the first two), offers an introduction to temporal logic and to the computational model for reactive programs which has been developed by the authors as mentioned in this paper.
3K
Model Checking JAVA Programs Using Java Pathfinder
TL;DR: An effort to formally analyze, using Spin, a multi-threaded operating system for the Deep-Space 1 space craft, and of previous work in applying existing model checkers and theorem provers to real applications.