{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:13:20Z","timestamp":1725977600111},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319912707"},{"type":"electronic","value":"9783319912714"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-91271-4_14","type":"book-chapter","created":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T14:32:55Z","timestamp":1525703575000},"page":"204-218","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Systematic Refinement of Abstract State Machines with Higher-Order Logic"],"prefix":"10.1007","author":[{"given":"Flavio","family":"Ferrarotti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sen\u00e9n","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus-Dieter","family":"Schewe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Mar\u00eda","family":"Turull-Torres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,8]]},"reference":[{"key":"14_CR1","volume-title":"The B-Book - Assigning Programs to Meanings","author":"JR Abrial","year":"2005","unstructured":"Abrial, J.R.: The B-Book - Assigning Programs to Meanings. Cambridge University Press, Cambridge (2005)"},{"key":"14_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195881","volume-title":"Modeling in Event-B - System and Software Engineering","author":"JR Abrial","year":"2010","unstructured":"Abrial, J.R.: Modeling in Event-B - System and Software Engineering. Cambridge University Press, Cambridge (2010)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/3-540-45071-8_40","volume-title":"Computing and Combinatorics","author":"FN Abu-Khzam","year":"2003","unstructured":"Abu-Khzam, F.N., Langston, M.A.: Graph coloring and the immersion order. In: Warnow, T., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 394\u2013403. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45071-8_40"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Beaudry, M., McKenzie, P.: Circuits, matrices, and nonassociative computation. In: Proceedings of the Seventh Annual Structure in Complexity Theory Conference, pp. 94\u2013106 (1992)","DOI":"10.1109\/SCT.1992.215384"},{"key":"14_CR5","first-page":"82","volume":"92","author":"A Blass","year":"2007","unstructured":"Blass, A., Gurevich, Y.: Background of computation. Bull. EATCS 92, 82\u2013114 (2007)","journal-title":"Bull. EATCS"},{"key":"14_CR6","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Graduate Texts in Mathematics, vol. 184. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-1-4612-0619-4"},{"key":"14_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18216-7","volume-title":"Abstract State Machines. A Method for High-Level System Design and Analysis","author":"E B\u00f6rger","year":"2003","unstructured":"B\u00f6rger, E., St\u00e4rk, R.F.: Abstract State Machines. A Method for High-Level System Design and Analysis. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-642-18216-7"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/572326.572328","volume":"2","author":"S Dill","year":"2002","unstructured":"Dill, S., Kumar, R., Mccurley, K.S., Rajagopalan, S., Sivakumar, D., Tomkins, A.: Self-similarity in the web. ACM Trans. Internet Technol. 2(3), 205\u2013223 (2002)","journal-title":"ACM Trans. Internet Technol."},{"key":"14_CR9","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R. (ed.) Complexity of Computations. SIAM-AMS Proceedings, vol. 7, pp. 27\u201341. American Mathematical Society (1974)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2016.08.013","volume":"649","author":"F Ferrarotti","year":"2016","unstructured":"Ferrarotti, F., Schewe, K.D., Tec, L., Wang, Q.: A new thesis concerning synchronised parallel computing - simplified parallel ASM thesis. Theor. Comput. Sci. 649, 25\u201353 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR11","unstructured":"Ferrarotti, F.: Expressibility of higher-order logics on relational databases: proper hierarchies. Ph.D. thesis, Massey University, Wellington, New Zealand (2008). http:\/\/hdl.handle.net\/10179\/799"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-662-55386-2_9","volume-title":"Logic, Language, Information, and Computation","author":"F Ferrarotti","year":"2017","unstructured":"Ferrarotti, F., Gonz\u00e1lez, S., Turull-Torres, J.M.: On fragments of higher order logics that on finite structures collapse to second order. In: Kennedy, J., de Queiroz, R.J.G.B. (eds.) WoLLIC 2017. LNCS, vol. 10388, pp. 125\u2013139. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-55386-2_9"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1093\/jigpal\/jzt025","volume":"22","author":"F Ferrarotti","year":"2014","unstructured":"Ferrarotti, F., Ren, W., Turull Torres, J.M.: Expressing properties in second- and third-order logic: hypercube graphs and SATQBF. Logic J. IGPL 22(2), 355\u2013386 (2014)","journal-title":"Logic J. IGPL"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Grohe, M., Kawarabayashi, K., Marx, D., Wollan, P.: Finding topological subgraphs is fixed-parameter tractable. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC 2011), pp. 479\u2013488. ACM (2011)","DOI":"10.1145\/1993636.1993700"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"065103","DOI":"10.1103\/PhysRevE.68.065103","volume":"68","author":"R Guimer\u00e0","year":"2003","unstructured":"Guimer\u00e0, R., Danon, L., D\u00edaz-Guilera, A., Giralt, F., Arenas, A.: Self-similar community structure in a network of human interactions. Phys. Rev. E 68, 065103 (2003)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2006.01.009","volume":"355","author":"L Hella","year":"2006","unstructured":"Hella, L., Turull Torres, J.M.: Computing queries with higher-order logics. Theor. Comput. Sci. 355(2), 197\u2013214 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Immerman, N.: Languages which capture complexity classes (preliminary report). In: Johnson, D.S., et al. (eds.) Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC 1983), pp. 347\u2013354. ACM (1983)","DOI":"10.1145\/800061.808765"},{"key":"14_CR18","series-title":"Graduate texts in computer science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Graduate texts in computer science. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0539-5"},{"key":"14_CR19","volume-title":"Specifying Systems, The TLA$$^+$$+ Language and Tools for Hardware and Software Engineers","author":"L Lamport","year":"2002","unstructured":"Lamport, L.: Specifying Systems, The TLA$$^+$$+ Language and Tools for Hardware and Software Engineers. Addison-Wesley, Boston (2002)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Higher order logic. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A., Siekmann, J.H. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming. Deduction Methodologies, vol. 2, pp. 229\u2013322. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198537465.003.0004"},{"issue":"21","key":"14_CR21","doi-asserted-by":"publisher","first-page":"4947","DOI":"10.1242\/jcs.02714","volume":"118","author":"A R\u00e9ka","year":"2005","unstructured":"R\u00e9ka, A.: Scale-free networks in cell biology. J. Cell Sci. 118(21), 4947\u20134957 (2005)","journal-title":"J. Cell Sci."},{"key":"14_CR22","unstructured":"Schewe, K.D., Torres, J.M.T.: Fixed-point quantifiers in higher order logics. In: Kiyoki, Y., et al. (eds.) Information Modelling and Knowledge Bases XVII. Frontiers in Artificial Intelligence and Applications, vol. 136, pp. 237\u2013244. IOS Press (2006)"},{"issue":"4","key":"14_CR23","first-page":"765","volume":"19","author":"KD Schewe","year":"2010","unstructured":"Schewe, K.D., Wang, Q.: A customised ASM thesis for database transformations. Acta Cybernetica 19(4), 765\u2013805 (2010)","journal-title":"Acta Cybernetica"},{"issue":"20","key":"14_CR24","first-page":"3043","volume":"16","author":"KD Schewe","year":"2010","unstructured":"Schewe, K.D., Wang, Q.: XML database transformations. J. Univers. Comput. Sci. 16(20), 3043\u20133072 (2010)","journal-title":"J. Univers. Comput. Sci."},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1038\/nature03248","volume":"433","author":"C Song","year":"2005","unstructured":"Song, C., Havlin, S., Makse, H.A.: Self-similarity of complex networks. Nature 433, 392\u2013395 (2005)","journal-title":"Nature"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Lewis, H.R., et al. (eds.) Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC 2014), pp. 137\u2013146. ACM (1982)","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Abstract State Machines, Alloy, B, TLA, VDM, and Z"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91271-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T15:35:42Z","timestamp":1720280142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91271-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319912707","9783319912714"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91271-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}