Logic-Based Program Synthesis and Transformation: Lecture Notes in Computer Science, cartea 10184
Editat de Manuel V Hermenegildo, Pedro Lopez-Garciaen Limba Engleză Paperback – 25 iul 2017
The 20 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 38 submissions. The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. LOPSTR traditionally solicits contributions, in any language paradigm, in the areas of synthesis, specification, transformation, analysis and verification, specialization, testing and certification, composition, program/model manipulation, optimization, transformational techniques in SE, inversion,applications, and tools.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 326.26 lei
Preț vechi: 407.83 lei
-20%
Puncte Express: 489
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783319631387
ISBN-10: 3319631381
Pagini: 380
Ilustrații: XVI, 361 p. 75 illus.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.58 kg
Ediția:1st edition 2017
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3319631381
Pagini: 380
Ilustrații: XVI, 361 p. 75 illus.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.58 kg
Ediția:1st edition 2017
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Partial Evaluation of Order-sorted Equational Programs modulo Axioms.- A Formal, Resource Consumption-Preserving Translation of Actors to Haskell.- Verification of Time-Aware Business Processes using Constrained Horn Clauses.- MiniZinc with Strings.- Slicing Concurrent Constraint Programs.- A New Functional-Logic Compiler for Curry: Sprite.- lpopt: A Rule Optimization Tool for Answer Set Programming.- Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs.- Hierarchical Shape Abstraction for Analysis of Free List Memory Allocators.- A Productivity Checker for Logic Programming.- Symbolic Abstract Contract Synthesis in a Rewriting Framework.- On the Completeness of Selective Uni_cation in Concolic Testing of Logic Programs.- CurryCheck: Checking Properties of Curry Programs.- A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms.- A Reversible Semantics for Erlang.- Scaling Bounded Model Checking By Transforming Programs With Arrays.- Coinductive Soundness of Corecursive Type Class Resolution.- Nominal Unification of Higher Order Expressions with Recursive Let.- Automata Theory Approach to Predicate Intuitionistic Logic.