Logic Based Program Synthesis and Transformation
Editat de Sandro Etalleen Limba Engleză Paperback – 24 iun 2005
Preț: 320.76 lei
Preț vechi: 400.94 lei
-20% Nou
Puncte Express: 481
Preț estimativ în valută:
56.75€ • 66.22$ • 49.62£
56.75€ • 66.22$ • 49.62£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540266556
ISBN-10: 3540266550
Pagini: 292
Ilustrații: VIII, 284 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.45 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540266550
Pagini: 292
Ilustrații: VIII, 284 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.45 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Verification and Analysis.- Searching Semantically Equivalent Code Fragments in Logic Programs.- Determinacy Analysis for Logic Programs Using Mode and Type Information.- Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs.- Fully Automatic Binding-Time Analysis for Prolog.- Theory and Security.- Logical Mobility and Locality Types.- Unwinding Conditions for Security in Imperative Languages.- Natural Rewriting for General Term Rewriting Systems.- Transformations.- Negation Elimination for Finite PCFGs.- Specialization of Concurrent Guarded Multi-set Transformation Rules.- Efficient Local Unfolding with Ancestor Stacks for Full Prolog.- Program Development.- Schema-Guided Synthesis of Imperative Programs by Constraint Solving.- Run-Time Profiling of Functional Logic Programs.- Constructive Specifications for Compositional Units.- Termination.- Input-Termination of Logic Programs.- On Termination of Binary CLP Programs.- Program Development and Synthesis.- From Natural Semantics to Abstract Machines.- Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis.