{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:09:16Z","timestamp":1725559756780},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_100","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"1239-1250","source":"Crossref","is-referenced-by-count":1,"title":["Compositional Verification of Asynchronous Processes via Constraint Solving"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Gabbrielli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"100_CR1","volume-title":"Solvable cases of the decision procedure","author":"W. Ackermann","year":"1954","unstructured":"Ackermann, W.: Solvable cases of the decision procedure. North-Holland, Amsterdam (1954)"},{"key":"100_CR2","doi-asserted-by":"crossref","unstructured":"de Boer, F.S., Gabbrielli, M., Meo, M.C.: A Denotational Semantics for a Timed Linda Language. In: PPDP 2001, pp. 28\u201336 (2001)","DOI":"10.1145\/773184.773188"},{"issue":"1","key":"100_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1006\/inco.1999.2879","volume":"161","author":"F.S. Boer de","year":"2000","unstructured":"de Boer, F.S., Gabbrielli, M., Meo, M.C.: A Timed Concurrent Constraint Language. Information and Computation\u00a0161(1), 45\u201383 (2000)","journal-title":"Information and Computation"},{"issue":"1","key":"100_CR4","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/151233.151242","volume":"36","author":"J.P. Banatre","year":"1993","unstructured":"Banatre, J.P., Le Metayer, D.: Programming by Multiset Transformation. Communication of the ACM\u00a036(1), 98\u2013111 (1993)","journal-title":"Communication of the ACM"},{"key":"100_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-27813-9_49","volume-title":"Computer Aided Verification","author":"C. Barrett","year":"2004","unstructured":"Barrett, C., Berezin, S.: CVC Lite: A New Implementation of the Cooperating Validity Checker. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 515\u2013518. Springer, Heidelberg (2004)"},{"key":"100_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"key":"100_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-31980-1_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Bozzano","year":"2005","unstructured":"Bozzano, M., Bruttomesso, R., Cimatti, A., Junttila, T., Rossum, P.v., Schulz, S., Sebastiani, R.: An incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 317\u2013333. Springer, Heidelberg (2005)"},{"key":"100_CR8","unstructured":"Brookes, S.: A Fully Abstract Semantics of a Shared Variable Parallel Language. In: LICS 1993, pp. 98\u2013109 (1993)"},{"key":"100_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-49059-0_16","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"G. Delzanno","year":"1999","unstructured":"Delzanno, G., Podelski, A.: Model Checking in CLP. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 223\u2013239. Springer, Heidelberg (1999)"},{"key":"100_CR10","unstructured":"Gabbrielli, M., Levi, G.: Modeling Answer Constraints in Constraint Logic Programs. In: ICLP 1991, pp. 238\u2013252 (1991)"},{"issue":"1","key":"100_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2363.2433","volume":"70","author":"D. Gelernter","year":"1985","unstructured":"Gelernter, D.: Generative Communication in Linda. TOPLAS\u00a070(1), 80\u2013112 (1985)","journal-title":"TOPLAS"},{"issue":"3","key":"100_CR12","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1145\/321281.321294","volume":"12","author":"S. Ginsburg","year":"1965","unstructured":"Ginsburg, S., Spanier, E.H.: Mappings of languages by two-tape devices. JACM\u00a012(3), 423\u2013434 (1965)","journal-title":"JACM"},{"key":"100_CR13","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"20","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J.: Constraint Logic Programming: A Survey. JLP\u00a019-20, 503\u2013582 (1994)","journal-title":"JLP"},{"key":"100_CR14","doi-asserted-by":"crossref","unstructured":"Jonsson, B.: A Model and a Proof System for Asynchronous Processes. In: PODC 1985, pp. 49\u201358 (1985)","DOI":"10.1145\/323596.323601"},{"issue":"2","key":"100_CR15","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G. Nelson","year":"1980","unstructured":"Nelson, G., Oppen, D.C.: Fast Decision Procedures based on Congruence Closure. JACM\u00a027(2), 356\u2013364 (1980)","journal-title":"JACM"},{"key":"100_CR16","doi-asserted-by":"crossref","unstructured":"Saraswat, V.A., Rinard, M.: Concurrent Constraint Programming. In: POPL 1990, pp. 232\u2013245 (1990)","DOI":"10.1145\/96709.96733"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:05:56Z","timestamp":1605643556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11523468_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}