Logic-Based Program Synthesis and Transformation [electronic resource] : 26th International Symposium, LOPSTR 2016, Edinburgh, UK, September 6–8, 2016, Revised Selected Papers / edited by Manuel V Hermenegildo, Pedro Lopez-Garcia.

Інтелектуальна відповідальність: Вид матеріалу: Текст Серія: Theoretical Computer Science and General Issues ; 10184Публікація: Cham : Springer International Publishing : Imprint: Springer, 2017Видання: 1st ed. 2017Опис: XVI, 361 p. 75 illus. online resourceТип вмісту:
  • text
Тип засобу:
  • computer
Тип носія:
  • online resource
ISBN:
  • 9783319631394
Тематика(и): Додаткові фізичні формати: Printed edition:: Немає назви; Printed edition:: Немає назвиДесяткова класифікація Дьюї:
  • 005.1015113 23
Класифікація Бібліотеки Конгресу:
  • QA76.9.L63
  • QA76.5913
Електронне місцезнаходження та доступ:
Вміст:
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.
У: Springer eBooksЗведення: This book constitutes the thoroughly refereed post-conference proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2016, held in Edinburgh, UK, in September 2016. 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.
Тип одиниці: ЕКнига Списки з цим бібзаписом: Springer Ebooks (till 2020 - Open Access)+(2017 Network Access)) | Springer Ebooks (2017 Network Access))
Мітки з цієї бібліотеки: Немає міток з цієї бібліотеки для цієї назви. Ввійдіть, щоб додавати мітки.
Оцінки зірочками
    Середня оцінка: 0.0 (0 голос.)
Немає реальних примірників для цього запису

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.

This book constitutes the thoroughly refereed post-conference proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2016, held in Edinburgh, UK, in September 2016. 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.

Available to subscribing member institutions only. Доступно лише організаціям членам підписки.

Online access from local network of NaUOA.

Online access with authorization at https://link.springer.com/

Онлайн-доступ з локальної мережі НаУОА.

Онлайн доступ з авторизацією на https://link.springer.com/

Немає коментарів для цієї одиниці.

для можливості публікувати коментарі.