{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T03:49:09Z","timestamp":1791172149607,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642401831","type":"print"},{"value":"9783642401848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_29","type":"book-chapter","created":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T01:50:56Z","timestamp":1374544256000},"page":"410-424","source":"Crossref","is-referenced-by-count":6,"title":["A General Proof System for Modalities in Concurrent Constraint Programming"],"prefix":"10.1007","author":[{"given":"Vivek","family":"Nigam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carlos","family":"Olarte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elaine","family":"Pimentel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.-M. Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"J. of Logic and Computation"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Danos, V., Joinet, J.-B., Schellinx, H.: The structure of exponentials: Uncovering the dynamics of linear logic proofs. In: Mundici, D., Gottlob, G., Leitsch, A. (eds.) KGC 1993. LNCS, vol.\u00a0713, pp. 159\u2013171. Springer, Heidelberg (1993)","DOI":"10.1007\/BFb0022564"},{"issue":"2","key":"29_CR3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3233\/JCS-2004-12203","volume":"12","author":"N.A. Durgin","year":"2004","unstructured":"Durgin, N.A., Lincoln, P., Mitchell, J.C., Scedrov, A.: Multiset rewriting and the complexity of bounded security protocols. JCS\u00a012(2), 247\u2013311 (2004)","journal-title":"JCS"},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1006\/inco.2000.3002","volume":"165","author":"F. Fages","year":"2001","unstructured":"Fages, F., Ruet, P., Soliman, S.: Linear concurrent constraint programming: Operational and phase semantics. Information and Computation\u00a0165(1), 14\u201341 (2001)","journal-title":"Information and Computation"},{"key":"29_CR5","first-page":"68","volume-title":"The Collected Papers of Gerhard Gentzen","author":"G. Gentzen","year":"1969","unstructured":"Gentzen, G.: Investigations into logical deductions. In: Szabo, M.E. (ed.) The Collected Papers of Gerhard Gentzen, pp. 68\u2013131. North-Holland, Amsterdam (1969)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-32940-1_23","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"S. Knight","year":"2012","unstructured":"Knight, S., Palamidessi, C., Panangaden, P., Valencia, F.D.: Spatial and epistemic modalities in constraint-based process calculi. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 317\u2013332. Springer, Heidelberg (2012)"},{"issue":"1","key":"29_CR8","first-page":"145","volume":"9","author":"M. Nielsen","year":"2002","unstructured":"Nielsen, M., Palamidessi, C., Valencia, F.D.: Temporal concurrent constraint programming: Denotation, logic and applications. Nordic Journal of Computing\u00a09(1), 145\u2013188 (2002)","journal-title":"Nordic Journal of Computing"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Nigam, V.: On the complexity of linear authorization logics. In: LICS, pp. 511\u2013520. IEEE (2012)","DOI":"10.1109\/LICS.2012.61"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Nigam, V., Miller, D.: Algorithmic specifications in linear logic with subexponentials. In: PPDP, pp. 129\u2013140. ACM (2009)","DOI":"10.1145\/1599410.1599427"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10817-010-9182-1","volume":"45","author":"V. Nigam","year":"2010","unstructured":"Nigam, V., Miller, D.: A framework for proof systems. J. Autom. Reasoning\u00a045(2), 157\u2013188 (2010)","journal-title":"J. Autom. Reasoning"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.entcs.2011.03.009","volume":"269","author":"V. Nigam","year":"2011","unstructured":"Nigam, V., Pimentel, E., Reis, G.: Specifying proof systems in linear logic with subexponentials. Electr. Notes Theor. Comput. Sci.\u00a0269, 109\u2013123 (2011)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Olarte, C., Rueda, C., Valencia, F.D.: Models and emerging trends of concurrent constraint programming. Constraints (2013)","DOI":"10.1007\/s10601-013-9145-3"},{"key":"29_CR14","unstructured":"Palamidessi, C., Saraswat, V.A., Valencia, F.D., Victor, B.: On the expressiveness of linearity vs persistence in the asychronous pi-calculus. In: LICS, pp. 59\u201368. IEEE Computer Society (2006)"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Saraswat, V.A., Rinard, M.C., Panangaden, P.: Semantic foundations of concurrent constraint programming. In: POPL, pp. 333\u2013352. ACM (1991)","DOI":"10.1145\/99583.99627"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Saraswat, V.A.: Concurrent Constraint Programming. MIT Press (1993)","DOI":"10.7551\/mitpress\/2086.001.0001"},{"issue":"5\/6","key":"29_CR17","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1006\/jsco.1996.0064","volume":"22","author":"V.A. Saraswat","year":"1996","unstructured":"Saraswat, V.A., Jagadeesan, R., Gupta, V.: Timed default concurrent constraint programming. J. Symb. Comput.\u00a022(5\/6), 475\u2013520 (1996)","journal-title":"J. Symb. Comput."},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Watkins, K., Cervesato, I., Pfenning, F., Walker, D.: A concurrent logical framework I: Judgments and properties. TR CMU-CS-02-101, CMU (2003)","DOI":"10.21236\/ADA418517"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T12:32:25Z","timestamp":1596198745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}