Predecessor sets of dynamic pushdown networks with tree-regular constraints

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

Volumn 5643 LNCS, Issue , 2009, Pages 525-539

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

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTERLEAVING SEMANTICS; PARALLEL PROGRAM; PARTIALLY ORDERED SET; PROCESS CREATION; REACHABILITY ANALYSIS; REGULAR SETS; RULE APPLICATION; TREE-BASED;

PARALLEL ARCHITECTURES; SET THEORY;

COMPUTER AIDED ANALYSIS;

EID: 70349951318     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02658-4_39     Document Type: Conference Paper

References (14)

1. Bouajjani, A., Esparza, J., Schwoon, S., Strejcek, J.: Reachability analysis of multithreaded software with asynchronous communication. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 348-359. Springer, Heidelberg (2005)
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, pp. 473-487. Springer, Heidelberg (2005)
3. Bruggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets. Research report (2001)
4. 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)
5. 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)
6. Kidd, N., Lal, A., Reps, T.: Language strength reduction. In: Alpuente, M., Vidal,
7. G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 283-298. Springer, Heidelberg (2008)
8. Kidd, N., Lammich, P., Touili, T., Reps, T.: A decision procedure for detecting atomicity violations for communicating processes with locks (submitted for publication)
9. Kidd, N., Reps, T., Dolby, J., Vaziri, M.: Finding concurrency-related bugs using random isolation. In: Jones, N.D., Müller-Olm, M. (eds.) VMCAI 2009. LNCS, vol. 5403, pp. 198-213. Springer, Heidelberg (2009)
10. * and DPNs with locks. Technical Report, http://cs.uni- muenster.de/sev/publications/
11. Lammich, P., Müller-Olm, M.: Conflict analysis of programs with procedures, dynamic thread creation, and monitors. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 205-220. Springer, Heidelberg (2008)
12. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
13. Reps, T., Schwoon, S., Jha, S., Melski, D.: Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program. 58(1-2), 206-263 (2005)
14. Wenner, A.: Optimale Analyse gewichteter dynamischer Push-Down Netzwerke. Master's thesis, University of Münster (August 2008)