{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:09:33Z","timestamp":1725566973642},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_42","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:43:16Z","timestamp":1133797396000},"page":"517-528","source":"Crossref","is-referenced-by-count":16,"title":["Testing Concurrent Systems: An Interpretation of Intuitionistic Logic"],"prefix":"10.1007","author":[{"given":"Radha","family":"Jagadeesan","sequence":"first","affiliation":[]},{"given":"Gopalan","family":"Nadathur","sequence":"additional","affiliation":[]},{"given":"Vijay","family":"Saraswat","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-3","key":"42_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0167-6423(99)00007-6","volume":"35","author":"A. Aiken","year":"1999","unstructured":"Aiken, A.: Introduction to set constraint-based program analysis. Sci. Comput. Program.\u00a035(2-3), 79\u2013111 (1999)","journal-title":"Sci. Comput. Program."},{"key":"42_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.2307\/2275431","volume":"57","author":"R. Dyckhoff","year":"1992","unstructured":"Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. The Journal of Symbolic Logic, 57\u00a03 (1992)","journal-title":"The Journal of Symbolic Logic"},{"key":"42_CR3","unstructured":"The eclipse project, \n                    \n                      http:\/\/www.eclipse.org"},{"issue":"1-3","key":"42_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(01)00308-5","volume":"300","author":"S.E. Finkelstein","year":"2003","unstructured":"Finkelstein, S.E., Freyd, P., Lipton, J.: A new framework for declarative programming. Theor. Comput. Sci.\u00a0300(1-3), 91\u2013160 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1028664.1028669","volume-title":"OOPSLA 2004: Companion to the 19th annual ACMSIGPLAN conference on Objectoriented programming systems, languages, and applications","author":"R. Fuhrer","year":"2004","unstructured":"Fuhrer, R., Tip, F., Kiezun, A.: Advanced refactorings in eclipse. In: OOPSLA 2004: Companion to the 19th annual ACMSIGPLAN conference on Objectoriented programming systems, languages, and applications, New York, NY, USA, pp. 8\u20138. ACM Press, New York (2004)"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-48109-5","volume-title":"Principles and Practice of Declarative Programming","author":"M. Garcia-Diaz","year":"1999","unstructured":"Garcia-Diaz, M., Nieva, S.: In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, ACM Press, New York (1999)"},{"key":"42_CR7","unstructured":"Heintze, N.C.: Set based program analysis. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA (1992)"},{"key":"42_CR8","first-page":"31","volume-title":"Proceedings of the Seventh International Conference on Logic Programming","author":"S. Haridi","year":"1990","unstructured":"Haridi, S., Janson, S.: Kernel andorra Prolog and its computation model. In: Warren, D.H.D., Szeredi, P. (eds.) Proceedings of the Seventh International Conference on Logic Programming, Jerusalem, pp. 31\u201346. The MIT Press, Cambridge (1990)"},{"key":"42_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/41625.41635","volume-title":"Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages (POPL1987)","author":"J. Jaffar","year":"1987","unstructured":"Jaffar, J., Lassez, J.-L.: Constraint Logic Programming. In: Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages (POPL1987), Munich, Germany, pp. 111\u2013119. ACMPress, New York (1987)"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1040305.1040335","volume-title":"POPL 2005: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"S. Lerner","year":"2005","unstructured":"Lerner, S., Millstein, T., Rice, E., Chambers, C.: Automated soundness proofs for dataflow analyses and transformations via local rules. In: POPL 2005: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 364\u2013377. ACM Press, New York (2005)"},{"issue":"4","key":"42_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1017\/S1471068401001041","volume":"1","author":"J. Leach","year":"2001","unstructured":"Leach, J., Nieva, S., Rodrguez-Artalejo, M.: Constraint logic programming with hereditary harrop formulas. Theory Pract. Log. Program.\u00a01(4), 409\u2013445 (2001)","journal-title":"Theory Pract. Log. Program."},{"key":"42_CR12","first-page":"35","volume-title":"Pedro Barahona and Amy PPDP","author":"P. L\u00f3pez","year":"2005","unstructured":"L\u00f3pez, P., Pfenning, F., Polakow, J., Watkins, K.: Monadic concurrent linear logic programming. In: Felty, P. (ed.) Pedro Barahona and Amy PPDP, pp. 35\u201346. ACM, New York (2005)"},{"key":"42_CR13","unstructured":"Patrick Lincoln and Vijay Saraswat. Proofs as concurrent processes. Technical report, PARC (1993)"},{"key":"42_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic\u00a051, 125\u2013157 (1991)","journal-title":"Annals of Pure and Applied Logic"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Nystrom, N., Clarkson, M.R., Myers, A.C.: Polyglot: An extensible compiler framework for java. In: Proceedings of the Conference on Compiler Construction (CC 2003), April 2003, pp. 1380\u20131152 (2003)","DOI":"10.1007\/3-540-36579-6_11"},{"key":"42_CR16","first-page":"499","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"G. Nadathur","year":"1998","unstructured":"Nadathur, G., Miller, D.: Higher-order logic programming. In: Hogger, C., Gabbay, D., Robinson, A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol.\u00a05, pp. 499\u2013590. Oxford University Press, Oxford (1998)"},{"issue":"2","key":"42_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2307\/421090","volume":"5","author":"P.W. O\u2019Hearn","year":"1999","unstructured":"O\u2019Hearn, P.W., Pym, D.J.: The logic of bunched implications. Bulletin of Symbolic Logic\u00a05(2), 215\u2013244 (1999)","journal-title":"Bulletin of Symbolic Logic"},{"issue":"1","key":"42_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/(SICI)1096-9942(199901\/03)5:1<35::AID-TAPO4>3.0.CO;2-4","volume":"5","author":"M. Odersky","year":"1999","unstructured":"Odersky, M., Sulzmann, M., Wehr, M.: Type inference with constrained types. Theor. Pract. Object Syst.\u00a05(1), 35\u201355 (1999)","journal-title":"Theor. Pract. Object Syst."},{"issue":"1","key":"42_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/200994.201001","volume":"17","author":"J. Palsberg","year":"1995","unstructured":"Palsberg, J.: Closure analysis in constraint form. ACM Trans. Program. Lang. Syst.\u00a017(1), 47\u201362 (1995)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"42_CR20","first-page":"199","volume-title":"Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation","author":"F. Pfenning","year":"1988","unstructured":"Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation, June 1988, pp. 199\u2013208. ACM Press, New York (1988)"},{"key":"42_CR21","volume-title":"Object-oriented type systems","author":"J. Palsberg","year":"1994","unstructured":"Palsberg, J., Schwartzbach, M.I.: Object-oriented type systems. John Wiley and Sons Ltd., Chichester (1994)"},{"key":"42_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/3-540-56596-5","volume-title":"Semantics: Foundations and Applications","author":"J.W. Bakker de","year":"1993","unstructured":"de Bakker, J.W.: A hyperdoctrinal view of concurrent constraint programming. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1992. LNCS, vol.\u00a0666, pp. 457\u2013476. Springer, Heidelberg (1993)"},{"issue":"3","key":"42_CR23","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/291889.291900","volume":"20","author":"W. Pugh","year":"1998","unstructured":"Pugh, W., Wonnacott, D.: Constraint-based array dependence analysis. ACM Trans. Program. Lang. Syst.\u00a020(3), 635\u2013678 (1998)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"42_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/504282.504286","volume-title":"OOPSLA 2001: Proceedings of the 16th ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications","author":"A. Rountev","year":"2001","unstructured":"Rountev, A., Milanova, A., Ryder, B.G.: Points-to analysis for java using annotated constraints. In: OOPSLA 2001: Proceedings of the 16th ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications, pp. 43\u201355. ACM Press, New York (2001)"},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"Saraswat, V.A.: The category of constraint systems is cartesian closed. In: Proceedings of the IEEE Symposium on Logic in Computer Science (1992)","DOI":"10.1109\/LICS.1992.185546"},{"key":"42_CR26","volume-title":"Doctoral Dissertation Award and Logic Programming","author":"V. Saraswat","year":"1993","unstructured":"Saraswat, V.: Concurrent Constraint Programming. In: Doctoral Dissertation Award and Logic Programming, MIT Press, Cambridge (1993)"},{"key":"42_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-55602-8_189","volume-title":"Automated Deduction - CADE-11","author":"N. Shankar","year":"1992","unstructured":"Shankar, N.: Proof search in the intuitionistic sequent calculus. In: Kapur, D. (ed.) CADE 1992. LNCS, vol.\u00a0607, pp. 522\u2013536. Springer, Heidelberg (1992)"},{"key":"42_CR28","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-24580-3_23","volume-title":"Progress in Artificial Intelligence","author":"V. Saraswat","year":"2003","unstructured":"Saraswat, V., Jagadeesan, R., Gupta, V.: jcc: Integrating timed default concurrent constraint programming into Java. In: Pires, F.M., Abreu, S.P. (eds.) EPIA 2003. LNCS (LNAI), vol.\u00a02902, pp. 156\u2013170. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:49:17Z","timestamp":1619506157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11590156_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}