A note on model checking the model &ngr;-calculus
Selected papers of the 16th international colloquium on Automata, languages, and programming
Concurrent programming in ERLANG (2nd ed.)
Concurrent programming in ERLANG (2nd ed.)
A Framework for Formal Reasoning about Open Distributed Systems
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Toward Parametric Verification of Open Distributed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Verifying a Distributed Database Lookup Manager Written in Erlang
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Evaluating distributed functional languages for telecommunications software
Proceedings of the 2003 ACM SIGPLAN workshop on Erlang
Modeling Erlang in the pi-calculus
Proceedings of the 2005 ACM SIGPLAN workshop on Erlang
A semantics for distributed Erlang
Proceedings of the 2005 ACM SIGPLAN workshop on Erlang
Towards automatic verification of Erlang programs by π-calculus translation
Proceedings of the 2006 ACM SIGPLAN workshop on Erlang
A more accurate semantics for distributed erlang
ERLANG '07 Proceedings of the 2007 SIGPLAN workshop on ERLANG Workshop
Equational Abstractions for Model Checking Erlang Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Erlang is a functional programming language with supportfor concurrency and message passing communicationthat is used at Ericsson for developing telecommunicationapplications. We consider the challenge of verifying temporalproperties of systems programmed in Erlang with dynamicallyevolving process structures. To accomplish this arich verification framework for goal-directed, proof system-based verification is used. This paper investigates the problemof semi-automating the verification task by identifyingthe proof parameters crucial for successful proof search.