Semi-automated verification of Erlang code

Erlang is a functional programming language with support for concurrency and message passing communication that is widely used at Ericsson for developing telecommunication applications. We consider the challenge of verifying temporal properties of Erlang programs, which are used to implement systems with dynamically evolving process structures and unbounded data. This is a hard task, which requires a rich verification framework. Building upon such a framework for goal-directed, proof system--based verification, the paper investigates the problem of semi--automating this task by identifying the proof parameters crucial for successful proof search

Semi-Automated Verification of Erlang Code

Erlang is a functional programming language with support for concurrency and message passing communication that is widely used at Ericsson for developing telecommunication applications. We consider the challenge of verifying temporal properties of Erlang programs which are used to implement systems with dynamically evolving process structures and unbounded data. This is a hard task, which requires a rich verification framework. Building upon such a framework for goal-directed, proof system–based verification, the paper investigates the problem of semi–automating this task by identifying the proof parameters crucial for successful proof search. I