{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:36Z","timestamp":1750221156624,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANR","award":["ANR-16-CE23-0015"],"award-info":[{"award-number":["ANR-16-CE23-0015"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1422375"],"award-info":[{"award-number":["IIS-1422375"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3196959.3196975","type":"proceedings-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T12:26:14Z","timestamp":1526387174000},"page":"409-424","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Explanations and Transparency in Collaborative Workflows"],"prefix":"10.1145","author":[{"given":"Serge","family":"Abiteboul","sequence":"first","affiliation":[{"name":"Inria-Paris & ENS Paris, Paris, France"}]},{"given":"Pierre","family":"Bourhis","sequence":"additional","affiliation":[{"name":"CNRS & University Lille, Inria Lille, Lille, France"}]},{"given":"Victor","family":"Vianu","sequence":"additional","affiliation":[{"name":"University of California, San Diego & INRIA Paris, ENS Paris, San Diego, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Verifying Programs with Unreliable Channels. Inf. and Comp","author":"Abdulla Parosh Aziz","year":"1996","unstructured":"Parosh Aziz Abdulla and Bengt Jonsson . 1996. Verifying Programs with Unreliable Channels. Inf. and Comp . Vol. 127 , 2 ( 1996 ). Parosh Aziz Abdulla and Bengt Jonsson. 1996. Verifying Programs with Unreliable Channels. Inf. and Comp. Vol. 127, 2 (1996)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.150"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0049-y"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989320"},{"key":"e_1_3_2_1_5_1","unstructured":"Serge Abiteboul Pierre Bourhis and Victor Vianu. 2016. A Formal Study of Collaborative Access Control in Distributed Datalog ICDT.  Serge Abiteboul Pierre Bourhis and Victor Vianu. 2016. A Formal Study of Collaborative Access Control in Distributed Datalog ICDT."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2463672"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24206-9_16"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/945721.945733"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Pierre Bourhis Daniel Deutch and Yuval Moskovitch. 2016. Analyzing data-centric applications: Why what-if and how-to ICDE.  Pierre Bourhis Daniel Deutch and Yuval Moskovitch. 2016. Analyzing data-centric applications: Why what-if and how-to ICDE.","DOI":"10.1109\/ICDE.2016.7498289"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/322374.322380"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2467796"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.26.6"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.42"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694428.2694430"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142364"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/344788.344808"},{"key":"e_1_3_2_1_17_1","unstructured":"M. R. Garey and D. S. Johnson. 1979. Computers and Intractibilitiy: A Guide to the Theory of NP-Completeness. Freeman San Francisco.   M. R. Garey and D. S. Johnson. 1979. Computers and Intractibilitiy: A Guide to the Theory of NP-Completeness. Freeman San Francisco."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247631"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1860702.1860704"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCC.2005.108"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1083784.1083807"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467802"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1462571.1462577"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13675-7_18"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749433"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.423.0428"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.2307\/2267170"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45005-1_49"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/945721.945732"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00899-3_9"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/DEXA.2007.50"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Houston TX USA","acronym":"SIGMOD\/PODS '18"},"container-title":["Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196959.3196975","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3196959.3196975","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3196959.3196975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:34Z","timestamp":1750208914000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196959.3196975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":31,"alternative-id":["10.1145\/3196959.3196975","10.1145\/3196959"],"URL":"https:\/\/doi.org\/10.1145\/3196959.3196975","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}