Cantitate/Preț
Produs

Logic Based Program Synthesis and Transformation

Editat de M. Leuschel
en Limba Engleză Paperback – 18 iun 2003
 This book constitutes the thoroughly refereed post-proceedings of the 12th International Workshop on Logic Based Program Synthesis and Transformation, LOPSTR 2002, held in Madrid, Spain in September 2002.
The 15 revised full papers presented together with 7 abstracts were carefully selected during two rounds of reviewing and revision from 40 submissions. The papers are organized in topical sections on debugging and types, tabling and constraints, abstract interpretation, program refinement, verification, partial evaluation, and rewriting and object-oriented development.
Citește tot Restrânge

Preț: 32097 lei

Preț vechi: 40121 lei
-20% Nou

Puncte Express: 481

Preț estimativ în valută:
5679 6626$ 4965£

Carte tipărită la comandă

Livrare economică 17-31 ianuarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540404385
ISBN-10: 3540404384
Pagini: 296
Ilustrații: X, 279 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.45 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Debugging and Types.- Abstract Diagnosis of Functional Programs.- A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene.- Tabling and Constraints.- Constraint Solver Synthesis Using Tabled Resolution for Constraint Logic Programming.- Translating Datalog-Like Optimization Queries into ILOG Programs.- Tabling Structures for Bottom-Up Logic Programming.- Abstract Interpretation.- A General Framework for Variable Aliasing: Towards Optimal Operators for Sharing Properties.- Two Variables per Linear Inequality as an Abstract Domain.- Convex Hull Abstractions in Specialization of CLP Programs.- Collecting Potential Optimisations.- Program Refinement.- An Operational Approach to Program Extraction in the Calculus of Constructions.- Refinement of Higher-Order Logic Programs.- A Generic Program for Minimal Subsets with Applications.- Verification.- Justification Based on Program Transformation.- Combining Logic Programs and Monadic Second Order Logics by Program Transformation.- Verification in ACL2 of a Generic Framework to Synthesize SAT-Provers.- A Proof System for Information Flow Security.- Partial Evaluation.- Forward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation.- A Fixed Point Semantics for Logic Programs Extended with Cuts.- Abstract Partial Deduction Challenged.- Rewriting and Object-Oriented Development.- Towards Correct Object-Oriented Design Frameworks in Computational Logic.- Mapping Modular SOS to Rewriting Logic.- Program Synthesis Based on the Equivalent Transformation Computation Model.