{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:42:22Z","timestamp":1725676942985},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296147"},{"type":"electronic","value":"9783642296154"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29615-4_11","type":"book-chapter","created":{"date-parts":[[2012,4,23]],"date-time":"2012-04-23T11:30:30Z","timestamp":1335180630000},"page":"149-161","source":"Crossref","is-referenced-by-count":1,"title":["Optimized Inlining of Runtime Monitors"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9rick","family":"Lemay","sequence":"first","affiliation":[]},{"given":"Rapha\u00ebl","family":"Khoury","sequence":"additional","affiliation":[]},{"given":"Nadia","family":"Tawbi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Compilers: principles, techniques, and tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools. Addison-Wesley Longman Publishing Co., Inc., Boston (1986)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01782772","volume":"2","author":"B. Alpern","year":"1987","unstructured":"Alpern, B., Schneider, F.B.: Recognizing safety and liveness. Distributed Computing\u00a02, 117\u2013126 (1987)","journal-title":"Distributed Computing"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1109\/32.126773","volume":"18","author":"Z. Ammarguellat","year":"1992","unstructured":"Ammarguellat, Z.: A control-flow normalization algorithm and its complexity. IEEE Trans. Softw. Eng.\u00a018, 237\u2013251 (1992)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"11_CR4","unstructured":"Bauer, A., J\u00fcrjens, J.: Security protocols, properties, and their monitoring. In: Proceedings of the Fourth International Workshop on Software Engineering for Secure Systems (SESS)"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.cose.2009.09.003","volume":"29","author":"A. Bauer","year":"2010","unstructured":"Bauer, A., J\u00fcrjens, J.: Runtime verification of cryptographic protocols. Computers & Security\u00a029(3), 315\u2013330 (2010)","journal-title":"Computers & Security"},{"key":"11_CR6","unstructured":"Bauer, L., Ligatti, J., Walker, D.: More enforceable security policies. In: Foundations of Computer Security, Copenhagen, Denmark (July 2002)"},{"key":"11_CR7","first-page":"1","volume-title":"Proceedings of the International Congress on Logic, Method, and Philosophy of Science","author":"J. B\u00fcchi","year":"1962","unstructured":"B\u00fcchi, J.: On a decision method in restricted second order arithmetic. In: Proceedings of the International Congress on Logic, Method, and Philosophy of Science, pp. 1\u201312. Stanford University Press, Stanford (1962)"},{"key":"11_CR8","unstructured":"Carton, O.: Mots infinis, \u03c9-semigroupes et topologie. PhD thesis, Universite de Paris 07 (1993)"},{"key":"11_CR9","unstructured":"Carton, O.: Chain automata. In: IFIP World Computer Congress 1994, Hamburg, pp. 451\u2013458. Elsevier (North-Holland) (1994)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-04766-4_20","volume-title":"Identity and Privacy in the Internet Age","author":"H. Chabot","year":"2009","unstructured":"Chabot, H., Khoury, R., Tawbi, N.: Generating In-Line Monitors for Rabin Automata. In: J\u00f8sang, A., Maseng, T., Knapskog, S.J. (eds.) NordSec 2009. LNCS, vol.\u00a05838, pp. 287\u2013301. Springer, Heidelberg (2009)"},{"key":"11_CR11","unstructured":"Chabot, H., Khoury, R., Tawbi, N.: Extending the enforcement power of truncation monitors using static analysis. In: Computers & Security (forthcoming)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Chudnov, A., Naumann, D.A.: Information flow monitor inlining. In: Proceedings of the 23rd IEEE Computer Security Foundations Symposium, CSF 2010, Edinburgh, United Kingdom, July 17-19, pp. 200\u2013214 (2010)","DOI":"10.1109\/CSF.2010.21"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Colcombet, T., Fradet, P.: Enforcing trace properties by program transformation. In: Conference record of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (January 2000)","DOI":"10.1145\/325694.325703"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-14186-7_28","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"R. Ehlers","year":"2010","unstructured":"Ehlers, R.: Minimising Deterministic B\u00fcchi Automata Precisely Using SAT Solving. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 326\u2013332. Springer, Heidelberg (2010)"},{"key":"11_CR15","first-page":"368","volume-title":"SFCS 1991: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: SFCS 1991: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pp. 368\u2013377. IEEE Computer Society, Washington, DC, USA (1991)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Erlingsson, U., Schneider, F.B.: Sasi enforcement of security policies: A retrospective. In: WNSP: New Security Paradigms Workshop. ACM Press (2000)","DOI":"10.1145\/335169.335201"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Le Guernic, G.: Automaton-based Confidentiality Monitoring of Concurrent Programs. In: Proceedings of the 20th IEEE Computer Security Foundations Symposium (CSFS20), July 6-8, pp. 218\u2013232. IEEE Computer Society (2007)","DOI":"10.1109\/CSF.2007.10"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1145\/321832.321835","volume":"21","author":"M.S. Hecht","year":"1974","unstructured":"Hecht, M.S., Ullman, J.D.: Characterizations of reducible flow graphs. J. ACM\u00a021, 367\u2013375 (1974)","journal-title":"J. ACM"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. Technical report, Stanford, CA, USA (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1145\/267959.269971","volume":"19","author":"J. Janssen","year":"1997","unstructured":"Janssen, J., Corporaal, H.: Making graphs reducible with controlled node splitting. ACM Trans. Programming Languages and Systems\u00a019, 1031\u20131052 (1997)","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"11_CR21","unstructured":"Morrisett, G., Hamlen, K.W., Schneider, F.B.: Computability classes for enforcement mechanisms. Technical Report TR2003-1908, Cornell University (2003)"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(85)90043-X","volume":"36","author":"M. Kaminski","year":"1985","unstructured":"Kaminski, M.: A classification of omega-regular languages. Theoretical Computer Science\u00a036, 217\u2013229 (1985)","journal-title":"Theoretical Computer Science"},{"key":"11_CR23","unstructured":"Klein, J.: Linear Time Logic and Deterministic omega-Automata. PhD thesis, The University of Bonn, Bonn, Germany (January 2005)"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-60045-0_55","volume-title":"Computer Aided Verification","author":"S.C. Krishnan","year":"1995","unstructured":"Krishnan, S.C., Puri, A., Brayton, R.K., Varaiya, P.P.: The Rabin Index and Chain Automata, with Applications to Automata and Games. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939, pp. 253\u2013266. Springer, Heidelberg (1995)"},{"issue":"2","key":"11_CR25","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L. Lamport","year":"1977","unstructured":"Lamport, L.: Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering\u00a03(2), 125\u2013143 (1977)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"11_CR26","unstructured":"Langar, M., Mejri, M.: Formal and efficient enforcement of security policies. In: Proceedings of The 2005 International Conference on Foundations of Computer Science (FCS 2005), pp. 143\u2013149 (2005)"},{"key":"11_CR27","unstructured":"Langar, M., Mejri, M., Adi, K.: Formal monitor for concurrent programs. In: Workshop on Practice and Theory of IT Security (2006)"},{"key":"11_CR28","unstructured":"Langar, M., Mejri, M., Adi, K.: A formal approach for security policy enforcement in concurrent programs. In: Proceedings of the 2007 International Conference on Security & Management, pp. 165\u2013171 (2007)"},{"issue":"3","key":"11_CR29","doi-asserted-by":"publisher","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 Transactions on Information and System Security\u00a012(3), 1\u201341 (2009)","journal-title":"ACM Transactions on Information and System Security"},{"issue":"3","key":"11_CR30","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0020-0190(00)00183-6","volume":"79","author":"C. L\u00f6ding","year":"2001","unstructured":"L\u00f6ding, C.: Efficient minimization of deterministic weak omega-automata. Information Processing Letters\u00a079(3), 105\u2013109 (2001)","journal-title":"Information Processing Letters"},{"key":"11_CR31","unstructured":"Mechri, T., Langar, M., Mejri, M., Fujita, H., Funyu, Y.: Automatic enforcement of security in computer networks. In: New Trends in Software Methodologies, Tools and Techniques - Proceedings of the Sixth SoMeT 2007, pp. 200\u2013222 (2007)"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Muller, D.E.: Infinite sequences and finite machines. In: Switching Circuit Theory and Logical Design, pp. 3\u201316 (1963)","DOI":"10.1109\/SWCT.1963.8"},{"key":"11_CR33","unstructured":"Ould-Slimane, H., Mejri, M.: Enforcing security policies by rewriting programs using automata. In: Proceedings of the Workshop on Practice and Theory of IT Security (PTITS), pp. 195\u2013207 (2006)"},{"key":"11_CR34","unstructured":"Ould-Slimane, H., Mejri, M., Adi, K.: Enforcing security policies on programs. In: New Trends in Software Methodologies, Tools and Techniques - Proceedings of the Fifth SoMeT 2006, Quebec, Canada, October 25-27, pp. 195\u2013207 (2006)"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-03007-9_12","volume-title":"Data and Applications Security XXIII","author":"H. Ould-Slimane","year":"2009","unstructured":"Ould-Slimane, H., Mejri, M., Adi, K.: Using Edit Automata for Rewriting-Based Security Enforcement. In: Gudes, E., Vaidya, J. (eds.) Data and Applications Security XXIII. LNCS, vol.\u00a05645, pp. 175\u2013190. Springer, Heidelberg (2009)"},{"key":"11_CR36","unstructured":"Perrin, D., Pin, J.E.: Infinite Words. Pure and Applied Mathematics, vol.\u00a0141. Elsevier (2004)"},{"key":"11_CR37","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society\u00a0141, 1\u201337 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"issue":"1","key":"11_CR38","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. Information and System Security\u00a03(1), 30\u201350 (2000)","journal-title":"Information and System Security"},{"key":"11_CR39","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/ICSE.2004.1317464","volume-title":"ICSE 2004: Proceedings of the 26th International Conference on Software Engineering","author":"K. Sen","year":"2004","unstructured":"Sen, K., Vardhan, A., Agha, G., Ro\u015fu, G.: Efficient decentralized monitoring of safety in distributed systems. In: ICSE 2004: Proceedings of the 26th International Conference on Software Engineering, pp. 418\u2013427. IEEE Computer Society, Washington, DC, USA (2004)"},{"issue":"2","key":"11_CR40","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput.\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR41","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K. Wagner","year":"1979","unstructured":"Wagner, K.: On omega-regular sets. Information and Control\u00a043(2), 123\u2013177 (1979)","journal-title":"Information and Control"},{"key":"11_CR42","unstructured":"Watson, B.W.: A taxonomy of finite automata construction and minimization algorithms. Technical report, Computing Science (1993)"},{"issue":"1","key":"11_CR43","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1017\/S1351324903003127","volume":"9","author":"B.W. Watson","year":"2003","unstructured":"Watson, B.W., Daciuk, J.: An efficient incremental dfa minimization algorithm. Nat. Lang. Eng.\u00a09(1), 49\u201364 (2003)","journal-title":"Nat. Lang. Eng."},{"key":"11_CR44","doi-asserted-by":"crossref","unstructured":"Yan, F., Fong, P.W.L.: Efficient irm enforcement of history-based access control policies. In: Proceedings of the 2009 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2009, Sydney, Australia, pp. 35\u201346 (2009)","DOI":"10.1145\/1533057.1533066"}],"container-title":["Lecture Notes in Computer Science","Information Security Technology for Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29615-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:10:03Z","timestamp":1620126603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29615-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296147","9783642296154"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29615-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}