Moving from Specifications to Contracts in Component-Based Design, FASE, pp.43-58, 2012. ,
DOI : 10.1007/978-3-642-28872-2_3
MIO Workbench: A Tool for Compositional Design with Modal Input/Output Interfaces, ATVA, pp.418-421, 2011. ,
DOI : 10.1007/978-3-642-24372-1_30
Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory, 1306. ,
DOI : 10.1007/978-3-642-40184-8_7
Process algebra for modal transition systemses, MEMICS, pp.9-18, 2010. ,
Parametric Modal Transition Systems, ATVA, pp.275-289, 2011. ,
DOI : 10.1007/978-3-642-24372-1_20
Modal Transition Systems: Composition and LTL Model Checking, ATVA, pp.228-242, 2011. ,
DOI : 10.1007/978-3-642-24372-1_17
Representation, reasoning, and relational structures: a hybrid logic manifesto, Logic Journal of IGPL, vol.8, issue.3, pp.339-365, 2000. ,
DOI : 10.1093/jigpal/8.3.339
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.3262
Generality in design and compositional verification usingTav, Formal Methods in System Design, vol.104, issue.3, pp.239-258, 1995. ,
DOI : 10.1007/BF01384499
Graphical versus logical specifications, Theoretical Computer Science, vol.106, issue.1, pp.3-20, 1992. ,
DOI : 10.1016/0304-3975(92)90276-L
URL : https://hal.archives-ouvertes.fr/inria-00075455
An industrial application of modal process logic, Science of Computer Programming, vol.29, issue.1-2, pp.3-22, 1997. ,
DOI : 10.1016/S0167-6423(96)00027-5
Model Checking Partial State Spaces with 3-Valued Temporal Logics, CAV, pp.274-287, 1999. ,
DOI : 10.1007/3-540-48683-6_25
A spatial logic for concurrency (part I), Information and Computation, vol.186, issue.2, pp.194-235, 2003. ,
DOI : 10.1016/S0890-5401(03)00137-8
Design and synthesis of synchronization skeletons using branching-time temporal logic, Logic of Programs, pp.52-71, 1981. ,
Supervisory Control for Modal Specifications of Services, WODES, pp.428-435, 2010. ,
DOI : 10.3182/20100830-3-DE-4013.00069
URL : https://hal.archives-ouvertes.fr/inria-00472736
MTSA: Eclipse support for modal transition systems construction, analysis and elaboration, ETX, pp.6-10, 2007. ,
Comparing disjunctive modal transition systems with an one-selecting variant, The Journal of Logic and Algebraic Programming, vol.77, issue.1-2, pp.20-39, 2008. ,
DOI : 10.1016/j.jlap.2008.05.003
URL : http://doi.org/10.1016/j.jlap.2008.05.003
Characteristic ??-Calculus Formulas for Underspecified Transition Systems, Electronic Notes in Theoretical Computer Science, vol.128, issue.2, pp.103-116, 2005. ,
DOI : 10.1016/j.entcs.2004.11.031
Compositionality of Hennessy???Milner logic by structural operational semantics, Theoretical Computer Science, vol.354, issue.3, pp.421-440, 2006. ,
DOI : 10.1016/j.tcs.2005.11.035
URL : http://doi.org/10.1016/j.tcs.2005.11.035
Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987. ,
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966
THE STRUCTURE OF COMMUTATIVE RESIDUATED LATTICES, International Journal of Algebra and Computation, vol.12, issue.04, pp.509-524, 2002. ,
DOI : 10.1142/S0218196702001048
Acceptance trees, Journal of the ACM, vol.32, issue.4, pp.896-928, 1985. ,
DOI : 10.1145/4221.4249
Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, issue.1, pp.137-161, 1985. ,
DOI : 10.1145/2455.2460
The use of static constructs in a modal process logic, Logic at Botik, pp.163-180, 1989. ,
Results on the propositional ??-calculus, Theoretical Computer Science, vol.27, issue.3, pp.333-354, 1983. ,
DOI : 10.1016/0304-3975(82)90125-6
Equation solving using modal transition systems, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.108-117, 1990. ,
DOI : 10.1109/LICS.1990.113738
Modal specifications, Automatic Verification Methods for Finite State Systems, pp.232-246, 1989. ,
DOI : 10.1007/3-540-52148-8_19
Ideal specification formalism = expressivity + compositionality + decidability + testability +, CONCUR, pp.33-56, 1990. ,
Proof systems for satisfiability in Hennessy-Milner Logic with recursion, Theoretical Computer Science, vol.72, issue.2-3, pp.265-288, 1990. ,
DOI : 10.1016/0304-3975(90)90038-J
Compositionality through an operational semantics of contexts, ICALP, pp.526-539, 1990. ,
Modal Transition Systems as the Basis for Interface Theories and Product Lines, 2008. ,
Local reasoning about programs that alter data structures, In CSL, pp.1-19, 2001. ,
Papers on Time and Tense, 1968. ,
Specification and verification of concurrent systems in CESAR, Symp. Program, pp.337-351, 1982. ,
DOI : 10.1007/3-540-11494-7_22
Residual for Component Specifications, Electronic Notes in Theoretical Computer Science, vol.215, pp.93-110, 2008. ,
DOI : 10.1016/j.entcs.2008.06.023
URL : https://hal.archives-ouvertes.fr/inria-00141898
Why are modalities good for interface theories? In ACSD, pp.119-127, 2009. ,
Separation logic: a logic for shared mutable data structures, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.55-74, 2002. ,
DOI : 10.1109/LICS.2002.1029817
Merging partial behavioural models, SIGSOFT FSE, pp.43-52, 2004. ,
DOI : 10.1145/1041685.1029904
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.4666
Residuated Lattices, Proceedings of the National Academy of Sciences, vol.24, issue.3, pp.335-354, 1939. ,
DOI : 10.1073/pnas.24.3.162
Quantales and (noncommutative) linear logic, The Journal of Symbolic Logic, vol.II, issue.01, pp.41-64, 1990. ,
DOI : 10.1017/S0305004100065403