{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T11:46:00Z","timestamp":1787312760114,"version":"3.56.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,28]],"date-time":"2017-10-28T00:00:00Z","timestamp":1509148800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"INRIA-DGA grant \u201cOrchids\u201d","award":["12 81 0312"],"award-info":[{"award-number":["12 81 0312"]}]},{"DOI":"10.13039\/501100003833","name":"Hydro-Qu\u00e9bec","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003833","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Les Offices Jeunesse Internationaux du Qu\u00e9bec (LOJIQ)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10703-017-0303-x","type":"journal-article","created":{"date-parts":[[2017,10,28]],"date-time":"2017-10-28T03:49:11Z","timestamp":1509162551000},"page":"6-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the complexity of monitoring Orchids signatures, and recurrence equations"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5879-3304","authenticated-orcid":false,"given":"Jean","family":"Goubault-Larrecq","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Philippe","family":"Lachance","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,10,28]]},"reference":[{"key":"303_CR1","volume-title":"Handbook of linear algebra, discrete mathematics and its applications, vol 39, chap\u00a025","author":"M Akian","year":"2006","unstructured":"Akian M, Bapat R, Gaubert S (2006) Max-plus algebras. In: Hogben L (ed) Handbook of linear algebra, discrete mathematics and its applications, vol 39, chap\u00a025. Chapman and Hall\/CRC, Boca Raton"},{"issue":"2","key":"303_CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10817-010-9174-1","volume":"46","author":"E Albert","year":"2011","unstructured":"Albert E, Arenas P, Genaim S, Puebla G (2011) Closed-form upper bounds in static cost analysis. J Autom Reason 46(2):161\u2013203","journal-title":"J Autom Reason"},{"key":"303_CR3","unstructured":"Assaf M (2015) From qualitative to quantitative program analysis: permissive enforcement of secure information flow. PhD thesis, Universit\u00e9 Rennes I"},{"issue":"2","key":"303_CR4","doi-asserted-by":"crossref","first-page":"15:1","DOI":"10.1145\/2699444","volume":"62","author":"D Basin","year":"2015","unstructured":"Basin D, Klaedtke F, M\u00fcller S, Z\u0103linescu E (2015) Monitoring metric first-order temporal properties. J Assoc Comput Mach 62(2):15:1\u201315:45","journal-title":"J Assoc Comput Mach"},{"key":"303_CR5","doi-asserted-by":"crossref","unstructured":"Brockschmidt M, Emmes F, Falke S, Fuhs C, Giesl J (2014) Alternating runtime and size complexity analysis of integer programs. In: Proceedings of international conference of tools and algorithms for the construction and analysis of systems (TACAS\u201914). Lecture notes in computer science, vol 8413. Springer","DOI":"10.1007\/978-3-642-54862-8_10"},{"key":"303_CR6","doi-asserted-by":"crossref","unstructured":"Flajolet P, Sedgwick R (2009) Analytic combinatorics. Cambridge University Press, iSBN 0521898064. ISBN-13 978-0521898065","DOI":"10.1017\/CBO9780511801655"},{"key":"303_CR7","doi-asserted-by":"crossref","unstructured":"Flores-Montoya A, H\u00e4hnle R (2014) Resource analysis of complex programs with cost equations. In: Proceedings of 12th Asian symposium on programming languages and systems (APLAS\u201914). Lecture notes in computer science, vol 8858. Springer, Singapore, Singapore","DOI":"10.1007\/978-3-319-12736-1_15"},{"key":"303_CR8","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq J, Olivain J (2008) A smell of Orchids. In: Leucker M (ed) Proceedings of the 8th workshop on runtime verification (RV\u201908). Lecture notes in computer science, vol 5289, pp 1\u201320. Springer, Budapest, Hungary. https:\/\/doi.org\/10.1007\/978-3-540-89247-2_1","DOI":"10.1007\/978-3-540-89247-2_1"},{"key":"303_CR9","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq J, Olivain J (2013) On\u00a0the efficiency of mathematics in intrusion detection: the NetEntropy case. In: Danger JL, Debbabi M, Marion JY, Garcia-Alfaro J, Zincir-Heywood N (eds) Revised selected papers of the 6th international symposium on foundations and practice of security (FPS\u201913). Lecture notes in computer science, vol 8352. Springer, La Rochelle, France, pp 3\u201316. https:\/\/doi.org\/10.1007\/978-3-319-05302-8_1","DOI":"10.1007\/978-3-319-05302-8_1"},{"key":"303_CR10","unstructured":"Havelund K, Reger G (2015) Specification of parametric monitors\u2014quantified event automata versus rule systems. In: Drechsler R, Kuhne U (eds) Formal modeling and verification of cyber-physical systems. Springer, pp 151\u2013189, 1st international summer school on methods and tools for the design of digital systems (SyDe). Springer, Bremen, Germany, pp 151\u2013189"},{"key":"303_CR11","doi-asserted-by":"publisher","unstructured":"Jin D, O\u2019Neil\u00a0Meredith P, Lee C, Ro\u015fu G (2012) JavaMOP: efficient parametric runtime monitoring framework. In: Proceeding of the 34th international conference on software engineering (ICSE\u201912), IEEE, pp 1427\u20131430. https:\/\/doi.org\/10.1109\/ICSE.2012.6227231","DOI":"10.1109\/ICSE.2012.6227231"},{"key":"303_CR12","doi-asserted-by":"crossref","unstructured":"Luo Q, Zhang Y, Lee C, Jin D, O\u2019Neil\u00a0Meredith P, \u015eerb\u0103nu\u0163\u0103 TF, Ro\u015fu G (2014) RV-monitor: efficient parametric runtime verification with simultaneous properties. In: Bonakdarpour B, Smolka SA (eds) Proceedings of the 5th international conference on runtime verification (RV\u201914), LNCS, vol 8734. Springer, Toronto, ON, CA, pp 285\u2013300","DOI":"10.1007\/978-3-319-11164-3_24"},{"key":"303_CR13","doi-asserted-by":"publisher","unstructured":"Olivain J, Goubault-Larrecq J (2005) The Orchids intrusion detection tool. In: Etessami K, Rajamani S (eds) Proceedings of the 17th international conference on computer aided verification (CAV\u201905). Lecture notes in computer science, vol 3576. Springer, Edinburgh, Scotland, UK, pp 286\u2013290. https:\/\/doi.org\/10.1007\/11513988_28","DOI":"10.1007\/11513988_28"},{"key":"303_CR14","unstructured":"Purczy\u0144ski W (2003) Linux kernel privileged process hijacking vulnerability. http:\/\/www.securityfocus.com\/bid\/7112 , bugTraq Id 7112. Last read: september, 2003"},{"key":"303_CR15","unstructured":"Roger M, Goubault-Larrecq J (1999) Proc\u00e9d\u00e9 et dispositif de r\u00e9solution de mod\u00e8les, utilisation pour la d\u00e9tection des attaques contre les syst\u00e8mes informatiques. D\u00e9p\u00f4t fran\u00e7ais du 13 sep. 1999, correspondant Dyade, demandeurs\u00a0: 1. INRIA 2. Bull S.A. Num\u00e9ro de publication: 2 798 490. Num\u00e9ro d\u2019enregistrement national: 99 11716. Classification: G 06 F 19\/00. Date de mise \u00e0 la disposition du public de la demande: 16 mars 2001, bulletin 01\/11"},{"key":"303_CR16","doi-asserted-by":"crossref","unstructured":"Roger M, Goubault-Larrecq J (2001) Log auditing through model checking. In: Proceedings of the 14th IEEE computer security foundations workshop (CSFW\u201901). IEEE Computer Society Press, Cape Breton, Nova Scotia, Canada, pp 220\u2013236","DOI":"10.1109\/CSFW.2001.930148"},{"issue":"2","key":"303_CR17","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan RE (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146\u2013160","journal-title":"SIAM J Comput"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10703-017-0303-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-017-0303-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-017-0303-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T04:36:55Z","timestamp":1570250215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10703-017-0303-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,28]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["303"],"URL":"https:\/\/doi.org\/10.1007\/s10703-017-0303-x","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,28]]}}}