ACM Home Page
Please provide us with feedback. Feedback
Verification of timed erlang/OTP components using the process algebra μcrl
Full text PdfPdf (383 KB)
Source
Annual ERLANG Workshop archive
Proceedings of the 2007 SIGPLAN workshop on ERLANG Workshop table of contents
Freiburg, Germany
SESSION: Semantics and communication table of contents
Pages: 55 - 64  
Year of Publication: 2007
ISBN:978-1-59593-675-2
Authors
Qiang Guo  The University of Sheffield
John Derrick  The University of Sheffield
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 33,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1292520.1292529
What is a DOI?

ABSTRACT

Recent work has looked at how Erlang programs could be model-checked via translation into the process algebra μCRL. Rules for translating Erlang programs and OTP components into μCRL have been defined and investigated. However, in the existing work, no rule is defined for the translation of timeout events into μCRL. This could degrade the usability of the existing work as in some real applications, timeout events play a significant role in the system development. In this paper, by extending the existing work, we investigate the verification of timed Erlang/OTP components in μCRL. By using an explicit tick action in the μCRL specification, a discrete-time timing model is defined to support the translation of timed Erlang functions into μCRL. Two small examples are presented, which demonstrates the applications of the proposed approach.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
T. Arts, C. Benac-Earle, and Juan José Sánchez Penas. Translating Erlang to μCRL. In The Fourth International Conference on Application of Concurrency to System Design (ACSD'04), pages 135--144. IEEE Computer Society, June 2004.
 
4
 
5
C. Benac-Earle. Model checking the interaction of Erlang components. PhD thesis, The University of Kent, Canterbury, Department of Computer Science, 2006.
 
6
C. Benac-Earle and Lars-Åke Fredlund. Verification of Language Based Fault-Tolerance. In Roberto Moreno-Díaz, Franz Pichler, and Alexis Quesada-Arencibia, editors, EUROCAST, pages 140--149. Springer-Verlag, February 2005.
7
 
8
S. Blom, N. Ioustinova, and N. Sidorova. Timed verification with μCRL. In Manfred Broy and Alexandre V. Zamulin, editors, 5th Andrei Ershov International Conference on Perspectives of System Informatics PSI'2003, volume 2890 of LNCS, pages 178--192. Springer-Verlag, July 2003.
 
9
 
10
CADP. http://www.inrialpes.fr/vasy/cadp/.
 
11
 
12
Lars-Åke Fredlund, D. Gurov, T. Noll, M. Dam, T. Arts, and G. Chugunov. A verification tool for Erlang. International Journal on Software Tools for Technology Transfer, 4(4):405--420, August 2003.
 
13
 
14
J. F. Groote and A. Ponse. The syntax and sematics of μCRL. In Algebra of Communicating Processes 1994, Workshop in Computing, pages 26--62, 1995.
 
15
Q. Guo. Verifying Erlang/OTP Components in μCRL. In John Derrick and Jüri Vain, editors, FORTE'07, volume 4574 of LNCS, pages 227--246. Springer-Verlag, June 2007.
 
16
Q. Guo and J. Derrick. Eliminating overlapping of pattern matching when verifying Erlang programs in μCRL. In 12th International Erlang User Conference (EUC'06), Stockholm, Sweden, 2006.
 
17
18
 
19
D. Kozen. Results on the propositional μ-calculus. Theortical Computer Science, 27:333--354, 1983.
 
20
K. Larsen, P. Pettersson, and W. Yi. UPPAAL in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1-2):134--152, October 1997.