Interprétation abstraite en programmation logique avec contraintes PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Interprétation abstraite en programmation logique avec contraintes PDF full book. Access full book title Interprétation abstraite en programmation logique avec contraintes by Christophe Lecoutre. Download full books in PDF and EPUB format.
Book Description
L'interpretation abstraite est une technique d'analyse statique qui permet d'analyser le comportement dynamique d'un programme. Dans cette these, nous proposons un modele generique d'interpretation abstraite applique a la programmation logique avec contraintes. Ce modele est compose d'une phase d'extension du domaine suivie d'une phase d'abstraction du calcul. L'extension du domaine consiste a integrer de nouvelles contraints au domaine d'un clp-langage et l'abstraction du calcul consiste a forcer la terminaison de la resolution old via l'utilisation conjuguee d'une technique de tabulation et d'operateurs de widening. Nous illustrons ce modele avec une application non triviale portant sur l'inference de types en polog. Pour cette analyse, l'extension du domaine correspond a l'integration de contraintes ensemblistes. Ainsi, les contraintes du langage obtenu portent a la fois sur les termes (ou arbres) finis et sur les ensembles. L'interet de cette combinaison est que les contraints sur les termes permettent de coder les dependances entre les variables et que les contraintes ensemblistes permettent de coder les structurs recursives et non deterministes.
Book Description
L'interpretation abstraite est une technique d'analyse statique qui permet d'analyser le comportement dynamique d'un programme. Dans cette these, nous proposons un modele generique d'interpretation abstraite applique a la programmation logique avec contraintes. Ce modele est compose d'une phase d'extension du domaine suivie d'une phase d'abstraction du calcul. L'extension du domaine consiste a integrer de nouvelles contraints au domaine d'un clp-langage et l'abstraction du calcul consiste a forcer la terminaison de la resolution old via l'utilisation conjuguee d'une technique de tabulation et d'operateurs de widening. Nous illustrons ce modele avec une application non triviale portant sur l'inference de types en polog. Pour cette analyse, l'extension du domaine correspond a l'integration de contraintes ensemblistes. Ainsi, les contraintes du langage obtenu portent a la fois sur les termes (ou arbres) finis et sur les ensembles. L'interet de cette combinaison est que les contraints sur les termes permettent de coder les dependances entre les variables et que les contraintes ensemblistes permettent de coder les structurs recursives et non deterministes.
Book Description
Etude et application de l'interprétation abstraite à la programmation logique. L'approche utilisée est basée sur une étude de graphes représentant unification ou substitution abstraites. Un nouveau schéma d'interprétation abstraite est défini, dont la validité et la consistance sont prouvées. Il est montré que ce choix permet d'améliorer les optimisations présentées comme, par exemple, l'inférence de modes ou la détection statique du point de backtrack à l'intérieur de clauses.
Book Description
Etude et application de l'interprétation abstraite à la programmation logique. L'approche utilisée est basée sur une étude de graphes représentant unification ou substitution abstraites. Un nouveau schéma d'interprétation abstraite est défini, dont la validité et la consistance sont prouvées. Il est montré que ce choix permet d'améliorer les optimisations présentées comme, par exemple, l'inférence de modes ou la détection statique du point de backtrack à l'intérieur de clauses.
Author: Anne Mulkers Publisher: Springer Science & Business Media ISBN: 9783540566946 Category : Computers Languages : en Pages : 236
Book Description
A common hazard for implementations of applicative programming languages is the excessive creation of garbage cells during program execution. The available run-time garbage collecting processes are expensive in time and often require a periodic disruption of the program execution. The present book addresses the problem of memory re-use for logic programs through program analysis rather than by run-time garbage collection. The static analysis is constructed as an application of abstractinterpretation for logic programs. The starting point is a previously developed application of integrated type and mode analysis, which basically supplies a description of the logical terms to which program variables can be bound at run time. The contribution of the book consists of a modular extension of the abstract domain and operations in order to derive run-time properties concerning the sharing and liveness of term substructures dynamically created during program execution. Alsoillustrated is how such information can be used by the compiler to improve the allocation of run-time structures and to automatically introduce destructive assignments in logic languages in a safe and transparent way, thereby shifting some part of the run-time storage reclamation overhead to compile time.
Author: Timothy P. Clement Publisher: Springer Science & Business Media ISBN: 144713494X Category : Computers Languages : en Pages : 345
Book Description
Logic programming synthesis and transformation are methods of deriving logic programs from their specifications and, where necessary, producing alternative but equivalent forms of a given program. The techniques involved in synthesis and transformation are extremely important as they allow the systematic construction of correct and efficient programs and have the potential to enhance current methods of software production. Transformation strategies are also being widely used in the field of logic program development. LOPSTR 91 was the first workshop to deal exclusively with both logic program synthesis and transformation and, as such, filled an obvious gap in the existing range of logic programming workshops. In attempting to cover the subject as comprehensively as possible, the workshop brought together researchers with an interest in all aspects of logic (including Horn Clause and first order logic) and all approaches to program synthesis and transformation. Logic Program Synthesis and Transformation provides a complete record of the workshop, with all the papers reproduced either in full or as extended abstracts. They cover a wide range of aspects, both practical and theoretical, including the use of mode input-output in program transformation, program specification and synthesis in constructive formal systems and a case study in formal program development in modular Prolog. This volume provides a comprehensive overview of current research and will be invaluable to researchers and postgraduate students who wish to enhance their understanding of logic programming techniques.
Author: Patrick Cousot Publisher: MIT Press ISBN: 0262361523 Category : Computers Languages : en Pages : 833
Book Description
Introduction to abstract interpretation, with examples of applications to the semantics, specification, verification, and static analysis of computer programs. Formal methods are mathematically rigorous techniques for the specification, development, manipulation, and verification of safe, robust, and secure software and hardware systems. Abstract interpretation is a unifying theory of formal methods that proposes a general methodology for proving the correctness of computing systems, based on their semantics. The concepts of abstract interpretation underlie such software tools as compilers, type systems, and security protocol analyzers. This book provides an introduction to the theory and practice of abstract interpretation, offering examples of applications to semantics, specification, verification, and static analysis of programming languages with emphasis on calculational design. The book covers all necessary computer science and mathematical concepts--including most of the logic, order, linear, fixpoint, and discrete mathematics frequently used in computer science--in separate chapters before they are used in the text. Each chapter offers exercises and selected solutions. Chapter topics include syntax, parsing, trace semantics, properties and their abstraction, fixpoints and their abstractions, reachability semantics, abstract domain and abstract interpreter, specification and verification, effective fixpoint approximation, relational static analysis, and symbolic static analysis. The main applications covered include program semantics, program specification and verification, program dynamic and static analysis of numerical properties and of such symbolic properties as dataflow analysis, software model checking, pointer analysis, dependency, and typing (both for forward and backward analysis), and their combinations. Principles of Abstract Interpretation is suitable for classroom use at the graduate level and as a reference for researchers and practitioners.
Author: E. A. Yfantis Publisher: Kluwer Academic Publishers ISBN: Category : Computers Languages : en Pages : 684
Book Description
The two volumes of the proceedings of the GWIC'94 conference include state-of-the-art research in the areas of neural networks, artificial intelligence, intelligent databases, image processing and algorithms with application to artificial intelligence. New methods for training feedforward neural networks that accelerate the convergence and verify the training are included. State-of-the-art adaptive back-propagation neural network algorithms based on selective retraining of patterns through error analysis and dynamic adaptation are described. Development of intelligent databases for effective use of information, formal specifications and design language for building large intelligent database applications is presented. State-of-the-art machine-learning expert systems for intelligent tutoring are also included. Finally, intelligent image processing and computer graphics algorithms with applications to medicine, geographic information systems, and representation of natural phenomena are described. This text is the first volume in a set of two.
Author: David Pichardie Publisher: ISBN: Category : Languages : fr Pages : 199
Book Description
Nous nous intéressons dans cette thèse à la preuve formelle de correction des analyses statiques. Nous nous basons sur la théorie de l'interprétation abstraite qui présente une analyse statique comme une sémantique approchée d'un programme. Nous utilisons l'assistant de preuve Coq qui permet d'extraire le contenu calculatoire d'une preuve constructive. L'implémentation Caml certifiée d'une analyse peut ainsi être extraite de la preuve d'existence, pour tout programme, d'une approximation correcte de la sémantique concrète de ce programme. Nous présentons un cadre théorique fondé sur l'interprétation abstraite et permettant le développement formel d'une large gamme d'analyses statiques. Une bibliothèque Coq de construction modulaire de treillis est ensuite proposée. Des preuves complexes de terminaison de calcul itératif de point fixe peuvent ainsi Ítre construites par simple composition de foncteurs. Plusieurs cas d'études pour l'analyse de programme en bytecode Java sont présentés.
Author: Christophe Lecoutre
Author: Christophe Lecoutre
Author: Christophe Lecoutre
Author: Marc-Michel Corsini
Author: Marc-Michel Corsini
Author: Anne Mulkers
Author: Timothy P. Clement
Author: Patrick Cousot
Author: 
Author: E. A. Yfantis
Author: David Pichardie