Asynchronous programs with prioritized task-buffers

Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, FSE 2012

Volumn , Issue , 2012, Pages

  Emmi, Michael ^a   Lal, Akash ^b   Qadeer, Shaz ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b MICROSOFT RESEARCH   (United States)

Author keywords

asynchronous programs; concurrency; sequentialization; testing

Indexed keywords

ACTUAL SYSTEM; ALGORITHMIC ANALYSIS; ANALYSIS ALGORITHMS; ASYNCHRONY; CONCURRENCY; CONCURRENT PROGRAM; DEVICE DRIVER; PARAMETER VALUES; PROGRAM ANALYSIS; PROGRAMMING ERRORS; PROTOTYPE IMPLEMENTATIONS; REAL-WORLD SYSTEM; SEQUENTIAL PROGRAMS; SEQUENTIALIZATION; SOFTWARE SYSTEMS;

COMPUTER AIDED SOFTWARE ENGINEERING; ENCODING (SYMBOLS); ERRORS; TESTING;

ALGORITHMS;

EID: 84871273514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2393596.2393652     Document Type: Conference Paper

References (30)

1. Apple Computer Inc. Apache GCD multi-processing module. http://libdispatch.macosforge.org/trac/wiki/apache.
2. Apple Computer Inc. Grand central dispatch (GCD) reference. http://developer.apple.com/library/mac/#documentation/Performance/Reference/ GCD-libdispatch-Ref/Reference/reference.html.
3. M. F. Atig, A. Bouajjani, and T. Touili. Analyzing asynchronous programs with preemption. In FSTTCS '08: Proc. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, volume 2 of LIPIcs, pages 37-48. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2008.
4. A. Bouajjani, M. Emmi, and G. Parlato. On sequentializing concurrent programs. In SAS '11: Proc. 18th International Symposium on Static Analysis, volume 6887 of LNCS, pages 129-145. Springer, 2011.
5. D. Brand and P. Zafiropulo. On communicating finite-state machines. J. ACM, 30(2):323-342, 1983.
6. S. Chaki, A. Gurfinkel, and O. Strichman. Time-bounded analysis of real-time systems. In FMCAD '11: Proc. 11th International Conference on Formal Methods in Computer-Aided Design. IEEE, 2010.
7. R. Dahl. Node.js: Evented I/O for V8 JavaScript. http://nodejs.org/.
8. M. Emmi, S. Qadeer, and Z. Rakamarić. Delay-bounded scheduling. In POPL '11: Proc. 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 411-422. ACM, 2011.
9. M. Emmi, A. Lal, and S. Qadeer. Asynchronous programs with prioritized task-buffers. Technical Report MSR-TR-2012-1, Microsoft Research, 2012.
10. J. Esparza. Decidability and complexity of Petri net problems - an introduction. In Petri Nets: Proc. Dagstuhl Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, volume 1491 of LNCS, pages 374-428. Springer, 1998.
11. P. Ganty and R. Majumdar. Algorithmic verification of asynchronous programs. CoRR, abs/1011.0551, 2010. http://arxiv.org/abs/1011.0551.
12. I. Hickson. HTML5: A vocabulary and associated APIs for HTML and XHTML. http://dev.w3.org/html5/spec/Overview.html.
13. R. Jhala and R. Majumdar. Interprocedural analysis of asynchronous programs. In POPL '07: Proc. 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 339-350. ACM, 2007.
14. N. Kidd, S. Jagannathan, and J. Vitek. One stack to run them all: Reducing concurrent analysis to sequential analysis under priority scheduling. In SPIN '10: Proc. 17th International Workshop on Model Checking Software, volume 6349 of LNCS, pages 245-261. Springer, 2010.
15. S. La Torre, P. Madhusudan, and G. Parlato. Reducing context-bounded concurrent reachability to sequential reachability. In CAV '09: Proc. 21st International Conference on Computer Aided Verification, volume 5643 of LNCS, pages 477-492. Springer, 2009.
16. S. La Torre, P. Madhusudan, and G. Parlato. Model-checking parameterized concurrent programs using linear interfaces. In CAV '10: Proc. 22nd International Conference on Computer Aided Verification, volume 6174 of LNCS, pages 629-644. Springer, 2010.
17. S. K. Lahiri, S. Qadeer, and Z. Rakamarić. Static and precise detection of concurrency errors in systems code using SMT solvers. In CAV '09: Proc. 21st International Conference on Computer Aided Verification, volume 5643 of LNCS, pages 509-524. Springer, 2009.
18. A. Lal and T. W. Reps. Reducing concurrent analysis under a context bound to sequential analysis. Formal Methods in System Design, 35(1): 73-97, 2009.
19. A. Lal, S. Qadeer, and S. Lahiri. Corral: A solver for reachability modulo theories. In CAV '12: Proc. 24th International Conference on Computer Aided Verification, volume 7358 of LNCS, pages 427-443. Springer, 2012.
20. L. Lamport. Proving the correctness of multiprocess programs. IEEE Trans. Software Eng., 3(2):125-143, 1977.
21. J. Li, F. Xie, T. Ball, V. Levin, and C. McGarvey. An automata-theoretic approach to hardware/software co-verification. In FASE, volume 6013 of LNCS, pages 248-262. Springer, 2010.
22. Microsoft Inc. Parallel programming in the .NET framework. http://msdn.microsoft.com/en-us/library/dd460693.aspx.
23. Microsoft Inc. Windows kernel-mode driver architecture. http://msdn.microsoft.com/en-us/library/windows/hardware/ff557560(v=VS.85).aspx.
24. M. Musuvathi and S. Qadeer. Iterative context bounding for systematic testing of multithreaded programs. In PLDI '07: Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 446-455. ACM, 2007.
25. Poirot: The Concurrency Sleuth. http://research.microsoft.com/en-us/ projects/poirot/.
26. S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In TACAS '05: Proc. 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 3440 of LNCS, pages 93-107. Springer, 2005.
27. S. Qadeer and D. Wu. KISS: Keep it simple and sequential. In PLDI '04: Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 14-24. ACM, 2004.
28. G. Ramalingam. Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst., 22(2):416-430, 2000.
29. K. Sen and M. Viswanathan. Model checking multithreaded programs with asynchronous atomic methods. In CAV '06: Proc. 18th International Conference on Computer Aided Verification, volume 4144 of LNCS, pages 300-314. Springer, 2006.
30. M.Wilcox. I'll do it later: Softirqs, tasklets, bottom halves, task queues, work queues and timers. In LCA '03: Proc. 4th Linux Conference Australia, 2003.