Program Development in Computational Logic A Decade of Research Advances in Logic-Based Program Development /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Bruynooghe, Maurice (Επιμελητής έκδοσης), Lau, Kung-Kiu (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
• Σειρά: Lecture Notes in Computer Science, 3049
• Θέματα: Computer science.; Computer programming.; Software engineering.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Artificial intelligence.; Computer Science.; Artificial Intelligence (incl. Robotics).; Logics and Meanings of Programs.; Programming Techniques.; Mathematical Logic and Formal Languages.; Software Engineering.; Programming Languages, Compilers, Interpreters.

1 The tenth anniversary of the LOPSTR symposium provided the incentive for this volume. LOPSTR started in 1991 as a workshop on logic program synthesis and transformation, but later it broadened its scope to logic-based program development in general, that is, program development in computational lo...

Πίνακας περιεχομένων:

• Specification and Synthesis
• Specifying Compositional Units for Correct Program Development in Computational Logic
• Synthesis of Programs in Computational Logic
• Developing Logic Programs from Specifications Using Stepwise Refinement
• Semantics
• Declarative Semantics of Input Consuming Logic Programs
• On the Semantics of Logic Program Composition
• Analysis
• Analysing Logic Programs by Reasoning Backwards
• Binding-Time Analysis for Mercury
• A Generic Framework for Context-Sensitive Analysis of Modular Programs
• Transformation and Specialisation
• Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems
• Transformation Rules for Locally Stratified Constraint Logic Programs
• Specialising Interpreters Using Offline Partial Deduction
• Termination
• Characterisations of Termination in Logic Programming
• On the Inference of Natural Level Mappings
• Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
• Systems
• Herbrand Constraints in HAL.