Logic-Based Program Synthesis and Transformation: 26th International Symposium, LOPSTR 2016, Edinburgh, UK, September 6–8, 2016, Revised Selected Papers: 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ț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 336.54 lei
Preț vechi: 420.67 lei
-20% Nou
Puncte Express: 505
Preț estimativ în valută:
64.41€ • 66.44$ • 54.51£
64.41€ • 66.44$ • 54.51£
Carte tipărită la comandă
Livrare economică 05-19 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319631387
ISBN-10: 3319631381
Pagini: 329
Ilustrații: XVI, 361 p. 75 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.53 kg
Ediția:1st ed. 2017
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
ISBN-10: 3319631381
Pagini: 329
Ilustrații: XVI, 361 p. 75 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.53 kg
Ediția:1st ed. 2017
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
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.
Caracteristici
Includes supplementary material: sn.pub/extras