{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:43:53Z","timestamp":1725486233741},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433668"},{"type":"electronic","value":"9783540459316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_4","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:53:52Z","timestamp":1181350432000},"page":"37-51","source":"Crossref","is-referenced-by-count":2,"title":["Proving Correctness of Timed Concurrent Constraint Programs"],"prefix":"10.1007","author":[{"given":"Frank S.","family":"de Boer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Gabbrielli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Chiara","family":"Meo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s002360050047","volume":"33","author":"L. Aceto","year":"1996","unstructured":"L. Aceto and D. Murphy. Timing and causality in process algebra. Acta Informatica, 33(4): 317\u2013350, 1996.","journal-title":"Acta Informatica"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BF01898401","volume":"3","author":"J. Baeten","year":"1991","unstructured":"J. Baeten and J. Bergstra. Real time process algebra. Formal Aspects of Computing, 3(2): 142\u2013188, 1991.","journal-title":"Formal Aspects of Computing"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0167-6423(92)90005-V","volume":"19","author":"G. Berry","year":"1992","unstructured":"G. Berry and G. Gonthier. The ESTEREL programming language: Design, semantics and implementation. Science of Computer Programming, 19(2):87\u2013152, 1992.","journal-title":"Science of Computer Programming"},{"issue":"5","key":"4_CR4","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/265943.265954","volume":"19","author":"F.S. Boer de","year":"1997","unstructured":"F.S. de Boer, M. Gabbrielli, E. Marchiori and C. Palamidessi. Proving Concurrent Constraint Programs Correct. TOPLAS, 19(5): 685\u2013725. ACM Press, 1997.","journal-title":"TOPLAS"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"F.S. de Boer, M. Gabbrielli and M.C. Meo. A Timed CCP Language. Information and Computation, 161, 2000.","DOI":"10.1006\/inco.1999.2879"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"F.S. de Boer, M. Gabbrielli, and M. C. Meo. A Denotational Semantics for a Timed Linda Language. In Proc. PPDP 2001. ACM Press, 2001.","DOI":"10.1145\/773184.773188"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"F.S. de Boer, M. Gabbrielli and M.C. Meo. A Temporal Logic for reasoning about Timed Concurrent Constraint Programs. In Proc. TIME 01. IEEE Press, 2001.","DOI":"10.1109\/TIME.2001.930721"},{"key":"4_CR8","series-title":"Lect Notes Comput Sci","first-page":"111","volume-title":"Proc. of CONCUR\u201991","author":"F.S. Boer de","year":"1991","unstructured":"F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. The failure of failures in a paradigm for asynchronous communication. In Proc. of CONCUR\u201991, vol. 527 of LNCS, pages 111\u2013126. Springer-Verlag, 1991."},{"key":"4_CR9","series-title":"Lect Notes Comput Sci","first-page":"296","volume-title":"Proc. of TAPSOFT\/CAAP","author":"F.S. Boer de","year":"1991","unstructured":"F.S. de Boer and C. Palamidessi. A Fully Abstract Model for Concurrent Constraint Programming. In S. Abramsky and T.S.E. Maibaum, editors, Proc. of TAPSOFT\/CAAP, vol. 493 of LNCS, pages 296\u2013319. Springer-Verlag, 1991."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"P. Bremond-Gregoire and I. Lee. A Process Algebra of Communicating Shared Resources with Dense Time and Priorities. Theoretical Computer Science 189, 1997. Springer-Verlag, 1997.","DOI":"10.1016\/S0304-3975(96)00229-0"},{"key":"4_CR11","unstructured":"S. Brookes. A fully abstract semantics of a shared variable parallel language. In Proc. Eighth LICS. IEEE Computer Society Press, 1993."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"S. Cook. Soundness and completeness of an axiom system for program verification. SIAM Journal of Computation 7, 1, 70\u201390.","DOI":"10.1137\/0207005"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"M. Falaschi, A. Policriti, A. Villanueva. Modeling Concurrent systems specified in a Temporal Concurrent Constraint language. in Proc. AGP\u20192000. 2000.","DOI":"10.1016\/S1571-0661(04)00157-4"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1017\/S0269888900007670","volume":"6","author":"M. Fisher","year":"1996","unstructured":"M. Fisher. An introduction to Executable Temporal Logics. Knowledge Engineering Review, 6(1): 43\u201356, 1996.","journal-title":"Knowledge Engineering Review"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"N. Halbwachs, P. Caspi, and D. Pilaud. The synchronous programming language LUSTRE. In Special issue on Another Look at Real-time Systems, Proceedings of the IEEE, 1991.","DOI":"10.1109\/5.97300"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"D. Harel. Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming 8, pages 231\u2013274, 1987.","journal-title":"Science of Computer Programming"},{"key":"4_CR17","unstructured":"L. Henkin, J.D. Monk, and A. Tarski. Cylindric Algebras (Part I). North-Holland, 1971."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/inco.1995.1041","volume":"117","author":"M. Hennessy","year":"1995","unstructured":"M. Hennessy and T. Regan. A temporal process algebra. Information and Computation, 117: 221\u2013239, 1995.","journal-title":"Information and Computation"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"P. Le Guernic, M. Le Borgue, T. Gauthier, and C. Le Marie. Programming real time applications with SIGNAL. In Special issue on Another Look at Real-time Systems, Proceedings of the IEEE, 1991.","DOI":"10.1109\/5.97301"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"B. Jonsson. A model and a proof system for asynchronous processes. In Proc. of the 4th ACM Symp. on Principles of Distributed Computing, pages 49\u201358. ACM Press, 1985.","DOI":"10.1145\/323596.323601"},{"key":"4_CR21","unstructured":"M. Nielsen and F.D. Valencia. The ntcc Calculus and its applications. Draft, 2001."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. The temporal logic of reactive systems. Springer-Verlag, 1991.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"4_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-45578-7_21","volume-title":"Proc. CP 0 1","author":"C. Palamidessi","year":"2001","unstructured":"C. Palamidessi and F.D. Valencia. A Temporal Concurrent Constraint Programming Calculus. In Proc. CP 0 1, LNCS 2239, pag. 302\u2013316. Springer-Verlag, 2001."},{"key":"4_CR24","unstructured":"V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, January 1989. Published by The MIT Press, 1991."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"V.A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. of POPL, pages 232\u2013245. ACM Press, 1990.","DOI":"10.1145\/96709.96733"},{"issue":"5\u20136","key":"4_CR26","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1006\/jsco.1996.0064","volume":"22","author":"V.A. Saraswat","year":"1996","unstructured":"V.A. Saraswat, R. Jagadeesan, and V. Gupta Timed Default Concurrent Constraint Programming. Journal of Symbolic Computation, 22(5\u20136):475\u2013520, 1996.","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"V.A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of Concurrent Constraint Programming. In Proc. of POPL. ACM Press, 1991.","DOI":"10.1145\/99583.99627"},{"key":"4_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/3-540-59155-9_14","volume-title":"Constraints: Basics and Trends","author":"G. Smolka","year":"1995","unstructured":"G. Smolka. The Definition of Kernel Oz. In A. Podelski editor, Constraints: Basics and Trends, vol. 910 of LNCS, pages 251\u2013292. Springer-Verlag, 1995."},{"key":"4_CR29","unstructured":"F.D. Valencia. Reactive Constraint Programming. Brics Progress Report, June 2000."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45931-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:19:29Z","timestamp":1556479169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}