Detection of asynchronous message passing errors using static analysis

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

Volumn 6539 LNCS, Issue , 2011, Pages 5-18

  Christakis, Maria ^a   Sagonas, Konstantinos ^a,b  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSE APPROXIMATION; CONCURRENT PROGRAMMING; DYNAMIC PROCESS; ERLANG PROGRAMS; FALSE ALARMS; INTERPROCESS COMMUNICATION; SOFTWARE DEFECTS; SOUNDNESS AND COMPLETENESS;

ERRORS; MESSAGE PASSING; APPLICATION PROGRAMS; COMPUTER PROGRAMMING; STATIC ANALYSIS;

STATIC ANALYSIS; MESSAGE PASSING;

EID: 79551590902     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18378-2_3     Document Type: Conference Paper

References (14)

1. Armstrong, J.: Programming Erlang: Software for a Concurrent World. The Pragmatic Bookshelf, Raleigh (2007)
2. Lindahl, T., Sagonas, K.: Detecting software defects in telecom applications through lightweight static analysis: A war story. In: Chin, W.-N. (ed.) APLAS 2004. LNCS, vol. 3302, pp. 91-106. Springer, Heidelberg (2004)
3. Sagonas, K.: Experience from developing the Dialyzer: A static analysis tool detecting defects in Erlang applications. In: Proceedings of the ACM SIGPLAN Workshop on the Evaluation of Software Defect Detection Tools (2005)
4. Christakis, M., Sagonas, K.: Static detection of race conditions in Erlang. In: Carro, M., Peña, R. (eds.) PADL 2010. LNCS, vol. 5937, pp. 119-133. Springer, Heidelberg (2010)
5. Carlsson, R.: An introduction to Core Erlang. In: Proceedings of the PLI 2001 Workshop on Erlang (2001)
6. Carlsson, R., Sagonas, K., Wilhelmsson, J.: Message analysis for concurrent programs using message passing. ACM Transactions on Programming Languages and Systems 28(4), 715-746 (2006)
7. Lindahl, T., Sagonas, K.: Practical type inference based on success typings. In: Proceedings of the 8th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 167-178. ACM, New York (2006)
8. Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer- Verlag New York, Inc., Secaucus (1999)
9. Shivers, O.: Control Flow Analysis in Scheme. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 164-174. ACM, New York (1988)
10. Nielson, F., Nielson, H.R.: Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis. In: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 332-345. ACM, New York (1997)
11. Nielson, F., Nielson, H.R.: Higher-Order Concurrent Programs with Finite Communication Topology. In: Proceedings of the ACM-SIGPLAN Symposium on Principles of Programming Languages, pp. 84-97. ACM, New York (1994)
12. Mercouroff, N.: An Algorithm for Analyzing Communicating Processes. In: Schmidt, D., Main, M.G., Melton, A.C., Mislove, M.W., Brookes, S.D. (eds.) MFPS 1991. LNCS, vol. 598, pp. 312-325. Springer, Heidelberg (1992)
13. Martel, M., Gengler, M.: Communication Topology Analysis for Concurrent Programs. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol. 1885, pp. 265-286. Springer, Heidelberg (2000)
14. Colby, C.: Analyzing the Communication Topology of Concurrent Programs. In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 202-213. ACM, New York (1995)