Abstract
Concurrent constraint programs operate on data which is represented by a constraint of a given cylindric constraint system. Such a system provides an algebraic representation of first-order logic. It features a (binary) entailment relation, a binary union operation for adding information (formally defined as the least upper bound of two constraints with respect to the entailment relation) and, and finally, existential quantification of variables.
The main contribution of this paper is a sound and complete proof theory based on traces of input/output constraints for reasoning about the correctness of concurrent constraint programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Courcelle, B.: The monadic second-order logic of graphs, ii: Infinite graphs of bounded width. Mathematical Systems Theory 21(1), 187–221 (1988)
De Boer, F.S., Gabbrielli, M., Marchiori, E., Palamidessi, C.: Proving concurrent constraint programs correct. ACM Transactions on Programming Languages and Systems (TOPLAS) 19(5), 685–725 (1997)
De Boer, F.S., Palamidessi, C.: A fully abstract model for concurrent constraint programming. In: TAPSOFT 1991, pp. 296–319. Springer, Heidelberg (1991)
Fages, F.: Concurrent constraint programming and linear logic (abstract). In: Proceedings of the 2nd ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP 2000, p. 44. ACM, New York (2000)
Fages, F., Ruet, P., Soliman, S.: Phase semantics and verification of concurrent constraint programs. In: LICS, pp. 141–152 (1998)
Nakata, K., Uustalu, T.: A hoare logic for the coinductive trace-based big-step semantics of while. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 488–506. Springer, Heidelberg (2010)
Ruet, P., Fages, F.: Concurrent constraint programming and non-commutative logic. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 406–423. Springer, Heidelberg (1998)
Saraswat, V.A., Rinard, M., Panangaden, P.: The semantic foundations of concurrent constraint programming. In: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 333–352. ACM (1991)
Zwiers, J., de Roever, W.P., van Emde Boas, P.: Compositionality and concurrent networks: Soundness and completeness of a proofsystem. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 509–519. Springer, Heidelberg (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
de Boer, F.S., Gabbrielli, M. (2014). Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs. In: van Breugel, F., Kashefi, E., Palamidessi, C., Rutten, J. (eds) Horizons of the Mind. A Tribute to Prakash Panangaden. Lecture Notes in Computer Science, vol 8464. Springer, Cham. https://doi.org/10.1007/978-3-319-06880-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-06880-0_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06879-4
Online ISBN: 978-3-319-06880-0
eBook Packages: Computer ScienceComputer Science (R0)