B. Alpern and F. B. Schneider, Defining liveness, Information Processing Letters, vol.21, issue.4, pp.181-185, 1985.
DOI : 10.1016/0020-0190(85)90056-0

P. Attie and A. Emerson, Synthesis of concurrent programs for an atomic read/write model of computation, An extended abstract appeared at the ACM Symposium on Principles of Distributed Computing, 1996.
DOI : 10.1145/383043.383044

B. Bonakdarpour, A. Ebnenasir, and S. S. Kulkarni, Complexity results in revising UNITY programs, ACM Transactions on Autonomous and Adaptive Systems, vol.4, issue.1, pp.1-28, 2009.
DOI : 10.1145/1462187.1462192

B. Bonakdarpour and S. S. Kulkarni, Revising Distributed UNITY Programs Is NP-Complete, Proceedings of the 12th International Conference On Principles Of DIstributed Systems (OPODIS), pp.408-427, 2008.
DOI : 10.1145/357233.357237

T. Colcombet and P. Fradet, Enforcing trace properties by program transformation, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '00, pp.54-66, 2000.
DOI : 10.1145/325694.325703

URL : https://hal.archives-ouvertes.fr/inria-00000937

S. D. Djoko, R. Douence, and P. Fradet, Aspects preserving properties, Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation , PEPM '08, pp.135-145, 2008.
DOI : 10.1145/1328408.1328429

URL : https://hal.archives-ouvertes.fr/inria-00638852

A. Ebnenasir, S. S. Kulkarni, and B. Bonakdarpour, Revising UNITY Programs: Possibilities and Limitations, International Conference on Principles of Distributed Systems (OPODIS), pp.275-290, 2005.
DOI : 10.1007/3-540-46002-0_24

E. A. Emerson, Handbook of Theoretical Computer Science, volume B, chapter 16: Temporal and Modal Logics, pp.995-1067, 1990.

M. Garey and D. Johnson, Computers and Interactability: A guide to the theory of NP-completeness, 1979.

M. Goldman and S. Katz, MAVEN: Modular Aspect Verification, 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.308-322, 2007.
DOI : 10.1007/978-3-540-71209-1_24

H. Hansen, W. Penczek, and A. Valmari, Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties, Electronic Notes in Theoretical Computer Science, vol.66, issue.2, pp.178-193, 2002.
DOI : 10.1016/S1571-0661(04)80411-0

M. V. Iordache, J. O. Moody, and P. J. Antsaklis, Synthesis of deadlock prevention supervisors using Petri nets, IEEE Transactions on Robotics and Automation, vol.18, issue.1, pp.59-68, 2002.
DOI : 10.1109/70.988975

R. Khatchadourian, J. Dovland, and N. Soundarajan, Enforcing behavioral constraints in evolving aspect-oriented programs, Proceedings of the 7th workshop on Foundations of aspect-oriented languages, FOAL '08, pp.19-28, 2008.
DOI : 10.1145/1394496.1394499

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

G. Kiczales and J. D. Rivieres, The Art of the Metaobject Protocol, 1991.

S. Krishnamurthi and K. Fisler, Foundations of incremental aspect model-checking, ACM Transactions on Software Engineering and Methodology, vol.16, issue.2, p.7, 2007.
DOI : 10.1145/1217295.1217296

S. Krishnamurthi, K. Fisler, and M. Greenberg, Verifying aspect advice modularly, ACM SIGSOFT Software Engineering Notes, vol.29, issue.6, pp.137-146, 2004.
DOI : 10.1145/1041685.1029916

S. S. Kulkarni, Component-based design of fault-tolerance, 1999.

S. S. Kulkarni and A. Arora, Automating the Addition of Fault-Tolerance, Proceedings of the 6th International Symposium on Formal Techniques in Real- Time and Fault-Tolerant Systems, pp.82-93, 2000.
DOI : 10.1007/3-540-45352-0_9

S. S. Kulkarni and A. Ebnenasir, The Effect of the Specification Model on the Complexity of Adding Masking Fault Tolerance, IEEE Transactions on Dependable and Secure Computing, vol.2, issue.4, pp.348-355, 2005.
DOI : 10.1109/TDSC.2005.52

P. K. Mckinley, U. I. Padmanabhan, N. Ancha, and S. M. Sadjadi, Composable proxy services to support collaboration on the mobile internet, IEEE Transactions on Computers, vol.52, issue.6, pp.713-726, 2003.
DOI : 10.1109/TC.2003.1204828

D. L. Parnas, Designing Software for Ease of Extension and Contraction, IEEE Transactions on Software Engineering, vol.5, issue.2, pp.128-138, 1979.
DOI : 10.1109/TSE.1979.234169

A. B. Salem, A. Duret-lutz, and F. Kordon, Model checking using generalized testing automata. Transactions on Petri Nets and Other Models of Concurrency, pp.94-122, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00855991

D. Smith, Requirement enforcement by transformation automata, Proceedings of the 6th workshop on Foundations of aspect-oriented languages , FOAL '07, pp.5-15, 2007.
DOI : 10.1145/1233833.1233835

R. S. Sreenivas, On the existence of supervisory policies that enforce liveness in discrete-event dynamic systems modeled by controlled Petri nets, IEEE Transactions on Automatic Control, vol.42, issue.7, pp.928-945, 1997.
DOI : 10.1109/9.599972

S. Thaker, D. S. Batory, D. Kitchin, and W. R. Cook, Safe composition of product lines, Proceedings of the 6th international conference on Generative programming and component engineering , GPCE '07, pp.95-104, 2007.
DOI : 10.1145/1289971.1289989

M. Vechev, E. Yahav, and G. Yorsh, Inferring Synchronization under Limited Observability, Tools and Algorithms for the Construction and Analysis of Systems, pp.139-154, 2009.
DOI : 10.1145/1095408.1095421