Listing 1 - 10 of 108 | << page >> |
Sort by
|
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
Constraint Handling Rules (CHR), closely related to Logic Programming (LP), is a declarative programming language. Over the years, the language proved successful for implementing many kinds of problems efficiently. Mainly this, but also its simple syntax and semantics, accounts for its success and impact on the research community. To further encourage the use of CHR, we need to further improve its efficiency of execution. To this end, termination analysis of CHR can be seen as one of the main sources of input. Furthermore, in the context of program debugging, termination analysis of CHR is an important asset. Due to the many language specifics, it is often hard for programmers to point out unwanted loops in their CHR programs. It is therefore essential to have a good understanding of the termination problem in CHR. Until recently, however, there was only an informal discussion on termination of the subset of CHR that only considers simplification rules. The contributions of this thesis are therefore twofold. First, we provide for a theoretical framework for termination analysis of the full CHR language. Secondly, based on this theoretical framework, we derive an approach for automated termination analysis of CHR. This approach extends the approaches in LP to integer polynomial interpretations and can be modularised. Furthermore, the approach is practical, as we demonstrate with T*CoP, a Termination analyser for CHR on top of Prolog.
Choose an application
All software is represented as source code in a programming language. Th e programming language defines the meaning or semantics of the code, for example, its operational behaviour. Computational source code is often accompanied by additional specifications that define how the source code should be interpreted or provide additional information about the softw ares semantics. They make it possible for programmers to express and ve rify that their software has the intended semantics and to express inter -component semantic assumptions. Good representations and specifications of software components are crucial for efficiently producing software t hat is reliable, efficient and secure, and for preserving these qualitie s during the softwares evolution.Many types of software compone nts and their desired semantic properties can be challenging to represen t and specify. In this work, I contribute novel functional techniques fo r the representation and specification of four types of software compone nts:
681.3 <043> --- academic collection --- Computerwetenschap--Dissertaties
Choose an application
Choose an application
Listing 1 - 10 of 108 | << page >> |
Sort by
|