Conflict analysis of programs with procedures, dynamic thread creation, and monitors

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

Volumn 5079 LNCS, Issue , 2008, Pages 205-220

  Lammich, Peter ^a   Müller Olm, Markus ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONFLICT ANALYSIS; CONFLICT DETECTION; EXPONENTIAL TIME; FINITE SETS; FIX POINTS; INTERNATIONAL SYMPOSIUM; NONDETERMINISTIC CHOICE; NP-COMPLETE; PROGRAM SIZES;

LINEAR PROGRAMMING; NUCLEAR PROPULSION; SET THEORY; SYNTHETIC APERTURE SONAR;

STATIC ANALYSIS;

EID: 48949090285     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69166-2_14     Document Type: Conference Paper

References (17)

1. Artho, C., Havelund, K., Biere, A.: High-level data races. In: Isaías, P.T., Sedes, F., Augusto, J.C., Ultes-Nitsche, U. (eds.) NDDL/VVEIS, 2003-08-21, pp. 82-93. ICEIS Press (2003) ISBN:972-09916-2-6
2. Bouajjani, A., Müller-Olm, M., Touili, T.: Regular symbolic analysis of dynamic networks of pushdown systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, Springer, Heidelberg (2005)
3. Cousot, P.: Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation. Electronic Notes in Theoretical Computer Science 6 (1997), www.elsevier.nl/locate/entcs/volume6.html
4. Esparza, J., Podelski, A.: Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In: Proc. of POPL 2000, pp. 1-11. Springer, Heidelberg (2000)
5. Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretations complete. Journal of the ACM 47(2), 361-416 (2000)
6. Kahlon, V., Gupta, A.: An automata-theoretic approach for model checking threads for LTL properties. In: Proc. of LICS 2006, pp. 101-110. IEEE Computer Society, Los Alamitos (2006)
7. Kahlon, V., Gupta, A.: On the analysis of interacting pushdown systems. In: POPL, pp. 303-314 (2007)
8. Kahlon, V., Ivancic, F., Gupta, A.: Reasoning about threads communicating via locks. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 505-518. Springer, Heidelberg (2005)
9. Lammich, P., Müller-Olm, M.: Conflict analysis of programs with procedures, dynamic thread creation, and monitors. Technical Report, http://cs.uni-muenster.de/u/mmo/pubs/
10. Lammich, P., Müller-Olm, M.: Formalization of conflict analysis of programs with procedures, thread creation, and monitors. In: Klein, G., Nipkow, T., Paulson, L. (eds.) The Archive of Formal Proofs (December 2007), http://afp.sourceforge. net/entries/Program-Conflict-Analysis.shtml (Formal proof development)
11. Lammich, P., Müller-Olm, M.: Precise fixpoint-based analysis of programs with thread-creation. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR. LNCS, vol. 4703, pp. 287-302. Springer, Heidelberg (2007)
12. Melton, A., Schmidt, D.A., Strecker, G.E.: Galois connections and computer science applications. In: Poigné, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol. 240, pp. 299-312. Springer, Heidelberg (1986)
13. Müller-Olm, M.: Precise interprocedural dependence analysis of parallel programs. Theor. Comput. Sci. 311(1-3), 325-388 (2004)
14. Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
15. Ramalingam, G.: Context-sensitive synchronization-sensitive analysis is undecidable. TOPLAS 22(2), 416-430 (2000)
16. Seidl, H., Steffen, B.: Constraint-Based Inter-Procedural Analysis of Parallel Programs. Nordic Journal of Computing (NJC) 7(4), 375-400 (2000)
17. Yahav, E.: Verifying safety properties of concurrent Java programs using 3-valued logic. ACM SIGPLAN Notices 36(3), 27-40 (2001)