{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:07:16Z","timestamp":1742990836808,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":27,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789048136612"},{"type":"electronic","value":"9789048136629"}],"license":[{"start":{"date-parts":[[2009,12,12]],"date-time":"2009-12-12T00:00:00Z","timestamp":1260576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,12,12]],"date-time":"2009-12-12T00:00:00Z","timestamp":1260576000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-90-481-3662-9_71","type":"book-chapter","created":{"date-parts":[[2010,1,30]],"date-time":"2010-01-30T11:23:45Z","timestamp":1264850625000},"page":"413-416","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Encoding Forensic Multimedia Evidence from MARF Applications as Forensic Lucid Expressions"],"prefix":"10.1007","author":[{"given":"Serguei A.","family":"Mokhov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,12]]},"reference":[{"key":"71_CR1","unstructured":"The MARF Research and Development Group, \u201cThe Modular Audio Recognition Framework and its Applications,\u201d SourceForge.net, 2002\u2013 2008, http:\/\/marf.sf.net, last viewed December 2008."},{"key":"71_CR2","doi-asserted-by":"crossref","unstructured":"S. A. Mokhov, \u201cStudy of best algorithm combinations for speech processing tasks in machine learning using median vs. mean clusters in MARF,\u201d in Proceedings of C3S2E\u201908, B. C. Desai, Ed. Montreal, Quebec, Canada: ACM and BytePress, May 2008, pp. 29\u201343, ISBN 978\u20131-60558\u2013101\u20139.","DOI":"10.1145\/1370256.1370262"},{"key":"71_CR3","unstructured":"S. A. Mokhov, \u201cWriter Identification Using Inexpensive Signal ProcessingTechniques: Experimental Results,\u201d 2008, unpublished."},{"key":"71_CR4","unstructured":"S. A. Mokhov and M. Debbabi, \u201cFile type analysis using signal processing techniques and machine learning vs. file unix utility for forensic analysis,\u201d in Proceedings of the IT Incident Management and IT Forensics (IMF\u201908), O. Goebel, S. Frings, D. Guenther, J. Nedon, and D. Schadt, Eds., Mannheim, Germany, Sep. 2008, pp. 73\u201385, LNI140."},{"key":"71_CR5","doi-asserted-by":"crossref","unstructured":"S. A. Mokhov, \u201cTowards syntax and semantics of hierarchical contexts in multimedia processing applications using MARFL,\u201d in Proceedings of the 32nd Annual IEEE International Computer Software and Applications Conference (COMPSAC). Turku, Finland: IEEE Computer Society, Jul. 2008, pp. 1288\u20131294.","DOI":"10.1109\/COMPSAC.2008.206"},{"key":"71_CR6","unstructured":"S. A. Mokhov and J. Paquet, \u201cFormally specifying and proving operational aspects of Forensic Lucid in Isabelle,\u201d Department of Electrical and Computer Engineering, Concordia University, Tech. Rep. 2008\u20131Ait Mohamed, Aug. 2008, in Theorem Proving in Higher Order Logics (TPHOLs2008): EmergingTrends Proceedings."},{"key":"71_CR7","unstructured":"S. A. Mokhov, J. Paquet, and M. Debbabi, \u201cFormally specifying operational semantics and language constructs of Forensic Lucid,\u201d in Proceedings of the IT Incident Management and ITForensics (IMF\u201908), O. Goebel, S. Frings, D. Guenther, J. Nedon, and D. Schadt, Eds., Mannheim, Germany, Sep. 2008, pp. 197\u2013216, LNI140."},{"key":"71_CR8","doi-asserted-by":"crossref","unstructured":"E.A. Ashcroft and W.W.Wadge, \u201cLucid -a formal system for writing and proving programs,\u201d SIAMJ. Comput., vol. 5, no. 3, 1976.","DOI":"10.1137\/0205029"},{"issue":"1","key":"71_CR9","first-page":"200","volume":"6","author":"E.A. Ashcroft","year":"1977","unstructured":"E.A. Ashcroft and W.W.Wadge, \u201cErratum: Lucid -a formal system for writing and proving programs.\u201d SIAMJ. Comput., vol. 6, no. (1):200, 1977.","journal-title":"SIAMJ. Comput."},{"issue":"7","key":"71_CR10","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/359636.359715","volume":"20","author":"E.A. Ashcroft","year":"1977","unstructured":"E.A. Ashcroft and W.W.Wadge, \u201cLucid, a nonprocedural language with iteration,\u201d Communication of the ACM, vol. 20, no. 7, pp. 519\u2013526, Jul. 1977.","journal-title":"Communication of the ACM"},{"key":"71_CR11","volume-title":"Lucid, the Dataflow Programming Language","author":"W. Wadge","year":"1985","unstructured":"W.Wadge and E. Ashcroft, Lucid, the Dataflow Programming Language. London: Academic Press, 1985."},{"key":"71_CR12","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195075977.001.0001","volume-title":"Multidimensional, Declarative Programming","author":"E. Ashcroft","year":"1995","unstructured":"E. Ashcroft, A. Faustini, R. Jagannathan, and W. Wadge, Multidimensional, Declarative Programming. London: Oxford University Press, 1995."},{"key":"71_CR13","unstructured":"J. Paquet, \u201cScientific intensional programming,\u201d Ph.D. dissertation, Department of Computer Science, Laval University, Sainte-Foy, Canada, 1999."},{"key":"71_CR14","unstructured":"R. Lalement, Computation as Logic. Prentice Hall, 1993, C.A.R. Hoare Series Editor. English translation from French by John Plaice."},{"key":"71_CR15","unstructured":"P. Rondogiannis, \u201cHigher-order functional languages and intensional logic,\u201d Ph.D. dissertation, Department of Computer Science, University ofVictoria,Victoria, Canada, 1994."},{"key":"71_CR16","unstructured":"P. Gladyshev, \u201cFinite state machine analysis of a blackmail investigation,\u201d in International Journal of Digital Evidence. Technical and Security Risk Services, Sprint 2005,Volume 4, Issue 1, 2005."},{"key":"71_CR17","doi-asserted-by":"crossref","unstructured":"P. Gladyshev and A. Patel, \u201cFinite state machine approach to digital event reconstruction,\u201d in Digital InvestigationJournal, vol. 2, 2004.","DOI":"10.1016\/S1742-2876(04)00027-1"},{"key":"71_CR18","doi-asserted-by":"crossref","unstructured":"J. Paquet and P. Kropf, \u201cThe GIPSY architecture,\u201d in Proceedings of Distributed Computing on theWeb, Quebec City, Canada, 2000.","DOI":"10.1007\/3-540-45111-0_17"},{"key":"71_CR19","unstructured":"J.Paquet, \u201cAmulti-tier architecture for the distributed eductiveexecution of hybrid intensional programs,\u201d 2008, submitted for publication at SAC\u201909."},{"key":"71_CR20","unstructured":"P. Swoboda, \u201cA formalisation and implementation of distributed intensional programming,\u201d Ph.D. dissertation, The University of New South Wales, Sydney, Australia, 2004."},{"key":"71_CR21","unstructured":"P. Swoboda and W. W. Wadge, \u201cVmake, ISE, and IRCS: General tools for the intensionalization of software systems,\u201d in Intensional Programming II, M. Gergatsoulis and P. Rondogiannis, Eds. World-scientific, 2000."},{"key":"71_CR22","unstructured":"P. Swoboda and J. Plaice, \u201cA new approach to distributed context-aware computing,\u201d in Advances in Pervasive Computing, A. Ferscha, H. Hoertner, and G. Kotsis, Eds. Austrian Computer Society, 2004, ISBN 3\u201385403-176\u20139."},{"key":"71_CR23","doi-asserted-by":"crossref","unstructured":"P. Swoboda and J. Plaice, \u201cAn active functional intensional database,\u201d in Advances in Pervasive Computing, F. Galindo, Ed. Springer, 2004, pp. 56\u201365, LNCS 3180.","DOI":"10.1007\/978-3-540-30075-5_6"},{"key":"71_CR24","unstructured":"L. C. Paulson and T. Nipkow, \u201cIsabelle: A generic proof assistant,\u201d University of Cambridge and Technical University of Munich, 2007, http:\/\/isabelle.in.tum.de\/, last viewed: December 2007."},{"key":"71_CR25","unstructured":"M. Debbabi, A. R. Arasteh, A. Sakha, M. Saleh, and A. Fry, \u201cA collection of JPF forensic plug-ins,\u201d Computer Security Laboratory, Concordia Institute for Information Systems Engineering, 2007\u20132008."},{"issue":"1","key":"71_CR26","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.diin.2007.06.010","volume":"4","author":"A. R. Arasteh","year":"2007","unstructured":"A. R. Arasteh and M. Debbabi, \u201cForensic memory analysis: From stack and code to execution history,\u201d Digital Investigation Journal, vol. 4, no. 1, pp. 114\u2013125, Sep. 2007.","journal-title":"Digital Investigation Journal"},{"issue":"1","key":"71_CR27","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.diin.2007.06.013","volume":"4","author":"A. R. Arasteh","year":"2007","unstructured":"A. R. Arasteh, M. Debbabi, A. Sakha, and M. Saleh, \u201cAnalyzing multiple logs for forensic evidence,\u201d Digital InvestigationJournal, vol. 4, no. 1, pp. 82\u201391, Sep. 2007.","journal-title":"Digital InvestigationJournal"}],"container-title":["Novel Algorithms and Techniques in Telecommunications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-90-481-3662-9_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T23:46:32Z","timestamp":1675727192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-90-481-3662-9_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,12]]},"ISBN":["9789048136612","9789048136629"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-90-481-3662-9_71","relation":{},"subject":[],"published":{"date-parts":[[2009,12,12]]},"assertion":[{"value":"12 December 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}