System description: Verification of distributed Erlang programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1421, Issue , 1998, Pages 38-41

  Arts, Thomas ^a   Dam, Mads ^b   Fredlund, Lars åke ^b   Gurov, Dilian ^b  

^a ERICSSON RADIO SYSTEMS AB   (Sweden)

^b SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 22044450102     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054244     Document Type: Conference Paper

References (9)

1. [AVWW96] J. Armstrong, R. Verding, C. Wikström and M. Wiliams, Concurrent Programming in Erlang. 2: nd edition, Pretence Hall, 1996.
2. [Dam95] M. Dam, Compositional proof systems for model checking infinite state processes. In Proceedings CONCUR'95, LNCS 962, p. 12-26, 1995.
3. [DFG98] M. Dam, L.-Å. Fredlund and D. Gurov, Toward Parametric Verification of Open Distributed Systems. To appear in: H. Langmaack, A. Pnueli, W.-P. De Roever (eds.), Compositionality: The Significant Difference, Springer Verlag, 1998.
4. [EL86] E.A. Emerson and C. Lei, Efficient model checking in fragments of the prepositional mu-calculus. In Proceedings LICS'86, p. 267-278, 1986.
5. [Gur98] D. Gurov, Specification and Verification of Communicating Systems with Value Passing. Ph. D. Thesis, Department of Computer Science, University of Victoria, March 1998.
6. [FW94] M. Fröhlich and M. Werner. The graph visualization system daVinci-a user interface for applications. Technical Report 5/94, Department of Computer Science, Bremen University, 1994.
7. [Koz83] D. Kozen, Results on the prepositional μ-calculus. Theoretical Computer Science, 27: 333-354, 1983.
8. [Par76] D. Park, Finiteness is mu-ineffable. Theoretical Computer Science, 3: 173-181, 1976.
9. [SW91] C. Stirling and D. Walker, Local model checking in the modal mu-calculus. Theoretical Computer Science, 89(1): 161-177, 1991.