{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T02:40:08Z","timestamp":1748832008862,"version":"3.41.0"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319313092"},{"type":"electronic","value":"9783319313115"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-31311-5_1","type":"book-chapter","created":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T08:37:03Z","timestamp":1459499823000},"page":"1-30","source":"Crossref","is-referenced-by-count":1,"title":["Reuse and Integration of Specification Logics: The Hybridisation Perspective"],"prefix":"10.1007","author":[{"given":"Luis S.","family":"Barbosa","sequence":"first","affiliation":[]},{"given":"Manuel A.","family":"Martins","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Madeira","sequence":"additional","affiliation":[]},{"given":"Renato","family":"Neves","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,2]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-642-32621-9_11","volume-title":"Logic, Language, Information and Computation","author":"Carlos Areces","year":"2012","unstructured":"Areces, C., Fervari, R., Hoffmann, G.: Moving arrows and four model checking results. In: Ong, L., de Queiroz, R. (eds.) Proceedings of the 19th International Workshop on Logic. Language, Information and Computation (WoLLIC 2012). Lecture Notes in Computer Science, vol. 7456, pp. 142\u2013153. Springer, Buenos Aires, Argentina (2012)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Areces, C.,\u00a0Fervari, R.,\u00a0Hoffmann, G.: Tableaux for relation-changing modal logics. In: Proceedings of Frontiers of Combining Systems 2013, Nancy, France, Sept 2013","DOI":"10.1007\/978-3-642-40885-4_19"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1093\/jigpal\/jzt030","volume":"22","author":"C Areces","year":"2014","unstructured":"Areces, C., Fervari, R., Hoffmann, G.: Swap logic. Logic J. IGPL 22(2), 309\u2013332 (2014)","journal-title":"Logic J. IGPL"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1093\/jigpal\/jzv020","volume":"23","author":"C Areces","year":"2015","unstructured":"Areces, C., Fervari, R., Hoffmann, G.: Relation-changing modal operators. Logic J. IGPL 23(4), 601\u2013627 (2015)","journal-title":"Logic J. IGPL"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Areces, C.,\u00a0ten Cate, B.: Hybrid logics. In:\u00a0Blackburn, P.,\u00a0Wolter, F.,\u00a0van Benthem, J. (eds.) Handbook of Modal Logic. Studies in Logic and Practical Reasoning, vol. 3, pp. 822\u2013868. Elsevier (2007)","DOI":"10.1016\/S1570-2464(07)80017-6"},{"key":"1_CR6","unstructured":"Burstall, R., Diaconescu, R.: Hiding and behaviour: an institutional approach. In: Roscoe, W. (ed.) A Classical Mind: Essays in Honour of C.A.R. Hoare, pp. 75\u201392. Prentice-Hall (1994)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Burstall, R.M., Goguen, J.A.: The semantics of CLEAR, a specification language. In:\u00a0Bj\u00f8rner, D. (ed.) Abstract Software Specifications (1979 Copenhagen Winter School, 22 Jan\u20132 Feb 1979), Lecture Notes in Computer Science, vol.\u00a086, pp. 292\u2013332. Springer (1980)","DOI":"10.1007\/3-540-10007-5_41"},{"issue":"1\u20132","key":"1_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jlap.2005.09.002","volume":"67","author":"M Bidoit","year":"2006","unstructured":"Bidoit, M., Hennicker, R.: Constructor-based observational logic. J. Log. Algebr. Program. 67(1\u20132), 3\u201351 (2006)","journal-title":"J. Log. Algebr. Program."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Beierle, C., Kern-Isberner, G.: Looking at probabilistic conditionals from an institutional point of view. In:\u00a0Kern-Isberner, G.,\u00a0R\u00f6dder, W.,\u00a0Kulmann, F. (eds.) Conditionals, Information, and Inference (Revised Selected Papers of WCII 2002, Hagen, Germany, 13\u201315 May 2002), Lecture Notes in Computer Science, vol. 3301, pp. 162\u2013179. Springer (2005)","DOI":"10.1007\/11408017_10"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1093\/jigpal\/8.3.339","volume":"8","author":"P Blackburn","year":"2000","unstructured":"Blackburn, P.: Representation, reasoning, and relational structures: a hybrid logic manifesto. Logic J. IGPL 8(3), 339\u2013365 (2000)","journal-title":"Logic J. IGPL"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10849-013-9184-6","volume":"23","author":"LS Barbosa","year":"2014","unstructured":"Barbosa, L.S., Martins, M.A., Carreteiro, M.: A Hilbert-style axiomatisation for equational hybrid logic. J. Logic Lang. Inf. 23(1), 31\u201352 (2014)","journal-title":"J. Logic Lang. Inf."},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0304-3975(01)00317-6","volume":"286","author":"T Borzyszkowski","year":"2002","unstructured":"Borzyszkowski, T.: Logical systems for structured specifications. Theor. Comput. Sci. 286(2), 197\u2013245 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10849-005-3927-y","volume":"14","author":"T Bra\u00fcner","year":"2005","unstructured":"Bra\u00fcner, T.: Natural deduction for first-order hybrid logic. J. Logic Lang. Inf. 14(2), 173\u2013198 (2005)","journal-title":"J. Logic Lang. Inf."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Bra\u00fcner, T.: Hybrid Logic and Its Proof-Theory. Applied Logic Series. Springer (2010)","DOI":"10.1007\/978-94-007-0002-4"},{"issue":"1\u20132","key":"1_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jlap.2005.09.004","volume":"67","author":"C C\u00eerstea","year":"2006","unstructured":"C\u00eerstea, C.: An institution of modal logics for coalgebras. J. Log. Algebr. Program. 67(1\u20132), 87\u2013113 (2006)","journal-title":"J. Log. Algebr. Program."},{"key":"1_CR16","unstructured":"Carnielli, W., Coniglio, M.E.: Combining logics. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Winter 2011 edn. (2011)"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s11787-008-0035-1","volume":"2","author":"M Codescu","year":"2008","unstructured":"Codescu, M., G\u0103in\u0103, D.: Birkhoff completeness in institutions. Logica Universalis 2(2), 277\u2013309 (2008)","journal-title":"Logica Universalis"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Caleiro, C., Mateus, P., Sernadas, A., Sernadas, C.: Quantum institutions. In:\u00a0Futatsugi, K., Jouannaud, J.-P.,\u00a0Meseguer, J. (eds.) Algebra, Meaning, and Computation, Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday. Lecture Notes in Computer Science, vol. 4060, pp. 50\u201364. Springer (2006)","DOI":"10.1007\/11780274_4"},{"issue":"1\u20132","key":"1_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2007.02.055","volume":"380","author":"M Droste","year":"2007","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. Theor. Comput. Sci. 380(1\u20132), 69\u201386 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR20","unstructured":"Diaconescu, R\u0103zvan: Institution-independent Model Theory. Studies in Universal Logic. Birkh\u00e4user Basel (2008)"},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1002\/malq.200910131","volume":"57","author":"R Diaconescu","year":"2011","unstructured":"Diaconescu, R.: On quasi-varieties of multiple valued logic models. Math. Log. Q. 57(2), 194\u2013203 (2011)","journal-title":"Math. Log. Q."},{"key":"1_CR22","unstructured":"Diaconescu, R.: Quasi-varieties and initial semantics in hybridized institutions. J. Logic Comput. (2015)"},{"key":"1_CR23","unstructured":"Diaconescu, R., Madeira, A.: Encoding hybridized institutions into first-order logic. Math. Struct. Comput. Sci. 1\u201344 (2015) (in print)"},{"issue":"1\u20132","key":"1_CR24","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.tcs.2007.02.068","volume":"379","author":"R Diaconescu","year":"2007","unstructured":"Diaconescu, R., Stefaneas, P.S.: Ultraproducts and possible worlds semantics in institutions. Theor. Comput. Sci. 379(1\u20132), 210\u2013230 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/147508.147524","volume":"39","author":"JA Goguen","year":"1992","unstructured":"Goguen, J.A., Burstall, R.M.: Institutions: abstract model theory for specification and programming. J. ACM 39(1), 95\u2013146 (1992)","journal-title":"J. ACM"},{"key":"1_CR26","unstructured":"Gottwald, S.: A Treatise on Many-Valued Logics. Studies in Logic and Computation vol. 9. Research Studies Press (2001)"},{"issue":"3\u20135","key":"1_CR27","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s001650200013","volume":"13","author":"JA Goguen","year":"2002","unstructured":"Goguen, J.A., Ro\u015fu, G.: Institution morphisms. Formal Asp. Comput. 13(3\u20135), 274\u2013307 (2002)","journal-title":"Formal Asp. Comput."},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: 11th Annual IEEE Symposium on Logic in Computer Science (LICS\u201996, New Brunswick, New Jersey, USA, 27\u201330 July 1996), pp. 278\u2013292 (1996)","DOI":"10.1109\/LICS.1996.561342"},{"key":"1_CR29","unstructured":"Hull, M.E.C.,\u00a0Jackson, K.,\u00a0Dick, J.: Requirements Engineering, 2nd edn. Springer Verlag (2005)"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Heitmeyer, C.L., Kirby, J., Labaw, B.G.: The SCR method for formally specifying, verifying, and validating requirements: tool support. In:\u00a0Richards Adrion, W., Fuggetta, A., Taylor, R.N., Wasserman, A.I. (eds.) Pulling Together, Proceedings of the 19th International Conference on Software Engineering, Boston, Massachusetts, USA, 17\u201323 May 1997, pp. 610\u2013611. ACM (1997)","DOI":"10.1145\/253228.253498"},{"key":"1_CR31","first-page":"147","volume":"16","author":"A Indrzejczak","year":"2007","unstructured":"Indrzejczak, A.: Modal hybrid logic. Logic Logical Philos. 16, 147\u2013257 (2007)","journal-title":"Logic Logical Philos."},{"key":"1_CR32","unstructured":"Jackson, D.: Software Abstractions (Logic, Language, and Analysis), 2nd edn. MIT Press (2011)"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Segala, R., Vaandrager, F.W., Weinberg, H.B.: Hybrid i\/o automata. In:\u00a0Alur, R., Henzinger, T.A., Sontag, E.D. (eds.) Hybrid Systems III: Verification and Control (DIMACS\/SYCON Workshop, 22\u201325 Oct 1995, Ruttgers University, New Brunswick, NJ, USA). Lecture Notes in Computer Science, vol. 1066, pp. 496\u2013510. Springer (1995)","DOI":"10.1007\/BFb0020971"},{"key":"1_CR34","unstructured":"Madeira, A.: Foundations and techniques for software reconfigurability. Ph.D. thesis, Universidades do Minho, Aveiro and Porto (Joint MAP-i Doctoral Programme), July 2013"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Madeira, A., Faria, J.M., Martins, M.A., Barbosa, L.S.: Hybrid specification of reactive systems: an institutional approach. In:\u00a0Barthe, G.,\u00a0Pardo, A.,\u00a0Schneider, G. (eds.) Software Engineering and Formal Methods (SEFM 2011, Montevideo, Uruguay, 14\u201318 Nov 2011). Lecture Notes in Computer Science, vol. 7041, pp. 269\u2013285. Springer (2011)","DOI":"10.1007\/978-3-642-24690-6_19"},{"key":"1_CR36","first-page":"285","volume":"22","author":"T Mossakowski","year":"2003","unstructured":"Mossakowski, T., Haxthausen, A., Sannella, D., Tarlecki, A.: CASL: the common algebraic specification language: semantics and proof theory. Comput. Inf. 22, 285\u2013321 (2003)","journal-title":"Comput. Inf."},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Madeira, A., Martins, M.A., Barbosa, L.S.: Boilerplates for reconfigurable systems: a language and its semantics. In:\u00a0Du Bois, A.R., Trinder, P. (eds.) Programming Languages\u201417th Brazilian Symposium, SBLP 2013, Bras\u00edlia, Brazil, 3\u20134 Oct 2013. Proceedings. Lecture Notes in Computer Science, vol. 8129, pp. 75\u201389. Springer (2013)","DOI":"10.1007\/978-3-642-40922-6_6"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Martins, M.A., Madeira, A., Barbosa, L.S., Neves, R.: Paradigm integration in a specification course. In: Joshi, J., Bertino, E., Thuraisingham, B.M., Liu, L. (eds.) Proceedings of 15th IEEE International Conference on Information Reuse and Intergration, IRI 2014, Redwood City, CA, USA, 13\u201315 Aug 2014, pp. 492\u2013499. IEEE Press (2014)","DOI":"10.1109\/IRI.2014.7051929"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Martins, M.A., Madeira, A., Diaconescu, R., Barbosa, L.S.: Hybridization of institutions. In:\u00a0Corradini, A.,\u00a0Klin, B.,\u00a0C\u00eerstea, C. (eds.) Algebra and Coalgebra in Computer Science (CALCO 2011, Winchester, UK, 30 Aug\u20132 Sept 2011). Lecture Notes in Computer Science, vol. 6859, pp. 283\u2013297. Springer (2011)","DOI":"10.1007\/978-3-642-22944-2_20"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Mossakowski, T., Maeder, C., L\u00fcttich, K.: The heterogeneous tool set, Hets. In:\u00a0Grumberg, O.,\u00a0Huth, M. (eds.) Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2007\u2014Braga, Portugal, 24 Mar\u20141 Apr 2007). Lecture Notes in Computer Science, vol. 4424, pp. 519\u2013522. Springer (2007)","DOI":"10.1007\/978-3-540-71209-1_40"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Mossakowski, T.: Different types of arrow between logical frameworks. In: auf der Heide, F.M.,\u00a0Monien, B. (eds.) Automata, Languages and Programming (ICALP96, Paderborn, Germany, 8\u201312 July 1996). Lecture Notes in Computer Science, vol. 1099, pp. 158\u2013169. Springer (1996)","DOI":"10.1007\/3-540-61440-0_125"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Mossakowski, T., Roggenbach, M.: Structured CSP\u2014a process algebra as an institution. In: Fiadeiro, J.L., Schobbens, P.-Y. (eds.) Recent Trends in Algebraic Development Techniques (Revised Selected Papers of WADT 2006, La Roche en Ardenne, Belgium, 1\u20133 June 2006). Lecture Notes in Computer Science, vol. 4409, pp. 92\u2013110. Springer (2006)","DOI":"10.1007\/978-3-540-71998-4_6"},{"key":"1_CR43","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/978-3-642-40206-7_28","volume-title":"Algebra and Coalgebra in Computer Science","author":"Renato Neves","year":"2013","unstructured":"Neves, R., Madeira, A., Martins, M.A., Barbosa, L.S.: Hybridisation at work. In: Heckel, R., Milius, S. (eds.) Algebra and Coalgebra in Computer Science\u20145th International Conference, CALCO 2013, Warsaw, Poland, 3\u20136 Sept 2013. Proceedings. Lecture Notes in Computer Science, vol. 8089, pp. 340\u2013345 (2013)"},{"key":"1_CR44","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-319-04717-1_3","volume-title":"Integration of Reusable Systems","author":"Renato Neves","year":"2014","unstructured":"Neves, R., Madeira, A., Martins, M.A., Barbosa, L.S.: An institution for alloy and its translation to second-order logic. In: Bouabana-Tebibel, T., Rubin, S.H. (eds.) Integration of Reusable Systems [extended versions of the best papers presented at IEEE International Conference on Information Reuse and Integration and IEEE International Workshop on Formal Methods Integration, San Francisco, CA, USA, Aug 2013]. Advances in Intelligent Systems and Computing, vol. 263, pp. 45\u201375. Springer (2013)"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Neves, R., Madeira, A., Martins, M.A., Barbosa, L.S.: Completeness and decidability results for hybrid(ised) logics. In: Braga, C., Mart\u00ed-Oliet, N. (eds.) Formal Methods: Foundations and Applications - 17th Brazilian Symposium, SBMF 2014, Macei\u00f3, AL, Brazil, 29 Sept\u20131 Oct 2014. Lecture Notes in Computer Science, vol. 8941, pp. 146\u2013161. Springer (2015)","DOI":"10.1007\/978-3-319-15075-8_10"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Prior, A.N.: Past, Present and Future. Oxford University Press (1967)","DOI":"10.1093\/acprof:oso\/9780198243113.001.0001"},{"issue":"2","key":"1_CR47","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0890-5401(91)90026-X","volume":"93","author":"S Passy","year":"1991","unstructured":"Passy, S., Tinchev, T.: An essay in combinatory dynamic logic. Inf. Comput. 93(2), 263\u2013332 (1991)","journal-title":"Inf. Comput."},{"key":"1_CR48","unstructured":"Ciocarlie, H.,\u00a0Szepesia, R.: An overview on software reconfiguration. Theory Appl. Math. Comput. Sci. 1, 74\u201379 (2011)"},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"Segala, R.: A compositional trace-based semantics for probabilistic automata. In:\u00a0Lee, I., Smolka, S.A. (eds.) Concurrency Theory (CONCUR\u201995\u2014Philadelphia, PA, USA, 21\u201324 Aug 1995). Lecture Notes in Computer Science, vol. 962, pp. 234\u2013248. Springer (1995)","DOI":"10.1007\/3-540-60218-6_17"},{"issue":"12\u201313","key":"1_CR50","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.tcs.2008.11.020","volume":"410","author":"L Schr\u00f6der","year":"2009","unstructured":"Schr\u00f6der, L., Mossakowski, T.: HasCasl: integrated higher-order specification and program development. Theor. Comput. Sci. 410(12\u201313), 1217\u20131260 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"38","key":"1_CR51","doi-asserted-by":"publisher","first-page":"5095","DOI":"10.1016\/j.tcs.2011.05.008","volume":"412","author":"A Sokolova","year":"2011","unstructured":"Sokolova, A.: Probabilistic systems coalgebraically: a survey. Theor. Comput. Sci. 412(38), 5095\u20135110 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR52","doi-asserted-by":"crossref","unstructured":"Sannella, D., Tarlecki, A.: Foundations of Algebraic Specification and Formal Software Development. Monographs on Theoretical Computer Science, an EATCS Series. Springer (2012)","DOI":"10.1007\/978-3-642-17336-3"},{"key":"1_CR53","unstructured":"van Bentham, J.: Modal Logic and Classic Logic. Humanities Press (1983)"},{"key":"1_CR54","doi-asserted-by":"crossref","unstructured":"van Benthem, J.: An essay on sabotage and obstruction. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning, Essays in Honor of J\u00f6rg H. Siekmann on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, vol. 2605, pp. 268\u2013276. Springer (2005)","DOI":"10.1007\/978-3-540-32254-2_16"}],"container-title":["Advances in Intelligent Systems and Computing","Theoretical Information Reuse and Integration"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31311-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T02:24:45Z","timestamp":1748831085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31311-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319313092","9783319313115"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31311-5_1","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016]]}}}