{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:19Z","timestamp":1750306879078,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,12]],"date-time":"2013-06-12T00:00:00Z","timestamp":1370995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,12]]},"DOI":"10.1145\/2462410.2462416","type":"proceedings-article","created":{"date-parts":[[2013,6,5]],"date-time":"2013-06-05T12:10:07Z","timestamp":1370434207000},"page":"149-160","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A white-box policy analysis and its efficient implementation"],"prefix":"10.1145","author":[{"given":"Jayalakshmi","family":"Balasubramaniam","sequence":"first","affiliation":[{"name":"University of Calgary, Calgary, AB, Canada"}]},{"given":"Philip W.L.","family":"Fong","sequence":"additional","affiliation":[{"name":"University of Calgary, Calgary, AB, Canada"}]}],"member":"320","published-online":{"date-parts":[[2013,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"PBS Solver. http:\/\/minisat.se\/MiniSat.html.  PBS Solver. http:\/\/minisat.se\/MiniSat.html."},{"key":"e_1_3_2_1_2_1","unstructured":"MiniSat SAT Solver. http:\/\/minisat.se\/MiniSat.html.  MiniSat SAT Solver. http:\/\/minisat.se\/MiniSat.html."},{"key":"e_1_3_2_1_3_1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"Aho Alfred V.","year":"2006","unstructured":"Alfred V. Aho , Monica S. Lam , Ravi Sethi , and Jeffrey D. Ullman . Compilers: Principles, Techniques, and Tools . Prentice Hall , 2 nd edition, 2006 . Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Prentice Hall, 2nd edition, 2006.","edition":"2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70567-3_20"},{"key":"e_1_3_2_1_5_1","volume-title":"Principles of Model Checking","author":"Baier Christel","year":"2008","unstructured":"Christel Baier and Joost-Pieter Katoen . Principles of Model Checking . MIT Press , 2008 . Christel Baier and Joost-Pieter Katoen. Principles of Model Checking. MIT Press, 2008."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2009.14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/504909.504910"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133601.2133616"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1952982.1952991"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888881.1888918"},{"key":"e_1_3_2_1_12_1","first-page":"502","volume-title":"E\u00e9n and Niklas S\u00f6rensson. An Extensible SAT-solver. In 6th International Conference on Theory and Applications of Satisfiability Testing","volume":"2919","author":"Niklas","year":"2004","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson. An Extensible SAT-solver. In 6th International Conference on Theory and Applications of Satisfiability Testing , volume 2919 of LNCS, pages 502 -- 518 , Santa Margherita Ligure, Italy , 2004 . Springer. Niklas E\u00e9n and Niklas S\u00f6rensson. An Extensible SAT-solver. In 6th International Conference on Theory and Applications of Satisfiability Testing, volume 2919 of LNCS, pages 502--518, Santa Margherita Ligure, Italy, 2004. Springer."},{"key":"e_1_3_2_1_13_1","volume-title":"March","author":"E\u00e9n Niklas","year":"2006","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson . Translating Pseudo-Boolean Constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2(1--4):1--26 , March 2006 . Niklas E\u00e9n and Niklas S\u00f6rensson. Translating Pseudo-Boolean Constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2(1--4):1--26, March 2006."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062455.1062502"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1943513.1943539"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998441.1998450"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-008-0087-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046727"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CONGRESS.2009.18"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242664"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542207.1542229"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-010-0106-1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SESS.2007.5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88873-4_11"},{"key":"e_1_3_2_1_25_1","volume-title":"OASIS Access Control TC","author":"Moses Tim","year":"2005","unstructured":"Tim Moses . eXtensible Access Control Markup Language (XACML) Version 2.0. Technical report , OASIS Access Control TC , 2005 . Tim Moses. eXtensible Access Control Markup Language (XACML) Version 2.0. Technical report, OASIS Access Control TC, 2005."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1533057.1533097"},{"key":"e_1_3_2_1_27_1","volume-title":"Combinatorial Algorithms","author":"Reingold Edward M.","year":"1977","unstructured":"Edward M. Reingold , Jurg Nievergelt , and Narsingh Deo . Combinatorial Algorithms . Prentice Hall , 1977 . Edward M. Reingold, Jurg Nievergelt, and Narsingh Deo. Combinatorial Algorithms. Prentice Hall, 1977."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315300"},{"key":"e_1_3_2_1_30_1","first-page":"115","article-title":"On the Complexity of Derivations in the Propositional Calculus. Studies in Mathematics and Mathematical Logic","author":"Tseitin G. S.","year":"1968","unstructured":"G. S. Tseitin . On the Complexity of Derivations in the Propositional Calculus. Studies in Mathematics and Mathematical Logic , Part II : 115 -- 125 , 1968 . G. S. Tseitin. On the Complexity of Derivations in the Propositional Calculus. Studies in Mathematics and Mathematical Logic, Part II:115--125, 1968.","journal-title":"Part"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2295136.2295173"}],"event":{"name":"SACMAT '13: 18th ACM Symposium on Access Control Models and Technologies","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Amsterdam The Netherlands","acronym":"SACMAT '13"},"container-title":["Proceedings of the 18th ACM symposium on Access control models and technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2462410.2462416","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2462410.2462416","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:29Z","timestamp":1750234709000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2462410.2462416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,12]]},"references-count":30,"alternative-id":["10.1145\/2462410.2462416","10.1145\/2462410"],"URL":"https:\/\/doi.org\/10.1145\/2462410.2462416","relation":{},"subject":[],"published":{"date-parts":[[2013,6,12]]},"assertion":[{"value":"2013-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}