Algorithmic verification of asynchronous programs

ACM Transactions on Programming Languages and Systems

Volumn 34, Issue 1, 2012, Pages

  Ganty, Pierre ^a   Majumdar, Rupak ^b  

^a IMDEA SOFTWARE INSTITUTE   (Spain)

^b MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

Asynchronous (event driven) programming; Fair termination; Liveness; Petri nets

Indexed keywords

ALGORITHMIC TECHNIQUES; ALGORITHMIC VERIFICATION; ASYNCHRONOUS PROGRAMMING; BASIC MODELS; CONCURRENT INTERACTIONS; FAIR TERMINATION; FINITE-STATE; FORMAL MODEL; INFINITE-STATE; LIVENESS; LOWER BOUNDS; NON-BLOCKING; POLYNOMIAL-TIME; PROGRAM CONTROL; REACHABILITY; SAFETY VERIFICATION; TRANSITION SYSTEM; UNDECIDABILITY; VERIFICATION PROBLEMS;

ALGORITHMS; COMPUTER PROGRAMMING; PETRI NETS; SEMANTICS;

COMPUTABILITY AND DECIDABILITY;

EID: 84860569696     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/2160910.2160915     Document Type: Article

References (45)

1. ABDULLA, P. A., CERANS, K., JONSSON, B., AND TSAY, Y.-K. 1996. General decidability theorems for infinite-state systems. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS'96). IEEE Computer Society, 313-321.
2. ABDULLA, P. A. AND MAYR, R. 2009. Minimal cost reachability/coverability in priced timed petri nets. In Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures (FOSSACS'09). Lecture Notes in Computer Science, vol. 5504, Springer, 348-363.
3. AHO, A., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley.
4. ATIG, M. F., BOUAJJANI, A., AND TOUILI, T. 2008. Analyzing asynchronous programs with preemption. In Proceedings of the 28th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS'08). Leibniz International Proceedings in Informatics, vol. 2, Leibniz-Zentrum fuer Informatik, 37-48.
5. ATIG, M. F. AND HABERMEHL, P. 2009. On Yen's path logic for Petri nets. In Proceedings of the 3rd Workshop on Reachability Problems. Lecture Notes in Computer Science, vol. 5797, Springer, 51-63.
6. BOUAJJANI, A., ESPARZA, J., AND MALER, O. 1997. Reachability analysis of pushdown automata: Application to model-checking. In Proceedings of the 8th International Conference on Concurrency Theory (CONCUR'97). Lecture Notes in Computer Science, vol. 1243, Springer, 135-150. (Pubitemid 127089315)
7. BURKART, O. AND STEFFEN, B. 1994. Pushdown processes: Parallel composition and model checking. In Proceedings of the 5th International Conference on Concurrency Theory (CONCUR'94). Lecture Notes in Computer Science, vol. 836, Springer, 98-113.
8. CHADHA, R. AND VISWANATHAN, M. 2007. Decidability results for well-structured transition systems with auxiliary storage. In Proceedings of the 18th International Conference on Concurrency Theory (CONCUR'07). Lecture Notes in Computer Science, vol. 4703, Springer, 136-150.
9. CHADHA, R. AND VISWANATHAN, M. 2009. Deciding branching time properties for asynchronous programs. Theor. Comput. Sci. 410, 42, 4169-4179.
10. DICKSON, L. E. 1913. Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math. 35, 413-422.
11. DUFOURD, C., FINKEL, A., AND SCHNOEBELEN, P. 1998. Reset nets between decidability and undecidability. In Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP'98). Lecture Notes in Computer Science, vol. 1443, Springer, 103-115. (Pubitemid 128111106)
12. ESPARZA, J. 1997. Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae 31, 13-26.
13. ESPARZA, J. 1998. Decidability and complexity of petri net problems - an introduction. In Lectures on Petri Nets I: Basic Models. Lecture Notes in Computer Science, vol. 1491, Springer, 374-428.
14. ESPARZA, J., FINKEL, A., AND MAYR, R. 1999. On the verification of broadcast protocols. In Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS'99). 352-359.
15. ESPARZA, J., GANTY, P., KIEFER, S., AND LUTTENBERGER, M. 2011. Parikh's theorem: A simple and direct automaton construction. Inform. Process. Letters 111, 614-619.
16. ESPARZA, J., KIEFER, S., AND LUTTENBERGER, M. 2010. Newtonian program analysis. J. ACM 57, 6.
17. ESPARZA, J. AND NIELSEN, M. 1994. Decibility issues for Petri nets-a survey. J. Informatik Process. Cybernet. 30, 3, 143-160.
18. FINKEL, A. AND SANGNIER, A. 2010. Mixing coverability and reachability to analyze vass with one zero-test. In Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'10). Lecture Notes in Computer Science, vol. 5901, Springer, 394-406.
19. FINKEL, A. AND SCHNOEBELEN, P. 2001. Well-structured transition systems everywhere! Theor. Comput. Sci. 256, 1-2, 63-92. (Pubitemid 32666102)
20. GANTY, P. AND MAJUMDAR, R. 2009. Analyzing real-time event-driven programs. In Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'09). Lecture Notes in Computer Science, vol. 5813, Springer, 164-178.
21. GANTY, P., MAJUMDAR, R., AND RYBALCHENKO, A. 2009. Verifying liveness for asynchronous programs. In Proceedings of the 36th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'09). 102-113.
22. HACK, M. H. T. 1976. Decidability questions for Petri nets. Tech. rep. 161, MIT.
23. HILL, J. L., SZEWCZYK, R., WOO, A., HOLLAR, S., CULLER, D. E., AND PISTER, K. S. J. 2000. System architecture directions for networked sensors. In Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'00). 93-104. (Pubitemid 32474159)
24. JHALA, R. AND MAJUMDAR, R. 2007. Interprocedural analysis of asynchronous programs. In Proceedings of the 34th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'07). 339-350.
25. KARP, R. M. AND MILLER, R. E. 1969. Parallel program schemata. J. Comput. Syst. Sci. 3, 2, 147-195.
26. KOHLER, E.,MORRIS, R., CHEN, B., JANNOTTI, J., AND KAASHOEK, M. 2000. The click modular router. ACM Trans. Comput. Syst. 18, 3, 263-297.
27. KOSARAJU, S. R. 1982. Decidability of reachability in vector addition systems (preliminary version). In Proceedings of the of 14th ACM Symposium on Theory of Computing (STOC'82). 267-281.
28. KROHN, M., KOHLER, E., AND KAASHOEK, M. 2007. Events can make sense. In Proceedings of the USENIX Annual Technical Conference. USENIX Association.
29. LAMBERT, J. L. 1992. A structure to decide reachability in petri nets. Theor. Comput. Sci. 99, 1, 79-104.
30. LAMPORT, L. 1977. Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. 3, 2, 125-143.
31. LANGE, M. AND LEISS, H. 2008-2010. To CNF or not to CNF? An efficient yet presentable version of the CYK algorithm. Informatica Didactica 8, 1-21.
32. LIPTON, R. 1976. The reachability problem is exponential-space hard. Tech. rep. 62, Department of Computer Science, Yale University.
33. MAYR, E. W. 1981. An algorithm for the general petri net reachability problem. In Proceedings of the 13th ACM Symposium on Theory of Computing (STOC'81). 238-246.
34. MAYR, E. W. AND MEYER, A. R. 1981. The complexity of the finite containment problem for Petri nets. J. ACM 28, 3, 561-576.
35. MINSKY, M. 1967. Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs, N.J.
36. PAI, V., DRUSCHEL, P., AND ZWAENEPOEL, W. 1999. Flash: An efficient and portable web server. In Proceedings of the USENIX Technical Conference. 199-212.
37. PARIKH, R. J. 1966. On context-free languages. J. ACM 13, 4, 570-581.
38. RACKOFF, C. 1978. The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 2, 223-231.
39. REISIG, W. 1986. Petri Nets. An Introduction. Springer.
40. REPS, T.,HORWITZ, S., AND SAGIV, M. 1995. Precise interprocedural dataflow analysis via graph reachability. In Proceedings of the 22nd ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'95). 49-61.
41. SEN, K. AND VISWANATHAN, M. 2006. Model checking multithreaded programs with asynchronous atomic methods. In Proceedings of the 18th International Conference on Computer Aided Verification (CAV'06). Lecture Notes in Computer Science, vol. 4144, Springer, 300-314. (Pubitemid 44560886)
42. SHARIR, M. AND PNUELI, A. 1981. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications. Prentice-Hall, Inc., 189-233.
43. VARDI, M. Y. 1991. Verification of concurrent programs-the automata-theoretic approach. Annal. Pure Appl. Logic 51, 79-98.
44. WALUKIEWICZ, I. 2001. Pushdown processes: Games and model-checking. Inform. Comput. 164, 2, 234-263.
45. YEN, H.-C. 1992. A unified approach for deciding the existence of certain petri net paths. Inform. Comput. 96, 1, 119-137.