G. Kiczales, J. Lamping, A. Mendhekar, C. Maeda, C. V. Lopes et al., Aspect-oriented programming, pp.220-242, 1997.

G. Kiczales, E. Hilsdale, J. Hugunin, M. Kersten, J. Palm et al., An Overview of AspectJ, Lecture Notes in Computer Science, vol.2072, pp.327-353, 2001.
DOI : 10.1007/3-540-45337-7_18

C. Hankin, F. Nielson, H. R. Nielson, and F. Yang, Advice for Coordination, Lecture Notes in Computer Science, vol.5052, pp.153-168, 2008.
DOI : 10.1007/978-3-540-68265-3_10

S. Schwoon, Model-Checking Pushdown Systmes, 2002.

J. Esparza and J. Knoop, An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis, FoSSaCS. Lecture Notes in Computer Science, vol.1578, pp.14-30, 1999.
DOI : 10.1007/3-540-49019-1_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.1715

T. W. Reps, S. Schwoon, and S. Jha, Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis, Lecture Notes in Computer Science, vol.2694, pp.189-213, 2003.
DOI : 10.1007/3-540-44898-5_11
URL : http://doi.org/10.1016/j.scico.2005.02.009

T. W. Reps, S. Schwoon, S. Jha, and D. Melski, Weighted pushdown systems and their application to interprocedural dataflow analysis, Science of Computer Programming, vol.58, issue.1-2, pp.206-263, 2005.
DOI : 10.1016/j.scico.2005.02.009
URL : http://doi.org/10.1016/j.scico.2005.02.009

F. Yang, Aspects with Program Analysis for Security Policies, 2010.

A. Bouajjani, J. Esparza, and T. Touili, A generic approach to the static analysis of concurrent programs with procedures, In: POPL, pp.62-73, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00161121

A. Bouajjani, J. Esparza, and T. Touili, A Generic Approach to the Static Analysis of Concurrent Programs with Procedures, International Journal of Foundations of Computer Science, vol.36, issue.04, p.551, 2003.
DOI : 10.1142/S0129054103001893
URL : https://hal.archives-ouvertes.fr/hal-00161121

S. Chaki, E. M. Clarke, N. Kidd, T. W. Reps, and T. Touili, Verifying Concurrent Message-Passing C Programs with Recursive Calls, Lecture Notes in Computer Science, vol.22, pp.334-349, 2006.
DOI : 10.1007/11513988_49
URL : https://hal.archives-ouvertes.fr/hal-00161100

A. Lal, T. Touili, N. Kidd, and T. W. Reps, Interprocedural Analysis of Concurrent Programs Under a Context Bound, Lecture Notes in Computer Science, vol.4963, pp.282-298, 2008.
DOI : 10.1007/978-3-540-78800-3_20

C. A. Hoare, Communicating sequential processes, Communications of the ACM, vol.21, issue.8, pp.666-677, 1978.
DOI : 10.1145/359576.359585

J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon, Efficient Algorithms for Model Checking Pushdown Systems, In: CAV, pp.232-247, 2000.
DOI : 10.1007/10722167_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.3784

F. Nielson, H. R. Nielson, and C. Hankin, Principles of program analysis (2. corr. print), 2005.
DOI : 10.1007/978-3-662-03811-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.5329

N. Kidd, A. Lal, and T. W. Reps, Wali: The weighted automaton library, 2007.