Abstract
A general framework based on Hoare logic is introduced for specifying and reasoning about Constraint Logic Programs with dynamic scheduling. The framework consists of a mixed formalism of programs in a ccp-like language, on the one hand, and correctness properties of the Hoare logic, on the other hand. In this formalism delay conditions are viewed as a specific class of correctness properties. In the construction of the proof-system we follow the lines of a previous proof-system we developed for concurrent constraint programming, which was sound, but not complete (for ccp). Due to the different kind of choice used in CLP, on the contrary, the system considered here is both sound and complete.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. R. Apt. Declarative Programming in Prolog. In D. Miller, editor, Proceedings of the Int'l Symposium on Logic Programming, The MIT Press, pages 11–35x, 1993.
K. R. Apt and I. Luitjes. Verification of logic programs with delay declarations. In A. Borzyszkowski and S. Sokolowski, editors, Proc. of AMAST, LNCS, pages 1–19, Berlin, 1995. Springer-Verlag.
F.S. de Boer, M. Gabbrielli, E. Marchiori, and C. Palamidessi. Proving Concurrent Constraint Programs Correct. In Proc. of Twentyfirst POPL, ACM Press, 1994.
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, LNCS 493, pages 296–319. Springer-Verlag, 1991.
M. Carlsson. SICStus Prolog User's Manual. Po Box 1263, S-16313 Spanga, Sweden, February 1988.
S.A. Cook. Soundness and completeness of an axiom system for program verification. SIAM J. Computation, 7(1):70–90, 1978.
P. M. Hill and J. W. Lloyd. The Gödel programming language. The MIT Press, 1994.
L. Henkin, J.D. Monk, and A. Tarski. Cylindric Algebras (Part I). North-Holland, 1971.
J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. of POPL, pages 111–119. ACM Press, 1987.
Joxan Jaffar and Michael J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19/20:503–581, 1994.
R. Jagadeesan, V.A. Saraswat, and V. Shanbhogue. Angelic non-determinism in concurrent constraint programming. Technical report, Xerox Park, 1991.
S. Lüttringhaus-Kappel. Control generation for logic programs. In D.S. Warren, editor, Proc. Tenth Int'l Conf. on Logic Programming, pages 478–495. MIT Press, 1993.
E. Marchiori and F. Teusink. Proving termination of logic programs with delay declarations. In J. Lloyd, editor, Proc. of ILPS. MIT Press, 1995.
K. Marriott, M. Falaschi, M. Gabbrielli and C. Palamidessi. A simple semantics for logic programming languages with delay. In R. Kotagiri, editor, Proc. Eighteenth Australian Computer Science Conf., Australian Computer Science Comm. 17 (1): 356–363, 1995.
K. Marriott, M. Garcia de la Banda and M. Hermenegildo. Analyzing Logic Programs with Dynamic Scheduling. Proc. of POPL, pages 240–253. ACM Press, 1994.
L. Naish. An introduction to MU-Prolog. Technical Report 82/2, The University of Melbourne, 1982.
L. Naish. Negation and Control in Prolog, LNCS 238, Springer-Verlag, 1985.
V.A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. of POPL, pages 232–245, 1990.
V.A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of Concurrent Constraint Programming. In Proc. of POPL, 1991.
Mark Wallace and André Veron. Two problems — two solutions: One system — ECLiPSe. In Proc. IEEE Colloquium on Advanced Software Technologies for Scheduling, London, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Boer, F.S., Gabbrielli, M., Palamidessi, C. (1996). Proving correctness of Constraint Logic Programs with dynamic scheduling. In: Cousot, R., Schmidt, D.A. (eds) Static Analysis. SAS 1996. Lecture Notes in Computer Science, vol 1145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61739-6_35
Download citation
DOI: https://doi.org/10.1007/3-540-61739-6_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61739-6
Online ISBN: 978-3-540-70674-8
eBook Packages: Springer Book Archive