{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:47:35Z","timestamp":1764557255901,"version":"3.38.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,24]],"date-time":"2011-06-24T00:00:00Z","timestamp":1308873600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10207-011-0137-2","type":"journal-article","created":{"date-parts":[[2011,6,23]],"date-time":"2011-06-23T14:31:18Z","timestamp":1308839478000},"page":"239-254","source":"Crossref","is-referenced-by-count":24,"title":["Do you really mean what you actually enforced?"],"prefix":"10.1007","volume":"10","author":[{"given":"Nataliia","family":"Bielova","sequence":"first","affiliation":[]},{"given":"Fabio","family":"Massacci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,24]]},"reference":[{"key":"137_CR1","doi-asserted-by":"crossref","unstructured":"Bauer, L., Ligatti, J., Walker, D.: Composing security policies with polymer. In: Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation, pp. 305\u2013314. ACM Press, New York (2005)","DOI":"10.1145\/1065010.1065047"},{"issue":"1\u20132","key":"137_CR2","first-page":"2","volume":"4","author":"L. Bauer","year":"2005","unstructured":"Bauer L., Ligatti J., Walker D.: Edit automata: enforcement mechanisms for run-time security policies. Int. J. Inf. Secur. 4(1\u20132), 2\u201316 (2005)","journal-title":"Int. J. Inf. Secur."},{"issue":"5","key":"137_CR3","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/j.jlap.2009.02.013","volume":"78","author":"N. Bielova","year":"2009","unstructured":"Bielova N., Dragoni N., Massacci F., Naliuka K., Siahaan I.: Matching in security-by-contract for mobile code. J. Log. Algebraic Programm. 78(5), 340\u2013358 (2009)","journal-title":"J. Log. Algebraic Programm."},{"key":"137_CR4","doi-asserted-by":"crossref","unstructured":"Bielova, N., Massacci, F.: Do you really mean what you actually enforced? In: Proceedings of the 5th International Workshop on Formal Aspects in Security and Trust, vol. 5491, pp. 287\u2013301. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-642-01465-9_19"},{"key":"137_CR5","doi-asserted-by":"crossref","unstructured":"Bielova, N., Massacci, F., Micheletti, A.: Towards practical enforcement theories. In: Proceedings of The 14th Nordic Conference on Secure IT Systems. Lecture Notes in Computer Science, vol. 5838, pp. 239\u2013254. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-04766-4_17"},{"issue":"1","key":"137_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(91)90053-5","volume":"85","author":"A. Cherubini","year":"1991","unstructured":"Cherubini A., Citrini C., Reghizzi S. C., Mandrioli D.: QRT FIFO automata, breadth-first grammars and their relations. Theor. Comput. Sci. 85(1), 171\u2013203 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"137_CR7","unstructured":"CNET Networks: Channel 4\u2019s 4od: Tv on demand, at a price. Crave Webzine (2007)"},{"key":"137_CR8","unstructured":"Erlingsson, U.: The inlined reference monitor approach to security policy enforcement. Ph.D. thesis, Cornell University (2003)"},{"key":"137_CR9","doi-asserted-by":"crossref","unstructured":"Fong, P. Access control by tracking shallow execution history. In: Proceedings of the 2004 IEEE Symposium on Security and Privacy, pp. 43\u201355 (2004)","DOI":"10.1109\/SECPRI.2004.1301314"},{"key":"137_CR10","unstructured":"Gong, L., Ellison, G. Inside Java(TM) 2 Platform Security: Architecture, API Design, and Implementation. Pearson Education (2003)"},{"issue":"1","key":"137_CR11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/1111596.1111601","volume":"28","author":"K. W. Hamlen","year":"2006","unstructured":"Hamlen K. W., Morrisett G., Schneider F. B.: Computability classes for enforcement mechanisms. ACM Trans. Programm. Lang. Syst. 28(1), 175\u2013205 (2006)","journal-title":"ACM Trans. Programm. Lang. Syst."},{"issue":"2","key":"137_CR12","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/s10009-003-0117-6","volume":"6","author":"K. Havelund","year":"2004","unstructured":"Havelund K., Rosu G.: Efficient monitoring of safety properties. Int. J. Softw. Tools Technol. Transf 6(2), 158\u2013173 (2004)","journal-title":"Int. J. Softw. Tools Technol. Transf"},{"key":"137_CR13","doi-asserted-by":"crossref","unstructured":"Krukow, K., Nielsen, M., Sassone, V.: A framework for concrete reputation-systems with applications to history-based access control. In: Proceedings of the 12th ACM Conference on Communications and Computer Security (2005)","DOI":"10.1145\/1102120.1102155"},{"key":"137_CR14","unstructured":"LaMacchia, B., Lange, S.: .NET Framework security. Addison Wesley (2002)"},{"issue":"3","key":"137_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1455526.1455532","volume":"12","author":"J. Ligatti","year":"2009","unstructured":"Ligatti J., Bauer L., Walker D.: Run-time enforcement of nonsafety policies. ACM Trans. Inf. Syst. Secur. 12(3), 1\u201341 (2009)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"137_CR16","doi-asserted-by":"crossref","unstructured":"Martinelli, F., Matteucci, I.: Through modeling to synthesis of security automata. In: Proceedings of the Second International Workshop on Security and Trust Management, Electronic Notes in Theoretical Computer Science, vol. 179, pp. 31\u201346. Elsevier Science Publishers B.V. (2007)","DOI":"10.1016\/j.entcs.2006.08.029"},{"key":"137_CR17","doi-asserted-by":"crossref","unstructured":"Massacci, F., Siahaan., I.: Matching midlet\u2019s security claims with a platform security policy using automata modulo theory. In: Proceedings of the 12th Nordic Workshop on Secure IT Systems (NordSec\u201907) (2007)","DOI":"10.1145\/1375696.1375698"},{"key":"137_CR18","doi-asserted-by":"crossref","unstructured":"Massacci, F., Siahaan, I.S.R.: Simulating midlet\u2019s security claims with automata modulo theory. In: Proceedings of the 2008 workshop on Programming Language and analysis for security, pp. 1\u20139. ACM Press (2008)","DOI":"10.1145\/1375696.1375698"},{"key":"137_CR19","unstructured":"Ray, B.: Symbian signing is no protection from spyware. http:\/\/www.theregister.co.uk\/2007\/05\/23\/symbian_signed_spyware\/ (2007)"},{"issue":"1","key":"137_CR20","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/353323.353382","volume":"3","author":"F. Schneider","year":"2000","unstructured":"Schneider F.: Enforceable security policies. ACM Trans. Inf. Syst. Secur. 3(1), 30\u201350 (2000)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"137_CR21","doi-asserted-by":"crossref","unstructured":"Sekar, R., Venkatakrishnan, V., Basu, S., Bhatkar, S., DuVarney, D.: Model-carrying code: a practical approach for safe execution of untrusted applications. In: Proceedings of the 19th ACM Symposium on Operating Systems Principles, pp. 15\u201328. ACM Press, New York (2003)","DOI":"10.1145\/1165389.945448"},{"issue":"2\u20134","key":"137_CR22","first-page":"158","volume":"206","author":"C. Talhi","year":"2007","unstructured":"Talhi C., Tawbi N., Debbabi M.: Execution monitoring enforcement under memory-limitation constraints. Inf. Comput. 206(2\u20134), 158\u2013184 (2007)","journal-title":"Inf. Comput."}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-011-0137-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-011-0137-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-011-0137-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T14:42:39Z","timestamp":1741272159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-011-0137-2"}},"subtitle":["Edited automata revisited"],"short-title":[],"issued":{"date-parts":[[2011,6,24]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["137"],"URL":"https:\/\/doi.org\/10.1007\/s10207-011-0137-2","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2011,6,24]]}}}