LIPIcs.ICLP.2011.280.pdf
- Filesize: 212 kB
- 4 pages
Document
Correct Reasoning about Logic Programs
Author
-
Part of:
Volume:
Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (ICLP 2011)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Logic Programming (ICLP) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2011-06-27
Cite As Get BibTex
Jael Kriener. Correct Reasoning about Logic Programs. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 280-283, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.ICLP.2011.280
Abstract
In this PhD project, we present an approach to the problem of determinacy inference in logic programs with cut, which treats cut uniformly and contextually. The overall aim is to develop a theoretical analysis, abstract it to a suitable domain and prove both the concrete analysis and the abstraction correct in a formal theorem prover (Coq). A crucial advantage of this approach, besides the guarantee of correctness, is the possibility of automatically extracting an implementation of the analysis.
Subject Classification
Keywords
- Prolog
- cut
- determinacy inference
- abstract interpretation
- denotational semantics
- automated theorem proving
- Coq
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads