Assertion-based debugging of higher-order (C)LP programs
Autor: | Manuel V. Hermenegildo, Nataliia Stulova, José F. Morales |
---|---|
Rok vydání: | 2014 |
Předmět: |
Informática
Correctness Theoretical computer science Syntax (programming languages) Computer science Programming language Semantics (computer science) media_common.quotation_subject Assertion Context (language use) computer.software_genre Debugging TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Constraint logic programming computer Logic programming media_common |
Zdroj: | PPDP,14: proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming | 16th International Symposium on Principles and Practice of Declarative Programming | 08-10 Sep 2014 | Canterbury, Reino Unido Archivo Digital UPM instname PPDP |
Popis: | Higher-order constructs extend the expressiveness of firstorder (Constraint) Logic Programming ((C)LP) both syntactically and semantically. At the same time assertions have been in use for some time in (C)LP systems helping programmers detect errors and validate programs. However, these assertion-based extensions to (C)LP have not been integrated well with higher-order to date. This paper contributes to filling this gap by extending the assertion-based approach to error detection and program verification to the higher-order context within (C)LP. We propose an extension of properties and assertions as used in (C)LP in order to be able to fully describe arguments that are predicates. The extension makes the full power of the assertion language available when describing higher-order arguments. We provide syntax and semantics for (higher-order) properties and assertions, as well as for programs which contain such assertions, including the notions of error and partial correctness. We also discuss several alternatives for performing run-time checking of such programs. |
Databáze: | OpenAIRE |
Externí odkaz: |