Logic based program synthesis and transformation : ; revised selected papers 13th international symposium, LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003
This volume contains selected papers from LOPSTR 2003, the 13th Inter- tional Symposium on Logic-Based Program Synthesis and Transformation. The LOPSTR series is devoted to research in logic-based program development. P- ticular topics of interest are speci?cation, synthesis, veri?cation, transforma...
Sparad:
| Huvudupphovsman: | |
|---|---|
| Institutionell upphovsman: | |
| Materialtyp: | Livre numérique |
| Språk: | Anglais |
| Publicerad: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
3018 |
| Ämnen: | |
| Länkar: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmärkning: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Logic based program synthesis and transformation, 13th international symposium, LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Maurice Bruynooghe (ed.), Berlin, Springer, 2004, 1 vol. (X-232 p.), Lecture notes in computer science, 3-540-22174-3 • Logic Based Program Synthesis and Transformation, Texte imprimé, 9783662175088 |
Innehållsförteckning:
- Invited Talk
- Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce
- Specification and Synthesis
- Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures
- Correct OO Systems in Computational Logic
- Specification and Synthesis of Hybrid Automata for Physics-Based Animation
- Adding Concrete Syntax to a Prolog-Based Program Synthesis System
- Verification
- Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables
- Formal Reasoning about Efficient Data Structures: A Case Study in ACL2
- Analysis
- A Program Transformation for Backwards Analysis of Logic Programs
- An Efficient Staging Algorithm for Binding-Time Analysis
- Proving Termination with Adornments
- Transformation and Specialisation
- Constructively Characterizing Fold and Unfold
- Deterministic Higher-Order Patterns for Program Transformation
- From Interpreter to Logic Engine by Defunctionalization
- Linearization by Program Transformation
- Continuation Semantics as Horn Clauses
- Constraints
- Simplification of Database Integrity Constraints Revisited: A Transformational Approach
- Integration and Optimization of Rule-Based Constraint Solvers
- Introducing esra, a Relational Language for Modelling Combinatorial Problems.