Bounded phase analysis of message-passing programs

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

Volumn 7214 LNCS, Issue , 2012, Pages 451-465

  Bouajjani, Ahmed ^a   Emmi, Michael ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MESSAGE PASSING PROGRAMS; MESSAGE QUEUES; NOVEL TECHNIQUES; PHASE ANALYSIS; PROCESS COMMUNICATION; PROGRAM ANALYSIS; SEQUENTIAL PROGRAMS;

ALGORITHMS; QUEUEING THEORY;

MESSAGE PASSING;

EID: 84859316467     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28756-5_31     Document Type: Conference Paper

References (25)

1. HTML5: A vocabulary and associated APIs for HTML and XHTML, http://dev.w3.org/html5/spec/Overview.html
2. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. In: LICS 1993: Proc. 8th Annual IEEE Symposium on Logic in Computer Science, pp. 160-170. IEEE Computer Society (1993)
3. Abdulla, P.A., Bouajjani, A., Jonsson, B.: On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 305-318. Springer, Heidelberg (1998) (Pubitemid 128092348)
4. Barnett, M., Leino, K.R.M., Moskal, M., Schulte,W.: Boogie: An intermediate verification language, http://research.microsoft.com/en-us/ projects/boogie/
5. Boigelot, B., Godefroid, P.: Symbolic verification of communication protocols with infinite state spaces using QDDs. Formal Methods in System Design 14(3), 237-255 (1999)
6. Bouajjani, A., Emmi, M.: Bounded phase analysis of message-passing programs (2011), http://hal.archives-ouvertes.fr/hal-00653085/en
7. Bouajjani, A., Habermehl, P.: Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations. Theor. Comput. Sci. 221(1-2), 211-250 (1999)
8. Bouajjani, A., Habermehl, P., Vojnar, T.: Verification of parametric concurrent systems with prioritised FIFO resource management. Formal Methods in System Design 32(2), 129-172 (2008)
9. Bouajjani, A., Emmi, M., Parlato, G.: On Sequentializing Concurrent Programs. In: Yahav, E. (ed.) SAS 2011. LNCS, vol. 6887, pp. 129-145. Springer, Heidelberg (2011)
10. Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323-342 (1983)
11. Dahl, R.: Node.js: Evented I/O for V8 JavaScript, http://nodejs.org/
12. Emmi, M., Qadeer, S., Rakamarić, Z.: Delay-bounded scheduling. In: POPL 2011: Proc. 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 411-422. ACM (2011)
13. Ganty, P., Majumdar, R.: Algorithmic verification of asynchronous programs. CoRR, abs/1011.0551 (2010), http://arxiv.org/abs/1011.0551
14. Jhala, R., Majumdar, R.: Interprocedural analysis of asynchronous programs. In: POPL 2007: Proc. 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 339-350. ACM (2007)
15. Kidd, N., Jagannathan, S., Vitek, J.: One Stack to Run Them All: Reducing Concurrent Analysis to Sequential Analysis Under Priority Scheduling. In: van de Pol, J., Weber, M. (eds.) SPIN 2010. LNCS, vol. 6349, pp. 245-261. Springer, Heidelberg (2010)
16. La Torre, S., Madhusudan, P., Parlato, G.: Context-Bounded Analysis of Concurrent Queue Systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 299-314. Springer, Heidelberg (2008)
17. La Torre, S., Madhusudan, P., Parlato, G.: Model-Checking Parameterized Concurrent Programs Using Linear Interfaces. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 629-644. Springer, Heidelberg (2010)
18. Lal, A., Reps, T.W.: Reducing concurrent analysis under a context bound to sequential analysis. Formal Methods in System Design 35(1), 73-97 (2009)
19. Miller, M.S., Tribble, E.D., Shapiro, J.S.: Concurrency Among Strangers. In: De Nicola, R., Sangiorgi, D. (eds.) TGC 2005. LNCS, vol. 3705, pp. 195-229. Springer, Heidelberg (2005)
20. Post, E.L.: A variant of a recursively unsolvable problem. Bull. Amer. Math. Soc. 52(4), 264-268 (1946)
21. Qadeer, S., Rehof, J.: Context-Bounded Model Checking of Concurrent Software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 93-107. Springer, Heidelberg (2005) (Pubitemid 41273736)
22. Qadeer, S., Wu, D.: KISS: Keep it simple and sequential. In: PLDI 2004: Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 14-24. ACM (2004)
23. Sen, K., Viswanathan, M.: Model Checking Multithreaded Programs with Asynchronous Atomic Methods. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 300-314. Springer, Heidelberg (2006) (Pubitemid 44560886)
24. Svensson, H., Arts, T.: A new leader election implementation. In: Erlang 2005: Proc. ACM SIGPLAN Workshop on Erlang, pp. 35-39. ACM (2005)
25. Trottier-Hebert, F.: Learn you some Erlang for great good!, http://learnyousomeerlang.com/