P. André, G. Ardourel, and C. Attiogbé, Behavioural Verification of Service Composition, ICSOC Workshop on Engineering Service Compositions, 2005.

P. André, G. Ardourel, and C. Attiogbé, Spécification d'architectures logicielles en Kmelia : hiérarchie de connexion et composition, 1ère Conférence Francophone sur les Architectures Logicielles, pp.101-118, 2006.

C. Aaa06b, P. Attiogbé, G. André, and . Ardourel, Checking Component Composability, 5th International Symposium on Software Composition, pp.18-33, 2006.

P. André, G. Ardourel, and C. Attiogbé, Adaptation for Hierarchical Components and Services, Proceedings of the Third International Workshop on Coordination and Adaption Techniques for Software Entities, pp.5-20, 2006.
DOI : 10.1016/j.entcs.2007.05.045

P. André, G. Ardourel, and C. Attiogbé, Protocoles d'utilisation de composants : spécification et analyse en Kmelia, 2007.

M. Astesiano, H. Bidoit, B. Kirchner, P. D. Krieg-brückner, D. Mosses et al., CASL: the Common Algebraic Specification Language, Theoretical Computer Science, vol.286, issue.2, pp.153-196, 2002.
DOI : 10.1016/S0304-3975(01)00368-1

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

J. Abrial, Extending B without Changing it (for developping distributed systems), Proc. of the 1st Conf. on the B method, pp.169-190, 1996.

[. Abrial, Event Driven Distributed Program Construction, MATISSE project, 2001.

[. Abrial, Discrete System Models. Internal Notes (www-lsr.imag, 2002.

J. Abrial, D. Cansell, and G. Lafitte, Higher-Order, ZB'2002 ? Formal Specification and Development in Z and B, pp.370-393, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00100923

Y. Aït-ameur, R. Delmas, and V. Wiels, a framework for heterogeneous formal modeling and compositional verification of avionics systems, MEMOCODE, pp.223-232, 2004.

G. [. Asperti and . Longo, Categories, Types and Structures. Foundations of Computing Series, 1991.

J. Abrial, L. Mussat-arnold, G. Point, A. Griffault, and A. Rauzy, Introducing dynamic constraints in B, Proc. of the 2nd Conference on the B method, pp.83-128109, 1998.
DOI : 10.1007/BFb0053357

C. Attiogbé, P. Poizat, and G. Salaün, Specification of a gas station using a formalism integrating formal datatypes within state diagrams, Proceedings International Parallel and Distributed Processing Symposium, 2003.
DOI : 10.1109/IPDPS.2003.1213436

C. Attiogbé, P. Poizat, and G. Salaün, A Formal and Tool-Equipped Approach for the Integration of State Diagrams and Formal Datatypes, IEEE Transactions on Software Engineering, vol.33, issue.3, pp.157-170, 2007.
DOI : 10.1109/TSE.2007.21

G. [. Attiogbé and . Salaün, Generation of Formal Development Environment : Foundation and Application, 2002.

]. C. Att98 and . Attiogbé, Configuration Machines : A Simple Formalism For Specifying Multifaceted Systems, 1998.

]. C. Att00a and . Attiogbé, Formal Methods Integration : Some Locks and Outlines, 2000.

C. Attiogbé, Le système de contrôle d'accès : une spécification à base des machines à configurations, Proc. of AFADL'2000, pp.203-220, 2000.

C. Att01 and . Attiogbé, Refining a Cooling System of a Nuclear Power Station with the B-Method, 2001.

]. C. Att02a and . Attiogbé, A Generic Framework for Methods Integration (NatIF Project), 2002.

]. C. Att02b and . Attiogbé, Communicating B Abstract Systems (CBS), 2002.

]. C. Att02c and . Attiogbé, Mechanization of an Integrated Approach : Shallow Embedding into SAL/PVS, Proc. of ICFEM'02, pp.120-131, 2002.

C. Attiogbé, Systematic derivation of a validation model from a rule-oriented model: a system validation case study using promela/spin, Proceedings. 2004 International Conference on Information and Communication Technologies: From Theory to Applications, 2004., 2004.
DOI : 10.1109/ICTTA.2004.1307896

]. C. Att05a and . Attiogbé, A Stepwise Development of the Peterson's Mutual Exclusion Algorithm Using B Abstract Systems, Proc. of ZB'05, pp.124-141, 2005.

]. C. Att05b and . Attiogbé, Practical Combination of Theorem Proving and Model Checking for the Multi-facet Analysis, Proc. of SOFSEM'05, pp.1-10, 2005.

]. C. Att05c and . Attiogbé, Semantic Embedding of Petri Nets into Event-B, 2005.

C. Att06a and . Attiogbé, Multi-process Systems Analysis using Event B : Application to Group Communication Systems, LNCS, vol.4260, pp.660-677, 2006.

C. Att06b and . Attiogbé, Tool-Assisted Multi-Facet Analysis of Formal Specifications (Using Alelier-B and ProB), IASTED Conf. on Software Engineering, pp.85-90, 2006.

C. Att06c and . Attiogbé, Combining B Tools for Multi-Process Systems Specification The Netherlands, 8th African Conference on Research in Computer Science (CARI'06) Correctness Preserving Program Refinements : Proof Theory and Applications, pp.35-42, 1980.

]. C. Bac89 and . Backhouse, Construction et vérification de programmes. coll, 1989.

M. [. Back and . Butler, Fusion and simultaneous execution in the refinement calculus, Acta Informatica, vol.35, issue.11, pp.921-949, 1998.
DOI : 10.1007/s002360050148

[. Bert, J. P. Bowen, M. C. Henson, and K. Robinson, ZB'2002 : Formal Specification and Development in Z and B, 2nd International Conference of B and, Bertot and Pierre Castéran. Interactive Theorem Proving and Program Development, Coq'Art : The Calculus of Inductive Constructions. Texts in Theoretical Computer Science, 2002.

J. Béziau, A. Costa-leite, and A. Facchini, Aspects of universal logic, 2004.

. R. Bcm-+-92-]-j, E. M. Burch, K. L. Clarke, D. L. Mcmillan, L. J. Dill et al., Symbolic Model Checking : 1020 States and Beyond, Information and Computation, issue.98, pp.98142-170, 1992.

]. P. Bdr97, M. Blackburn, and . De-rijke, Why combine logics ? Studia Logica, pp.5-27, 1997.

M. [. Bowen and . Gordon, A shallow embedding of Z in HOL, Information and Software Technology, vol.37, issue.5-6, pp.5-6269, 1995.
DOI : 10.1016/0950-5849(95)99362-Q

[. Buchs and N. Guelfi, A formal specification framework for object-oriented distributed systems, IEEE Transactions on Software Engineering, vol.26, issue.7, pp.635-652, 2000.
DOI : 10.1109/32.859532

. Bgg-+-92-]-r, A. Boulton, M. J. Gorgon, J. Gordon, J. Hebert et al., Experience with Embedding Hardware Description Language in HOL, Proc. of the International Conference on Theorem Provers in Circuit Design : Theory, Practice and Experience, pp.129-156, 1992.

F. Bellegarde, J. Julliand, and O. Kouchnarenko, Synchronised Parallel Composition of Event Systems in B, BBHR02], pp.436-457

R. [. Back and . Kurki-suonio, Decentralisation of Process Nets with Centralised Control, Proc. of the 2nd ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pp.131-142, 1983.

J. Bruel, J. Lilius, A. Moreira, and R. France, Defining Precise Semantics for UML, Proceedings ECOOP 2000 Workshops, Panels, and Posters, pp.113-122, 1964.
DOI : 10.1007/3-540-44555-2_10

C. [. Butler and . Morgan, Action systems, unbounded nondeterminism, and infinite traces, Formal Aspects of Computing, vol.3, issue.2, pp.37-53, 1995.
DOI : 10.1007/BF01214622

R. T. Boute, Integrating Formal Methods by Unifying Abstractions, IFM, volume 2999 of Lecture Notes in Computer Science Potet, and Y. Rouzaud. A Study on Components and Assembly Primitives in B. Proc. of the 1st Conference on the B method, pp.441-460, 1996.
DOI : 10.1007/978-3-540-24756-2_24

URL : http://hdl.handle.net/1854/LU-348836

A. Bouali, A. Ressouche, V. Roy, R. , and S. , The Fc2Tools set : a Toolset for the Verification of Concurrent Systems, Proceedings of the 8th Conference on Computer- Aided Verification, 1996.

]. M. But96 and . Butler, Stepwise Refinement of Communicating Systems, Science of Computer Programming, vol.27, issue.2, pp.139-173, 1996.

]. M. But99 and . Butler, Csp2B : A practical Approach to Combining CSP and B, Proc. of the International Confernce on Formal Methods (FM'99), p.490, 1999.

C. [. Barr and . Wells, Category Theory for Computer Science, 1990.

[. Back and J. Wright, Refinement Calculus : A Systematic Introduction. Graduate Texts in Computer Science, 1998.
DOI : 10.1007/978-1-4612-1674-2

]. R. Ca86 and . Constable, Implementing Mathematics with the Nuprl Proof Developemnt System [Chr03] Christian Attiogbé and Pascal Poizat and Gwen Salaün. Integration of Formal Datatypes within State Diagrams, Proc. of the 6th International Conference on Fundamental Approaches to Software Engineering (FASE), volume 2621 of LNCS, pp.341-355, 1986.

J. H. Cheng and C. B. Jones, On the Usability of Logics which Handle Partial Functions, Proceedings of 3rd Refinement Workshop, pp.51-69, 1991.

V. Gregory, I. Chockler, R. Keidar, and . Vitenberg, Group Communication Specifications : a Comprehensive Study, ACM Comput. Surv, vol.33, issue.4, pp.427-469, 2001.

K. [. Clarke, S. Mcmillan, V. Campos, and . Hartonas-garmhausen, Symbolic model checking, CAV'96 : Computer Aided Verification, pp.419-422, 1996.
DOI : 10.1007/3-540-61474-5_93

]. F. Cor91 and . Corella, Mechanizing Set Theory, 1991.

S. J. Crow, J. Owre, N. Rushby, M. Shankar, and . Srivas, A Tutorial Introduction to PVS, Proc. of the Workshop on Industrial-Strength Formal Specification Techniques (WIFT'95, 1995.

]. B. Cox86 and . Cox, Object-oriented Programming : an Evolutionary Approach, 1986.

[. Caleiro, C. Sernadas, and A. Sernadas, Parameterisation of Logics, Workshop on Algebraic Development Techniques, pp.48-62, 1998.
DOI : 10.1007/3-540-48483-3_4

C. [. Caleiro, A. Sernadas, and . Sernadas, Mechanisms for Combining Logics, pp.1049-1050, 1999.

C. Caleiro, A. Sernadas, and C. Sernadas, Fibring Logics, We Will Show Them : Essays in Honour of Dov Gabbay Frontiers of Combining Systems, pp.363-388, 1996.
DOI : 10.1007/978-3-0346-0145-0_29

S. Dupuy and L. Bousquet, A Multi-formalism Approach for the Validation of UML Models, Formal Aspects of Computing, vol.12, issue.4, pp.228-230, 2000.
DOI : 10.1007/s001650070018

. Dfh-+-93-]-g, A. Dowek, G. Felty, C. Huet, C. Murphy et al., The Coq Proof Assistant Users's Guide, 1993.

]. E. Dij68 and . Dijkstra, A constructive Approach to the Problem of Program Correctness, BIT, vol.14, issue.8, pp.174-186, 1968.

W. Edsger and . Dijkstra, chapter i : Notes on structured programming, pp.1-82, 1972.

]. E. Dij75 and . Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Communications of the ACM, vol.18, issue.8, pp.453-457, 1975.

]. E. Dij76 and . Dijkstra, A Discipline of Programming, 1976.

[. Dahl and K. Nygaard, SIMULA: an ALGOL-based simulation language, Communications of the ACM, vol.9, issue.9, pp.671-678, 1966.
DOI : 10.1145/365813.365819

[. Dahl and K. Nygaard, Class and Subclass Declarations, Simulation Programming Languages -IFIP Working Conference in, 1967.
DOI : 10.1007/978-3-642-48354-7_8

]. S. Dun99 and . Dunne, The Safe Machine : A New Specification Construct for B, Proceedings of FM'99 : World Congress on Formal Methods, number 1709 in Lecture Notes in Computer Science, pp.472-489, 1999.

]. S. Dun02 and . Dunne, A Theory of Generalised Substitutions, BBHR02], pp.270-290

B. [. Ehrig and . Mahr, Fundamentals of algebraic specification 2, EATCS Monographs on Theoretical Computer Science, 1990.

J. Luiz, F. , and T. S. Maibaum, Temporal Theories as Modularisation Units for Concurrent System Specification, Formal Aspects of Computing, vol.4, issue.3, pp.239-272, 1992.

J. Luis, F. , and T. Maibaum, generalising interpretations between theories in the context of p-institutions, Proceedings of the First Imperial College Department of Computing Workshop on Theory and formal methods 1993, pp.126-147, 1993.

]. D. Gab96a and . Gabbay, An overview of Fibred Semantics and the Combination of Logics, Frontiers of Combining Systems, pp.93-102, 1996.

]. D. Gab96b, . [. Gabbay, R. M. Goguen, and . Bustall, Fibred Semantics and the Weaving of Logics, Journal of Symbolic Logic Institutions : Abstract Model for Specification and Programming. Journal of the ACM, vol.61, issue.139, pp.1057-1120, 1992.

H. J. Genrich, Predicate/Transition Nets, Petri Nets : Central Models and their Properties, pp.207-247, 1986.
DOI : 10.1007/978-3-540-47919-2_9

[. Grumberg, T. Heyman, and A. Schuster, Distributed Symbolic Model Checking for µ-Calculus, Computer Aided Verification, pp.350-362, 2001.
DOI : 10.1007/s10703-005-1493-1

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.4814

K. [. Genrich and . Lautenbach, System modelling with high-level Petri nets, Theoretical Computer Science, vol.13, issue.1, pp.109-136, 1981.
DOI : 10.1016/0304-3975(81)90113-4

URL : http://doi.org/10.1016/0304-3975(81)90113-4

A. Girault, B. Lee, and E. A. Lee, Hierarchical finite state machines with multiple concurrency models, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.18, issue.6, pp.742-760, 1999.
DOI : 10.1109/43.766725

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.1183

J. Girard, Y. Lafont, and P. Taylor, Proofs and Types. (Cambridge Tracts in T.C.S. 7), 1989.

M. Gordon, Set theory, higher order logic or both?
DOI : 10.1007/BFb0105405

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.7899

]. M. Gor93 and . Gordon, Introduction to HOL : A Theorem Proving Environment Embedding a Formal Notation : Experiences of Automating the Embedding of Z in the Higher Order Logic of PVS and HOL, pp.73-84, 1993.

D. Gries, The Science of Programming, 1981.
DOI : 10.1007/978-1-4612-5983-1

J. [. Hoare and . He, Unifying theories of programming, NJ, 1998.

W. Ho and J. Jézéquel, Alain Le Guennec, and François Pennaneac'h. UMLAUT : an extendible UML transformation framework, Proc. of the Automated Software Engineering (ASE'99), 1999.

R. [. Henzinger and . Majumdar, A classification of symbolic transition systems, Proc. of STACS, pp.13-34, 2000.
DOI : 10.1145/1042038.1042039

A. Thomas, Z. Henzinger, A. Manna, and . Pnueli, Timed Transition Systems, REX Workshop, pp.226-251, 1991.

]. C. Hoa69 and . Hoare, an axiomatic basis for computer programming, Commun. ACM, vol.12, issue.10, pp.576-580, 1969.

]. C. Hoa76 and . Hoare, Proof of correctness of data representation, Language Hierarchies and Interfaces, International Summer School, pp.183-193, 1976.

]. C. Hoa85 and . Hoare, Communicating Sequential Processes, 1985.

]. K. Jen96 and . Jensen, Coloured Petri Nets Vol. I-III, In EATCS Monographs on Theoretical Computer Science, 1992.

C. [. Jones and . Middelburg, A typed logic of partial functions reconstructed classically, Acta Informatica, vol.21, issue.5, pp.399-430, 1994.
DOI : 10.1007/BF01178666

C. Joubert and R. Mateescu, Distributed On-the-Fly Equivalence Checking, Proceedings of the 3rd Workshop on Parallel and Distributed Methods in Verification PDMC, 2004.
DOI : 10.1016/j.entcs.2004.10.018

R. [. Joubert and . Mateescu, Distributed On-the-Fly Model Checking and Test Case Generation, Proceedings of the 13th International Workshop on Model Checking of Software SPIN'2006, pp.126-145, 2006.
DOI : 10.1007/BFb0054166

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

]. C. Jon83 and . Jones, tentative steps toward a development method for interfering programs, ACM Trans. Program. Lang. Syst, vol.5, issue.4, pp.596-619, 1983.

]. S. Kat01 and . Katz, faithful translations among models and specifications, Proceedings of the International Symposium of Formal Methods Europe, pp.419-434, 2001.

O. [. Katz and . Grumberg, A Framework for Translating Models and Specifications, Proceedings of Integrated Formal Methods (IFM'2002, pp.145-164, 2002.
DOI : 10.1007/3-540-47884-1_9

K. Korenblat, O. Grumberg, and S. Katz, Translations between Textual Transition Systems and Petri Nets, Proceedings of Integrated Formal Methods (IFM'2002, pp.339-359, 2002.
DOI : 10.1007/3-540-47884-1_19

K. [. Kristensen and . Jensen, Specification and Validation of an Edge Router Discovery Protocol for Mobile Ad-hoc Networks Application of Coloured Petri Nets in System Development, Proceedings of INT'04, pp.248-269, 2004.

]. D. Knu97 and . Knuth, The Art of Programming, 1997.

M. [. Kracht, F. Kracht, and . Wolter, Tools and Techniques in Modals Logic Simulation and transfer results in modal logic, Lam92] L. Lamport. Types Considered Harmful, pp.149-177, 1992.

M. [. Leuschel and . Butler, ProB: A Model Checker for B, FME 2003 : Formal Methods Europe, pp.855-874, 2003.
DOI : 10.1007/978-3-540-45236-2_46

J. Liu, J. S. Dong, K. Shi, and B. Mahony, Linking UML with Integrated Formal Techniques, Unified Modeling Language : Systems Analysis, Design and Development Issues, chapter 13, pp.210-223, 2001.
DOI : 10.4018/978-1-930708-05-1.ch013

[. Latella, I. Majzik, and M. Massink, Towards a Formal Operational Semantics of UML Statechart Diagrams, Proc. FMOODS'99, IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems, 1999.
DOI : 10.1007/978-0-387-35562-7_25

[. Lotos, A Formal Description Technique Based on The Temporal Ordering of Observational Behaviour. International Organisation for Standardization -Information Processing Systems -Open Systems Interconnection, International Standard, vol.8807, 1988.

L. [. Lamport and . Paulson, Should your specification language be typed, ACM Transactions on Programming Languages and Systems, vol.21, issue.3, 1999.
DOI : 10.1145/319301.319317

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.2302

[. Ledang, J. Souquières, and S. Charles, Argo/UML B : un outil de transformation systématique de spécification UML en B, AFADL'2003, pp.3-18, 2003.

M. Leuschel and E. Turner, Visualizing Larger State Spaces in ProB, Proc. of ZB'05, pp.6-23, 2005.

A. Nancy, F. W. Lynch, and . Vaandrager, Action Transducers and Timed Automata, Formal Aspects of Computing, vol.8, issue.5, pp.499-538, 1996.

]. E. Mds93, R. Madelaine, and . De-simone, The FC2 Reference Manual, 1993.

]. R. Mil80 and . Milner, A Calculus of Communicating Systems, 1980.

[. Milner, Communication and Concurrency, 1989.

[. Lange, Parallel and Symbolic Model Checking for Fixpoint Logic with Chop, Proceedings of the 3rd Workshop on Parallel and Distributed Methods in Verification PDMC, 2004.
DOI : 10.1016/j.entcs.2004.10.023

Y. [. Mikk, M. Lakhnech, and . Siegel, Hierarchical automata as model for statecharts, Lecture Notes in Computer Science, vol.1345, 1996.
DOI : 10.1007/3-540-63875-X_52

C. Morgan, Programming from Specification, NJ, 1990.

]. T. Mos03 and . Mossakowski, Foundations of Heterogeneous Specification, Recent Trends in Algebraic Development Techniques, 16th International Workshop, WADT 2002, pp.359-375, 2003.

I. Melatti, R. Palmer, G. Sawaya, Y. Yang, R. M. Kirby et al., Parallel and Distributed Model Checking in Eddy, Lecture Notes in Computer Science, vol.3, issue.1, pp.108-125, 2006.
DOI : 10.1007/3-540-63166-6_26

R. Milner, J. Parrow, and D. Walker, A Calculus of Mobile Processes, Journal of Information and Computation, vol.100, 1992.

J. [. Muñoz and . Rushby, Structural Embeddings: Mechanization with Method, Proc. of the World Congress in Formal Methods (FM99), pp.452-471, 1999.
DOI : 10.1007/3-540-48119-2_26

]. T. Mur89 and . Murata, Petri-Nets : Properties, Analysis and Applications, Proc. IEEE, pp.541-580, 1989.

G. [. Mauw and . Veltink, A Process Specification Formalism, Fundamenta Informaticae, pp.85-139, 1990.

P. Michel and V. Wiels, A framework for modular formal specification and verification, FME'97 : Industrial Applications and Strengthened Foundations of Formal Methods (Proc. 4th Intl. Symposium of Formal Methods Europe, pp.533-552, 1997.
DOI : 10.1007/3-540-63533-5_28

[. Okun, P. E. Black, and Y. Yesha, Testing with Model Checker : Insuring Fault Visibility, WSEAS Transactions on Systems, vol.2, issue.1, pp.77-82, 2003.

]. D. Par72 and . Parnas, A Technique for Software Module Specification with Examples, CACM, vol.15, issue.5, 1972.

]. D. Par75 and . Parnas, the influence of software structure on reliability, Proceedings of the international conference on Reliable software, pp.358-362, 1975.

C. Lawrence and . Paulson, A Formulation of the Simple Theory of Types (for Isabelle), Proc. of the International Conference on Computer Logic COLOG'88, pp.246-274, 1988.

C. Lawrence and . Paulson, Introduction to Isabelle, 1993.

C. Lawrence and . Paulson, Isabelle's object-logics, 1993.

C. Lawrence and . Paulson, Set Theory for Verification : I. From Foundations to Functions, Journal of Automated Reasoning, vol.11, issue.3, pp.353-389, 1993.

C. Lawrence and . Paulson, Isabelle : A Generic Theorem Prover, Lecture Notes in Computer Science, vol.828, 1994.

L. [. Pinto, R. Carloni, A. Passerone, and . Sangiovanni-vincentelli, Interchange Format for Hybrid Systems: Abstract Semantics, Proc. of Hybrid Systems : Computation and Control, pp.491-506, 2006.
DOI : 10.1007/11730637_37

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.4908

J. [. Parnas and . Madey, Functional documents for computer systems, Science of Computer Programming, vol.25, issue.1, pp.41-61, 1995.
DOI : 10.1016/0167-6423(95)96871-J

URL : http://doi.org/10.1016/0167-6423(95)96871-j

F. Patin, G. Pouzancre, and T. Servat, Approche formelle pour la réalisation d un système sécuritaire de contrôle commande de façades de quais, 4ème Conférence Annuelle d Ingénierie Système (AFIS'06), 2006.

A. [. Point and . Rauzy, Altarica -Constraint Automata as a Description Language, Journal Européen des Systèmes Automatisés, vol.33, issue.8-9, pp.1033-1052, 1999.

B. [. Papatsaras and . Stoddart, Global and Communicating State Machine Models in Event Driven B: A Simple Railway Case Study, Bert et al. [BBHR02], pp.458-476
DOI : 10.1007/3-540-45648-1_24

[. Reggio, M. Cerioli, and E. Astesiano, Towards a Rigorous Semantics of UML Supporting Its Multiview Approach, Fundamental Approaches to Software Engineering, 4th International Conference, FASE 2001, held as Part of the Joint European Conferences on Theory and Practice of Software Proceedings, volume 2029 of LNCS, pp.171-186, 2001.
DOI : 10.1007/3-540-45314-8_13

W. Reisig, Petri nets and algebraic specifications, Theoretical Computer Science, vol.80, issue.1, pp.1-34, 1991.
DOI : 10.1016/0304-3975(91)90203-E

URL : http://dx.doi.org/10.1016/0304-3975(91)90203-e

]. W. Rei98, . [. Reisig, I. Rumbaugh, G. Jacobson, and . Booch, Elements of Distributed Algorithms : Modeling and Analysis with Petri Nets The Unified Modeling Language Reference Manual, 1998.

J. Elliot and R. , Cognitive Support Features for Software Development Tools, 1999.

]. A. Ros98 and . Roscoe, The Theory and Practice of concurrency, 1998.

W. Reisig and G. Rozenberg, Lectures on Petri nets I : Basic models and II : Applications, volume 1491/1492 of Lecture Notes in Computer Science, 1998.

A. [. Reed and . Roscoe, The timed failures ??? Stability model for CSP, Theoretical Computer Science, vol.211, issue.1-2, pp.85-127, 1999.
DOI : 10.1016/S0304-3975(98)00214-X

URL : http://doi.org/10.1016/s0304-3975(98)00214-x

P. Rudnicki, An Overview of the Mizar Project, 1992.

C. [. Salaun and . Attiogbé, MIAOw : a Method to Integrate a Process Algebra with Formal Data, Informatica, vol.28, issue.2, pp.207-219, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00444078

]. G. Saa02a, M. Salaün, C. Allemand, and . Attiogbé, A Method to Combine any Process Algebra with an Algebraic Specification Language : the ?-Calculus Example, Proc. of the 26th Annual International Computer Software and Applications Conference (COMPSAC'02), 2002.

G. Salaün, M. Allemand, and C. Attiogbé, Specification of an access control system with a formalism combining CCS and CASL, Proceedings 16th International Parallel and Distributed Processing Symposium, 2002.
DOI : 10.1109/IPDPS.2002.1016624

M. [. Snook and . Butler, UML-B, ACM Transactions on Software Engineering and Methodology, vol.15, issue.1, pp.92-122, 2006.
DOI : 10.1145/1125808.1125811

K. Schewe, UML : A modern dinosaur ? A critical analysis of the Unified Modelling Language, Proc. 10th European-Japanese Conference on Information Modelling and Knowledge Bases, 2000.

W. J. Stoddart, S. E. Dunne, A. J. Galloway, and R. Shore, Abstract state machines: Designing distributed systems with state machines and B, Proc. [Ber98], 1998.
DOI : 10.1007/BFb0053364

J. H. Anthony, I. Simons, and . Graham, 30 Things That Go Wrong in Object Modelling with UML 1.3, Behavioral Specifications of Businesses and Systems, pp.221-242, 1999.

]. N. Sha00 and . Shankar, Combining Theorem Proving and Model Checking through Symbolic Analysis, Proc. of CONCUR'00, pp.1-16, 2000.

]. J. Sho92 and . Shoenfiel, Axioms of Set Theory, Handbook of Mathematical Logic, pp.321-344, 1992.

]. Sim85 and . Simone, Higher-level Synchronizing Sevices in Meije-SCCS, TCS, vol.37, pp.245-267, 1985.

M. Saaltink, S. Kromodimoeljo, B. Pase, D. Craigen, and I. Meisels, An EVES data abstraction example, Proc. of Formal Methods Europe : Industrial-Strength Formal Methods (FME'93), pp.578-596, 1993.
DOI : 10.1007/BFb0024668

C. [. Sernadas, C. Sernadas, and . Caleiro, Synchronization of logics, Treharne. Communicating B Machines Bert et al. [BBHR02], pp.217-247, 1997.
DOI : 10.1023/A:1004904401346

M. Heine, P. Sørensen, and . Urzyczyn, Lectures on the curry-howard isomorphism. Available as DIKU Rapport 98, 1998.

M. Heine-sørensen and P. Urzyczyn, Lectures on the curry-howard isomorphism, Studies in Logic and the Foundations of Mathematics, 2006.

C. Seguin and V. Wiels, Using a logical and categorical approach for the validation of fault-tolerant systems, Proceedings of Formal Methods Europe FME'96, 1996.
DOI : 10.1007/3-540-60973-3_96

R. [. Sekerenski and . Zurob, Translating Statecharts to B, Proc. of the Integrated Formal Methods (IFM'2002, 2002.
DOI : 10.1007/3-540-47884-1_8

]. I. Van-langevelde, A Compact File Format for Labeled Transition Systems, 2001.

V. Wiels and S. Easterbrook, Management of evolving specifications using category theory, Proceedings 13th IEEE International Conference on Automated Software Engineering (Cat. No.98EX239), pp.12-21, 1998.
DOI : 10.1109/ASE.1998.732561

[. Wirth, Program development by stepwise refinement, Communications of the ACM, vol.14, issue.4, pp.221-227, 1971.
DOI : 10.1145/362575.362577

URL : http://e-collection.library.ethz.ch/eserv/eth:3026/eth-3026-01.pdf

[. Xu, W. P. De-roever, and J. He, Program Development by Stepwise Refinement The Rely-Guarantee Method for Verifying Shared Variable Concurrent Programs, Communications of the ACM Formal Aspects of Computing, vol.14, issue.92, pp.221-227149, 1971.

M. [. Xu and . Swarup, Compositional Reasoning Using the Assumption-Commitment Paradigm, Lecture Notes in Computer Science, vol.1536, pp.565-583, 1998.
DOI : 10.1007/3-540-49213-5_22