{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:45:14Z","timestamp":1725857114509},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319406473"},{"type":"electronic","value":"9783319406480"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40648-0_11","type":"book-chapter","created":{"date-parts":[[2016,6,3]],"date-time":"2016-06-03T09:42:13Z","timestamp":1464946933000},"page":"133-149","source":"Crossref","is-referenced-by-count":9,"title":["Obfuscator Synthesis for Privacy and Utility"],"prefix":"10.1007","author":[{"given":"Yi-Chin","family":"Wu","sequence":"first","affiliation":[]},{"given":"Vasumathi","family":"Raman","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Lafortune","sequence":"additional","affiliation":[]},{"given":"Sanjit A.","family":"Seshia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,4]]},"reference":[{"issue":"8","key":"11_CR1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C\u201335","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C\u201335(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"crossref","unstructured":"Dwork, C.: Differential privacy. In: International Conference on Automata, Languages and Programming, pp. 1\u201312 (2006)","key":"11_CR2","DOI":"10.1007\/11787006_1"},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1090\/dimacs\/031\/06","volume":"31","author":"EA Emerson","year":"1997","unstructured":"Emerson, E.A.: Model checking and the mu-calculus. DIMACS Ser. Discrete Math. 31, 185\u2013214 (1997)","journal-title":"DIMACS Ser. Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Falcone, Y., Marchand, H.: Runtime enforcement of K-step opacity. In: 52nd IEEE Conference on Decision and Control (2013)","key":"11_CR4","DOI":"10.1109\/CDC.2013.6761043"},{"unstructured":"Filippidis, I.: https:\/\/github.com\/johnyf\/dd","key":"11_CR5"},{"issue":"3","key":"11_CR6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional $$\\mu $$ -calculus. Theor. Comput. Sci. 27(3), 333\u2013354 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/978-3-642-17511-4_28","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"O Kupferman","year":"2010","unstructured":"Kupferman, O., Tamir, T.: Coping with selfish on-going behaviors. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol. 6355, pp. 501\u2013516. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"O\u2019Kane, J.M., Shell, D.A.: Automatic design of discreet discrete filters. In: IEEE International Conference on Robotics and Automation (ICRA), pp. 353\u2013360 (2015)","key":"11_CR8","DOI":"10.1109\/ICRA.2015.7139023"},{"issue":"1","key":"11_CR9","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"PJ Ramadge","year":"1987","unstructured":"Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete event processes. SIAM J. Control Optim. 25(1), 206\u2013230 (1987)","journal-title":"SIAM J. Control Optim."},{"issue":"5","key":"11_CR10","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1109\/TAC.2011.2170453","volume":"57","author":"A Saboori","year":"2012","unstructured":"Saboori, A., Hadjicostis, C.N.: Opacity-enforcing supervisory strategies via state estimator constructions. IEEE Trans. Autom. Control 57(5), 1155\u20131165 (2012)","journal-title":"IEEE Trans. Autom. Control"},{"unstructured":"Somenzi, F.: CUDD: CU decision diagram package release 2.3.0. University of Colorado at Boulder (1998)","key":"11_CR11"},{"issue":"5","key":"11_CR12","doi-asserted-by":"crossref","first-page":"1336","DOI":"10.1016\/j.automatica.2014.02.038","volume":"50","author":"Y-C Wu","year":"2014","unstructured":"Wu, Y.-C., Lafortune, S.: Synthesis of insertion functions for enforcement of opacity security properties. Automatica 50(5), 1336\u20131348 (2014)","journal-title":"Automatica"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40648-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T11:41:24Z","timestamp":1498304484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40648-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319406473","9783319406480"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40648-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}
