{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:35Z","timestamp":1759638935303},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642380037"},{"type":"electronic","value":"9783642380044"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38004-4_2","type":"book-chapter","created":{"date-parts":[[2013,4,22]],"date-time":"2013-04-22T08:24:16Z","timestamp":1366619056000},"page":"17-32","source":"Crossref","is-referenced-by-count":7,"title":["Enforcing More with Less: Formalizing Target-Aware Run-Time Monitors"],"prefix":"10.1007","author":[{"given":"Yannis","family":"Mallios","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lujo","family":"Bauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dilsun","family":"Kaynar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jay","family":"Ligatti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: Proc. European Software Engineering Conference (2001)","DOI":"10.1145\/503225.503226"},{"key":"2_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-45484-5_4","volume-title":"Formal Approaches to Agent-Based Systems","author":"T. Araragi","year":"2001","unstructured":"Araragi, T., Attie, P.C., Keidar, I., Kogure, K., Luchangco, V., Lynch, N.A., Mano, K.: On Formal Modeling of Agent Computations. In: Rash, J.L., Rouff, C.A., Truszkowski, W., Gordon, D.F., Hinchey, M.G. (eds.) FAABS 2000. LNCS (LNAI), vol.\u00a01871, pp. 48\u201362. Springer, Heidelberg (2001)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Basin, D., Olderog, E.R., Sevinc, P.E.: Specifying and analyzing security automata using CSP-OZ. In: Proc. ACM Symposium on Information, Computer and Communications Security, ASIACCS (2007)","DOI":"10.1145\/1229285.1229299"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-28641-4_17","volume-title":"Principles of Security and Trust","author":"D. Basin","year":"2012","unstructured":"Basin, D., Jug\u00e9, V., Klaedtke, F., Z\u0103linescu, E.: Enforceable Security Policies Revisited. In: Degano, P., Guttman, J.D. (eds.) Principles of Security and Trust. LNCS, vol.\u00a07215, pp. 309\u2013328. Springer, Heidelberg (2012)"},{"key":"2_CR5","unstructured":"Bishop, M.: Computer Security: Art and Science. Addison-Wesley Professional (2002)"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM\u00a031, 560\u2013599 (1984)","journal-title":"Journal of the ACM"},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.cose.2010.11.004","volume":"30","author":"H. Chabot","year":"2011","unstructured":"Chabot, H., Khoury, R., Tawbi, N.: Extending the enforcement power of truncation monitors using static analysis. Computers and Security\u00a030(4), 194\u2013207 (2011)","journal-title":"Computers and Security"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. In: Proc. IEEE Computer Security Foundations Symposium (2008)","DOI":"10.1109\/CSF.2008.7"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Erlingsson, U., Schneider, F.B.: SASI enforcement of security policies: a retrospective. In: Proc. Workshop on New Security Paradigms (2000)","DOI":"10.1145\/335169.335201"},{"key":"2_CR10","unstructured":"Falcone, Y., Fernandez, J.C., Mounier, L.: What can you verify and enforce at runtime? Intl. Jrnl. Software Tools for Tech. Transfer (STTT) 14(3), 349\u2013382 (2011)"},{"key":"2_CR11","unstructured":"Fong, P.W.L.: Access control by tracking shallow execution history. In: Proc. IEEE Symposium on Security and Privacy (2004)"},{"key":"2_CR12","unstructured":"Garfinkel, T.: Traps and pitfalls: Practical problems in system call interposition based security tools. In: Proc. Network and Distributed Systems Security Symposium (2003)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-29420-4_10","volume-title":"Formal Aspects of Security and Trust","author":"R. Gay","year":"2012","unstructured":"Gay, R., Mantel, H., Sprick, B.: Service Automata. In: Barthe, G., Datta, A., Etalle, S. (eds.) FAST 2011. LNCS, vol.\u00a07140, pp. 148\u2013163. Springer, Heidelberg (2012)"},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","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. Program. Lang. Syst. 28(1), 175\u2013205 (2006)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-49059-0_9","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"J. Hickey","year":"1999","unstructured":"Hickey, J., Lynch, N.A., van Renesse, R.: Specifications and Proofs for Ensemble Layers. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 119\u2013134. Springer, Heidelberg (1999)"},{"issue":"7","key":"2_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0950-5849(89)90159-6","volume":"31","author":"M.Z. Kwiatkowska","year":"1989","unstructured":"Kwiatkowska, M.Z.: Survey of fairness notions. Information and Software Technology\u00a031(7), 371\u2013386 (1989)","journal-title":"Information and Software Technology"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Ligatti, J., Bauer, L., Walker, D.: Run-time enforcement of nonsafety policies. ACM Transactions on Information and System Security\u00a012(3) (2009)","DOI":"10.1145\/1455526.1455532"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-15497-3_6","volume-title":"Computer Security \u2013 ESORICS 2010","author":"J. Ligatti","year":"2010","unstructured":"Ligatti, J., Reddy, S.: A Theory of Runtime Enforcement, with Results. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol.\u00a06345, pp. 87\u2013100. Springer, Heidelberg (2010)"},{"key":"2_CR19","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc. (1996)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Mallios, Y., Bauer, L., Kaynar, D., Ligatti, J.: Enforcing more with less: Formalizing target-aware run-time monitors. Tech. Rep. CMU-CyLab-12-009, CyLab, Carnegie Mellon University (2012)","DOI":"10.1007\/978-3-642-38004-4_2"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.entcs.2006.08.029","volume":"179","author":"F. Martinelli","year":"2007","unstructured":"Martinelli, F., Matteucci, I.: Through modeling to synthesis of security automata. Electron. Notes Theor. Comput. Sci.\u00a0179, 31\u201346 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"2_CR22","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer (1982)"},{"issue":"1","key":"2_CR23","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/353323.353382","volume":"3","author":"F.B. Schneider","year":"2000","unstructured":"Schneider, F.B.: Enforceable security policies. ACM Trans. Inf. Syst. Secur.\u00a03(1), 30\u201350 (2000)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"2_CR24","unstructured":"Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. Master\u2019s thesis, Dept. of Electrical Engineering and Computer Science. MIT (1987)"}],"container-title":["Lecture Notes in Computer Science","Security and Trust Management"],"original-title":[],"link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38004-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T13:41:29Z","timestamp":1557668489000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/link.springer.com\/10.1007\/978-3-642-38004-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642380037","9783642380044"],"references-count":24,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1007\/978-3-642-38004-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}